Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. C. C. Aggarwal, C. Procopiuc, J. L. Wolf, P. S. Yu, and J. S. Park. Fast algorithms for projected clustering. In Proceedings of ACM SIGMOD Conference on Management of Data, pages 61–72, 1999.
2. R Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of ACM SIGMOD Conference on Management of Data, 1998.
3. R Agrawal and R. Srikant. Fast algorithm for mining association rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.
4. P. S. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Proceedings of the 4th International Conference on Knowledge Discovery & Data Mining (KDD’98), pages 9–15, 1998.
5. C. Cheng, A. W. Pu, and Y. Zhang. Entropy-based subspace clustering for mining numerical data. In Proceedings of Internationl Conference on Knowledge Discovery and Data Mining (KDD’99), 1999.
Cited by
76 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献