Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism

Decision Support Systems

Volumn 42, Issue 1, 2006, Pages 1-24

  Hu, Ya Han ^a   Chen, Yen Liang ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Association rules; Data mining; FP tree; Minimum supports

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; TREES (MATHEMATICS); USER INTERFACES;

APRIORI-BASED ALGORITHM; ASSOCIATION RULES; FP-TREE; MINIMUM SUPPORTS;

DATA MINING;

EID: 33747762924     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2004.09.007     Document Type: Article

References (15)

1. Agrawal R., and Srikant R. Fast algorithms for mining association rules. Proceedings of the 20th Very Large DataBases Conference (VLDB'94), Santiago de Chile, Chile (1994) 487-499
2. Chen M.S., Han J., and Yu P.S. Data mining: an overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering 8 (1996) 866-883
3. Cheung W., and Zaiane O.R. Incremental mining of frequent patterns without candidate generation or support constraint. Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS'03), Hong Kong (2003) 111-116
4. Cheung D., Han J., Ng V., and Wong C.Y. Maintenance of discovered association rules in large databases: an incremental updating technique. Proceedings of International Conference on Data Engineering (ICDE'96), New Orleans, LA, USA (1996) 106-114
5. Feldman R., Aumann Y., Amir A., and Mannila H. Efficient algorithm for discovering frequent sets in incremental databases. Proceedings of SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'97), Tucson, AZ, USA (1997) 59-66
6. Han J., and Fu Y. Discovery of multiple-level association rules from large databases. Proceedings of the 21th Very Large DataBases Conference (VLDB'95), Zurich, Switzerland (1995) 420-431
7. Han J., and Kamber M. Data Mining: Concepts and Techniques (2001), Morgan Kaufmann Publisher, San Francisco, CA, USA
8. Han J., Pei J., and Yin Y. Mining frequent patterns without candidate generation. Proceedings 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD'00), Dallas, TX, USA (2000)
9. Lee W., Stolfo S.J., and Mok K.W. Mining audit data to build intrusion detection models. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD '98), New York, NY, USA (1998)
10. Liu B., Hsu W., and Ma Y. Mining association rules with multiple minimum supports. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-99), San Diego, CA, USA (1999)
11. Mannila H. Database methods for data mining. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD '98) tutorial, New York, NY, USA (1998)
12. Pudi V., and Haritsa J.R. Quantifying the utility of the past in mining large databases. Information Systems 25 5 (2000) 323-343
13. Thomas S., Bodagala S., Alsabti K., and Ranka S. An efficient algorithm for the incremental update of association rules in large database. International Conference on Knowledge Discovery and Data Mining (KDD'97), Newport, CA, USA (1997)
14. Tseng M.C., and Lin W.Y. Mining generalized association rules with multiple minimum supports. International Conference on Data Warehousing and Knowledge Discovery (DaWaK'01), Munich, Germany (2001) 11-20
15. Zheng Z., Kohavi R., and Mason L. Real world performance of association rule algorithms. Proceedings of the 7th ACM-SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA (2001) 401-406