File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Mining Time-Delayed Associations from Discrete Event Datasets

TitleMining Time-Delayed Associations from Discrete Event Datasets
Authors
Issue Date2007
PublisherSpringer Berlin Heidelberg
Citation
12th International Conference on Database Systems for Advanced Applications (DASFAA 2007), Bangkok, Thailand, 9-12 April 2007. In Advances in Databases: Concepts, Systems and Applications, 2007, v. 4443, p. 103-114 How to Cite?
AbstractWe study the problem of finding time-delayed associations among types of events from an event dataset. We present a baseline algorithm for the problem. We analyse the algorithm and identify two methods for improving efficiency. First, we propose pruning strategies that can effectively reduce the search space for frequent time-delayed associations. Second, we propose the breadth-first* (BF*) candidate-generation order. We show that BF*, when coupled with the least-recently-used cache replacement strategy, provides a significant saving in I/O cost. Experiment results show that combining the two methods results in a very efficient algorithm for solving the time-delayed association problem.
Persistent Identifierhttp://hdl.handle.net/10722/93033
ISBN
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252

 

DC FieldValueLanguage
dc.contributor.authorLoo, KKen_HK
dc.contributor.authorKao, CMen_HK
dc.date.accessioned2010-09-25T14:48:51Z-
dc.date.available2010-09-25T14:48:51Z-
dc.date.issued2007en_HK
dc.identifier.citation12th International Conference on Database Systems for Advanced Applications (DASFAA 2007), Bangkok, Thailand, 9-12 April 2007. In Advances in Databases: Concepts, Systems and Applications, 2007, v. 4443, p. 103-114-
dc.identifier.isbn978-3-540-71702-7-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/93033-
dc.description.abstractWe study the problem of finding time-delayed associations among types of events from an event dataset. We present a baseline algorithm for the problem. We analyse the algorithm and identify two methods for improving efficiency. First, we propose pruning strategies that can effectively reduce the search space for frequent time-delayed associations. Second, we propose the breadth-first* (BF*) candidate-generation order. We show that BF*, when coupled with the least-recently-used cache replacement strategy, provides a significant saving in I/O cost. Experiment results show that combining the two methods results in a very efficient algorithm for solving the time-delayed association problem.-
dc.languageengen_HK
dc.publisherSpringer Berlin Heidelberg-
dc.relation.ispartofAdvances in Databases: Concepts, Systems and Applicationsen_HK
dc.relation.ispartofLecture Notes in Computer Science-
dc.titleMining Time-Delayed Associations from Discrete Event Datasetsen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailKao, CM: kao@cs.hku.hken_HK
dc.identifier.authorityKao, CM=rp00123en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-540-71703-4_11-
dc.identifier.hkuros129366en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats