loading...
Adaptive AFOPT Algorithm
Timisoara, Romania September 25-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SYNASC.2005.17Seventh International Symposium on Sy ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cornelia Györödi, University of Oradea
Robert Györödi, University of Oradea
Mirela Pater, University of Oradea
Ovidiu Boc, University of Oradea
Zoltan David, University of Oradea
Mining frequent patterns is a fundamental part of data mining. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. The Apriori is the first algorithm which uses the Apriori property to prune the search space. In this paper the AFOPT algorithm is adapted for mining at different levels by using different support. Furthermore, the efficiency of this algorithm is being shown by comparing it to similar algorithms.
Citation:
Cornelia Györödi, Robert Györödi, Mirela Pater, Ovidiu Boc, Zoltan David, "Adaptive AFOPT Algorithm," synasc, pp.134-138, Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.