Clustering by random projections

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

Volumn 4597 LNCS, Issue , 2007, Pages 107-119

  Urruty, Thierry ^a   Djeraba, Chabane ^a   Simovici, Dan A ^b  

^a UNIV LILLE   (France)

^b UNIVERSITY OF MASSACHUSETTS BOSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA STRUCTURES; IMAGE SEGMENTATION; RANDOM PROCESSES;

CLUSTER DETECTION; REAL IMAGES;

CLUSTERING ALGORITHMS;

EID: 37249018161     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73435-2_9     Document Type: Conference Paper

References (19)

1. Agrawal, R., Gehrke, J., Gunopulos, D., Raghavan, P.: Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the ACM-SIGMOD Int. Conf. Management of Data, pp. 94-105. ACM Press, New York (1998)
2. Agarwal, P., Mustafa, N.H.: k-means projective clustering. In: Proceedings of PODS, pp. 155-165 (2004)
3. Aggarwal, CC, Procopiuc, C., Wolf, J.L., Yu, P.S., Park, J.S.: Fast algorithms for projected clustering. In: Proceedings of ACM-SIGMOD Conference on Management of Data, pp. 61-72. ACM Press, New York (1999)
4. Barthélemy, J.P., Leclerc, B.: The median procedure for partitions. In: Partitioning Data Sets. American Mathematical Society, pp. 3-14. Providence, RI (1995)
5. Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.): EDBT 2002. LNCS, vol. 2490. Springer, Heidelberg (2002)
6. Dasgupta, S., Gupta, A.: An elementary proof of the johnson-lindenstrauss lemma. Technical Report TR-99-006, International Computer Science Institute (1999)
7. Djeraba, C. (ed.): Multimedia Mining - A Highway to Intelligent Multimedia Documents. Kluwer, Dordrecht (2003)
8. Frankl, P., Maehara, H.: The johnson-lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory B 44, 355-362 (1988)
9. Jain, A.K., Dubes, R.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)
10. Jain, A.K., Flynn, P.J.: Image segmentation using clustering. In: Advances in Image Understanding: A Festschrift for Azriel Rosenfeld, Piscataway, NJ, pp. 65-83. IEEE Press, Los Alamitos (1996)
11. Johnson, W.B., Lindenstrauss, J.: Extensions of lipshitz mappings into hilbert spaces. Contemporary Mathematics 26,189-206 (1984)
12. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: A review. ACM Computing Surveys 31, 264-323 (1999)
13. MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, pp. 281-297. University of California Press, California (1967)
14. Mondrian, P.: http: //artchive.com/artchive/M/mondrian.html
15. Sander, J., Ester, M., Kriegel, H.P., Xu, X.: Density-based clustering in spatial databases: The algorithm gdbscan and its applications. Data Mining and Knowledge Discovery, an International Journal 2, 169-194 (1998)
16. Tan, P.N, Steinbach, M., Kumar, V.: Introduction to Data Mining. Pearson/Addison-Wesley, Boston (2006)
17. Vempala, S.S.: The Random Projection Method. American Mathematical Society. Providence, Rhode Island (2004)
18. Witten, I.H., Frank, E.: Data Mining - Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
19. Zaïane, O.R., Simoff, S.J., Djeraba, C (eds.): MDM/KDD 2002 and KDMCD 2002. LNCS (LNAI), vol. 2797. Springer, Heidelberg (2002)