CoFD: An algorithm for non-distance based clustering in high dimensional spaces

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

Volumn 2454 LNCS, Issue , 2002, Pages 52-62

  Zhu, Shenghuo ^a   Li, Tao ^a   Ogihara, Mitsuonri ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA WAREHOUSES; MAXIMUM LIKELIHOOD; WAREHOUSES; ALGORITHMS; DATA HANDLING;

CLUSTERING PROBLEMS; DISTANCE FUNCTIONS; DISTANCE-BASED CLUSTERING ALGORITHM; HIGH DIMENSIONAL SPACES; LARGE DATASETS; MAXIMUM LIKELIHOOD PRINCIPLE; SYNTHETIC DATASETS; TRADITIONAL CLUSTERING;

CLUSTERING ALGORITHMS;

EID: 84864857888     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46145-0_6     Document Type: Conference Paper

References (22)

1. C. Aggarwal and P. S. Yu. Finiding generalized projected clusters in high dimensional spaces. In SIGMOOD-00, 2000.
2. C. C. Aggarwal, J. L.Wolf, P. S. Yu, C. Procopiuc, and J. Soo Park. Fast algorithms for projected clustering. In ACM SIGMOD Conference, 1999.
3. R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan. Automatic subspace clustering for high dimensional data for data mining applications. In SIGMOD-98, 1998.
4. J. S. Albus. A new approach to manipulator control: The cerebellar model articlatioon controller (CMAC). Trans. of the ASME, J. Dynamic Systems, Meaasurement, and Control, 97(3):220-227, sep 1975.
5. M. Berger and I. Rigoutsos. An algorithm for point clustering and grid generation. IEEE Trans. on Systems, Man andCyb ernetics, 21(5):1278-1286, 1991.
6. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is nearest neighbor meaningful? In ICDT Conference, 1999.
7. M.R. Brito, E. Chavez, A. Quiroz, and J. Yukich. Connectivity of the mutual K-Nearest-Neighbor graph for clustering and outlier detection. Statistics and Probability Letters, 35:33-42, 1997.
8. P. Cheeseman, J. Kelly, and M. Self. AutoClass: A bayesian classification system. In ICML'88, 1988.
9. C-H Cheng, A. W-C Fu, and Y. Zhang. Entropy-based subspace clustering for mining numericaldata. In KDD-99, 1999.
10. P. A. Chou, T. Lookabaugh, and R. M. Gray. Entropy-constrained vector quantization. IEEE Trans., ASSP-37(1):31, 1989.
11. D. Fasulo. An analysis of recent work on clustering algorithms. Technical Report 01-03-02, U. of Washington, Dept. of Comp. Sci. & Eng., 1999.
12. Douglas H. Fisher. Iterative optimization and simplification of hierarchical clusterings. TechnicalRep ort CS-95-01, Vanderbilt U., Dept. of Comp. Sci., 1995.
13. S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large database. In Proceedings of the 1998 ACM SIGMOD Conference, 1998.
14. Jiawei Han and Micheline Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2000.
15. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining,Inference, and Prediction. Springer, 2001.
16. MichaelI. Jordan. Graphical Models: Foundations of Neural Computation. MIT Press, 2001.
17. R. Kohavi and D. Sommerfield. Feature subset selection using the wrapper method: overfitting and dynamic search space technology. In KDD-95, 1995.
18. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In SIGMOD-96, 1996.
19. A. Strehl and J. Ghosh. A scalable approach to balanced, high-dimensional clustering of market-baskets. In HiPC-2000, 2000.
20. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An efficient data clustering method for very large databases. In ACM SIGMOD Conference, 1996.
21. Shenghuo Zhu and Tao Li. An algorithm for non-distance based clustering in high dimensional spaces. TechnicalRep ort 763, University of Rochester, Computer Science Department, Rochester, NY, 2002.
22. Shenghuo Zhu and Tao Li. A non-distance based clustering algorithm. In Proc. of IJCNN 2002, 2002. To appear