An applicable hierarchical clustering algorithm for content-based image retrieval

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

Volumn 4418 LNCS, Issue , 2007, Pages 82-92

  Xu, Hongli ^a   Xu, De ^a   Lin, Enai ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; IMAGE RETRIEVAL; PARAMETER ESTIMATION; TREES (MATHEMATICS); WAVELET TRANSFORMS;

HIERARCHICAL CLUSTERING; HIERARCHICAL INDEX;

CLUSTERING ALGORITHMS;

EID: 37149004719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71457-6_8     Document Type: Conference Paper

References (12)

1. Tian Zhang, Raghu Ramakrishnan, and Miron Livny. BIRCH: An Efficient 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.
2. Guha S, Rastogi R, Shim K. CURE: an efficient clustering algorithm for large databases. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data. Seattle: ACM Press, 1998. 73-84.
3. Ester M, Kriegel H, Sander J, Xu XW. A density-based algorithm for discovering clusters in large spatial databases with noise. Proc. of the 2nd Int'l Conf. on Knowledge Discovery and Data Mining (KDD'96). Portland: AAAI Press, 1996. 226-231.
4. Hinneburg A, Keim D. An efficient approach to clustering in large multimedia databases with noise. Proc. of the 4th Int'l Conf. on Knowledge Discovery and Data Mining (KDD'98). New York: AAAI Press, 1998. 58-65.
5. Ma S, Wang TJ, Tang SW, Yang DQ, Gao J. A fast clustering algorithm based on reference and density. Journal of Software, 2003,14(6):1089-1095. in china.
6. Liu Kan, Zhou Xiao Zheng , and Zhou DongRu. Clustering by Ordering Density-Based Subspaces and Visualization Journal of Computer Research and Development, Oct1 2003 Vol. 40, No. 10, 1509-1513,in china.
7. Wang W, Yang J, Muntz RR. STING: A statistical information grid approach to spatial data mining. Proc. of the 23rd Int'l Conf. on Very Large Data Bases. Athens: Morgan Kaufmann, 1997. 186-195.
8. Sheikholeslami G, Chatterjee S, Zhang AD. WaveCluster: A multi-resolution clustering approach for very large spatial databases. Proc. of the 24th Int'l Conf. on Very Large Data Bases. New York: Morgan Kaufmann, 1998. 428-439.
9. Rakesh A, Johanners G, Dimitrios G, Prabhakar R. Automatic subspace clustering of high dimensional data for data mining applications. Proc. of the 1998 ACM SIGMOD Int'l Conf. on Management of Data. Minneapolis: ACM Press, 1998. 94-105.
10. Karin Kailing, Hans-Peter Kriegel, Peer Kroger. Density-Connected Subspace Clustering for High-Dimensional Data. In Proc. 4th SIAM Int. Conf. on Data Mining, pp.246-257, Lake Buena Vista,FL,2004
11. Carlotta Domeniconi, D. Papadopoulos, D. Gunopulos, Sheng Ma. Subspace Clustering of High Dimensional Data, SIAM International Conference on Data Mining (SDM), Apr. 2004, http://www.cs.ucr.edu/~dimitris/publications.html
12. Sanjay Goil, H. Nagesh, A. Choudhary. MAFIA: Efficient and Scalable Subspace Clustering Clustering for Very Large Data Sets. Technical Report CPDC-TR-9906-010, Northwestern University, 2145 Sheridan Road, Evanston IL 60208, June 1999.