loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Data Engineering (ICDE'05)
Tokyo, Japan
April 05-April 08
ISBN: 0-7695-2285-8
Osmar R. Zaïane, University of Alberta Edmonton
Mohammad El-Hajj, University of Alberta Edmonton
Yi Li, University of Alberta Edmonton
Stella Luk, University of Alberta Edmonton

Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been an important issue in databases and has played a significant role in the development, deployment and adoption of technologies.

To help assessing the myriad algorithms for frequent itemset mining, we built an open framework and testbed to analytically study the performance of different algorithms and their implementations, and contrast their achievements given different data characteristics, different conditions, and different types of patterns to discover and their constraints. This facilitates reporting consistent and reproducible performance results using known conditions.

Citation:
Osmar R. Zaïane, Mohammad El-Hajj, Yi Li, Stella Luk, "Scrutinizing Frequent Pattern Discovery Performance," icde, pp.1109-1110, 21st International Conference on Data Engineering (ICDE'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.