An efficient and flexible algorithm for online mining of large itemsets

Information Processing Letters

Volumn 92, Issue 6, 2004, Pages 311-316

  Jea, Kuen Fang ^a   Chang, Ming Yuan ^a   Lin, Ke Chung ^a  

^a NATIONAL CHUNG HSING UNIVERSITY   (Taiwan)

Author keywords

Combinatorial approximation; Data mining; Database; Online algorithms; Threshold independent

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; DATABASE SYSTEMS; ERROR ANALYSIS; ONLINE SYSTEMS;

COMBINATORIAL APPROXIMATION; ITEMSETS; ONLINE ALGORITHMS; THRESHOLD-INDEPENDENT;

DATA MINING;

EID: 9544243731     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.09.008     Document Type: Article

References (9)

1. C.C. Aggarwal, P.S. Yu, A new approach to online generation of association rules, IEEE Trans. Knowledge Data Engrg. 13 (4) (2001) 527-540.
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules, in: Proc. 20th VLDB Conf., 1994, pp. 487-499.
3. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proc. of the 2000 ACM SIGMOD Internat. Conf. on Management of Data, 2000, pp. 1-12.
4. K.-F. Jea, C.-H. Hsu, Using reduced itemset lattice to support online mining for dynamic databases, in: Proc. of the 2000 Internat. Comput. Symp. - Workshop on Software Engineering and Database Systems, 2000, pp. 99-106.
5. N. Linial, N. Nisan, Approximate inclusion-exclusion, Combinatorica 10 (1990) 349-365.
6. C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968.
7. J.S. Park, M.S. Chen, P.S. Yu, An effective hash based algorithm for mining association rules, in: Proc. ACM SIGMOD Internat. Conf. on Management of Data, 1995, pp. 175-186.
8. R. Relue, X. Wu, H. Huang, Efficient runtime generation of association rules, in: Proc. 10th Internat. Conf. on Information and Knowledge Management, 2001, pp. 466-473.
9. IBM Almaden-quest, Data mining synthetic data generation code, http://www.almaden.ibm.com/software/quest/.