Interactive clustering for transaction data

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

Volumn 2114, Issue , 2001, Pages 121-130

  Xiao, Yongqiao ^a   Dunham, Margaret H ^a  

^a Southern Methodist University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA WAREHOUSES; WAREHOUSES;

CATEGORICAL DATA; CONDENSATION TECHNIQUES; DYNAMIC MODIFICATIONS; MEMORY-RESIDENT; NUMBER OF CLUSTERS; PERFORMANCE STUDY; REDUCED COMPLEXITY; TRANSACTION DATA;

CLUSTERING ALGORITHMS;

EID: 84958744091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44801-2_13     Document Type: Conference Paper

References (17)

1. Rakesh Agrawal, Johannes Gehrke, Dimitrios Gunopulos, and Prabhakar Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 94-105, 1998.
2. Rakesh Agrawal and Ramakrishnan Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 487-499, Santiago, Chile, 1994.
3. Paul Bradlay, Usama Fayyad, and Cory Reina. Scaling clustering algortihms to large databases. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98), pages 9-15, 1998.
4. Thomas H. Cormen, Charles E. Lerserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
5. D. Defays. An efficient algorithm for a complete link method. The Computer Journal, 20(4):364-366, 1977.
6. Venkatesh Ganti, Johannes Gehrke, and Raghu Ramakrishnan. CACTUS - clustering categorical data using summaries. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD-99), pages 73-83, 1999.
7. Sudipto Guha, Rajeev Rastogi, and Kyuseok Shim. ROCK: A robust clustering algorithm for categorical attributes. In Proceedings of the 1999 IEEE International Conference on Data Engineering, pages 512-521, 1999.
8. Eui-Hong Han, George Karypis, Vipin Kumar, and Bamshad Mobasher. Clustering based on association rule hypergraphs. In 1997 SIGMOD Workshop on Researhc Issues on Data Mining and Knowledge Discovery, 1997.
9. Marti A. Hearst and Jan O. Pedersen.: Reexamining the cluster hypothesis: Scatterlgather on retrieval results. In Proceedings of the 19th International ACM SIGIR Conference on Research and Development i n Information Retrieval, pages 76-84, 1996.
10. Christian Hidber. Online association rule mining. In Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data, pages 145-156, 1999.
11. Anil K. Jain and Richard C. Dubes.: Algorithms for Clustering Data. Prentice Hall, Englewood Cliffs, New Jersey, 1988.
12. F. Murtagh. A survey of recent advances in hierarchical clustering algorithms. The Computer Journal, 26(4):354-359, 1983.
13. G. Salton and M. J. McGill.: Introduction to Modern Information Retrieval. McGraw-Hill Book Co., McGraw-Hill, New York, 1983.
14. R. Sibson. Slink: An optimally efficient algorithm for the single link cluster method. The Computer Journal, l6(l):30-34, 1973.
15. Yongqiao Xiao and Margaret H Dunham. Interactive clustering for large databases, July 2000. Available from http://www.seas.smu.edu/-xiao/publication/oak-tr.ps.
16. Oren Zamir and Oren Etxioni.: Web document clustering: A feasibility demonstration. I n Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 46-54, 1998.
17. Tian Zhang, Raghu Ramakrishnan, and Miron Livny. Birch: An eficient data clustering method for very large databases. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pages 103-114, Montreal, Canada, 1996.