An algorithm for mining implicit itemset pairs based on differences of correlations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3735 LNAI, Issue , 2005, Pages 227-240

  Taniguchi, Tsuyoshi ^a   Haraguchi, Makoto ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; CORRELATION METHODS; INFORMATION ANALYSIS; PROBLEM SOLVING;

COMPOUND ITEMSETS;

DATABASE SYSTEMS;

EID: 33745304593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11563983_20     Document Type: Conference Paper

References (13)

1. T. Taniguchi, M. Haraguchi and Y. Okubo. Discovery of hidden correlations in a local transaction database based on differences of correlations. In Proc. of the IAPR Int'l Conf. on Machine Learning and Data Mining in Pattern Recognition, 2005 (to appear).
2. R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. of the ACM-SIGMOD Int'l Conf. on Management of Data, 85-93, 1998.
3. T. Uno, M. Kiyomi and H. Arimura. LCM ver.2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets. In Proc. of the IEEE Int'l Conf. on data mining, 2nd Workshop on Frequent Itemset Mining Implementations (FIMI'04), 2004.
4. R. Agrawal, R. Srikant. Fast algorithms for mining association rules. In Proc. of the Int'l Conf. on Very Large Data Bases, pages 487-99, 1994.
5. G. Dong and J. Li. Efficient mining of emerging patterns: discovering trends and differences. In Proc. of the 5th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 43-52, 1999.
6. S. D. Bay and M. J. Pazzani. Detecting group differences: mining contrast sets. Data Mining and Knowledge Discovery, v 5, n 3, pages 213-46, 2001.
7. G. I. Webb, S. Butler and D. Newlands. On detecting differences between groups. In Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, pages 256-65, 2003.
8. S. Brin, R. Motwani and C. Silverstein. Beyond market baskets: generalizing association rules to correlations. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, v 26, n 2, pages 265-76, 1997.
9. S. Brin, R. Motwani, J. D. Ullman and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, v 26, n 2, pages 255-64, 1997.
10. C. C. Aggarwal, P. S. Yu. A new framework for itemset generation. In Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1998), pages 18-24, 1998.
11. S. Morishita and J. Sese. Traversing itemset lattices with statistical metric pruning. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Database Systems (PODS), pages 226-36, 2000.
12. Y. Ohsawa and Y. Nara. Understanding internet users on double helical model of chance-discovery process. In Proc. of the IEEE Int'l Symposium on Intelligent Control, pages 844-9, 2002.
13. S. Hettich, and S. D. Bay, The UCI KDD Archive, Department of Information and Computer Science, University of California, Irvine, CA, http://kdd.ics.uci.edu, 1999.