An efficient incremental mining algorithm-QSD

Intelligent Data Analysis

Volumn 11, Issue 3, 2007, Pages 265-278

  Huang, Jen Peng ^a,c   Chen, Show Ju ^a   Kuo, Huang Cheng ^b  

^a SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^b NATIONAL CHIAYI UNIVERSITY   (Taiwan)

^c NONE   (Taiwan)

Author keywords

Association rule; Data mining; Frequent itemset

Indexed keywords

EID: 41749106451     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2007-11304     Document Type: Article

References (16)

1. R. Agrawal, T. Imielinski and A. Swami, Mining Association Rules Between Sets of Items in Large Databases, In proc. of the ACM SIGMOD Conference on Management of Data, 1993, 207-216.
2. R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules, Proc. of the 20th Int'l Conference on Very Large Databases, Santiago, Chile, Sep. 1994.
3. R.J. Bayardo, Efficiently mining long patterns from databases. In Proc. ACM-SIGMOD Ont. Conf. Management of data (SIGMOD'98), Seattle, WA, 1998, 85-93.
4. S. Brin, R. Motwani and C. Silverstein, Beyond market basket: Generalizing association rules to correlations, In Proc. ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'97), Tucson, Arizona, 1997, 265-276.
5. J. Han, G. Dong and Y. Yin, Efficient mining of partial periodic patterns in time series database, In Proc. Int. Conf. Data Engineering (ICDE'99), Sydney, Australia, 1999, 106-115.
6. J. Han, J. Pei and Y. Yin, Mining Frequent Patterns without Candidate Generation, Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00), May 2000, Dallas, TX, 1-12.
7. J. Han and M. Kamber, Data mining: Concepts and Techniques, Academic Press, 2001.
8. Jen-peng Huang and I-pei Chien, An New Efficient Algorithm for Mining Association rules, Journal of Shu-te University 5(2) (June, 2003), 223-235.
9. J.-p. Huang, I.-p. Chien and S.-H. Wu, An Efficient Algorithm for Mining Association Rules-ICI, Proceedings of the 14th international conference on information management, 2003, Chiayi, P155.
10. IBM Data Mining Web Site: http://www.almaden.ibm.com/cs/quest/index.html.
11. M. Kamber, J. Han and J. Y. Chiang, metarule-guides mining of multi-dimensional association rules using data cubes, In Proc. Int. Conf. Knowledge discovery and Data Mining (KDD'97), Newport Beach, 1997, CA, 207-210.
12. J.-S. Park, M-S. Chen and P.S. Yu, Using a Hash-Based Method with Transaction Trimming for Mining Association Rules, IEEE Trans. on Knowledge and Data Engineering 9(5) (Oct. 1997), 813-825.
13. N. Pasquier, Y. Bastide, R. Taouil and L. Lakhal, Efficient Mining of Association Rules Using Closed Itemset Lattices, Information Systems 24(1) (March 1999), 25-46.
14. A. Savasere, E. Omiecinski and S. Navathe, An Efficient Algorithm for Mining Association Rules in Large Databases, Proc. Int'l Conf. Very Large Data Bases, Zurich, Switzerland, Sep. 1995, 432-444.
15. H. Toivonen, Sampling Large Databases For Association Rules, The 22th International Conference on Very Large Databases (VLDB'96), Mumbay, India, Sep. 1996, 134-145.
16. J.-H. Tsu, A Study on Efficient Mining of Association Rules for Limited Number of Items and Short Transaction Length, Thesis, department of Information engineering and Computer Science, 2002, Feng Chia University.