loading...
A Database-Reduction-Based Algorithm for Episode Mining
Taipei, Taiwan December 04-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.3Seventh International Conference on P ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yunlan Wang, Northwestern Polytechnical University, China
Xingshe Zhou, Northwestern Polytechnical University, China
Peiqi Liu, Xi'an University of Architecture and Technology, China
Event Sequence arises naturally in many applications. Episode mining can discovery the knowledge hidden in the event sequence. Currently, the most influential algorithm for episode mining is WINEPI. However, it is likely to suffer from the tendency of generating too many of candidate episodes. In this paper, a novel algorithm named DRE for mining frequent episodes is presented. It studied the conditions for the events which can be pruned from the database, so the size of database is reduced gradually. The performance of algorithm DRE was evaluated and compared with WINEPI algorithm. The results demonstrate that the DRE has better performance.
Citation:
Yunlan Wang, Xingshe Zhou, Peiqi Liu, "A Database-Reduction-Based Algorithm for Episode Mining," pdcat, pp.123-127, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.