CloseMiner: Discovering frequent closed itemsets using frequent closed tidsets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2005, Pages 4-7

  Singh, N Gourakishwar ^a   Singh, S Ranbir ^a   Mahanta, Anjana K ^b  

^a MANIPUR UNIVERSITY   (India)

^b GAUHATI UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATABASE SYSTEMS; PROBLEM SOLVING;

CLOSED TIDSETS; OVERLAPPING CLUSTERS;

DATA MINING;

EID: 34548566223     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2005.41     Document Type: Conference Paper

References (11)

1. J.-M. Adamo. Data mining for association rules and sequential patterns. Springer-Verlag, Berlin Heidalberg New York, 2001.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proceeding of the ACM SIGMOD International Conference on Management of Data, pages 207-216, May 1993.
3. B. A. Davey and Priestley. Introduction to lattices and order. Cambridge University Press, 1990.
4. J. Han, J. Pei, and Y. Yin. Mining frequent pattern without candidate generation. Proceeding of the ACM SIGMOD International Conference on Management of Data, May 2000.
5. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets. Proceeding of the 7th International Conference on Database Theory(ICDT'99), January 1999.
6. J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. Proceeding of the ACM SIGMOD Workshop on Research Issues inData Mining and Knowledge Discovery, 2000:21-30, May 1993.
7. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. Proceedings of the 21th International Conference on Very Large Data Bases, pages 432-444, 1995.
8. M. Zaki. Generating non redundant association rules. Proceeding of the ACM SIGKDD International Conference of Knowledge Discovery and Data Mining, August 2000.
9. M. Zaki. Scalable algorithm for association mining. IEEE Transaction on Knowledge and Data Engineering, 12(3):372-390, May-June 2000.
10. M. Zaki and K. Gauda. Fast vertical mining using diffsets. Technical Report 01-1, Computer Science Department, Rensselaer Polytechnic. Institute, March 2001.
11. M. Zaki and C.-J. Hsiao. Charm: An efficient algorithm for closed association rule mining. Technical Report 99-10, Computer Science Department, Rensselaer Polytechnic Institute, October 1999.