Divisive hierarchical K-means

CIMCA 2006: International Conference on Computational Intelligence for Modelling, Control and Automation, Jointly with IAWTIC 2006: International Conference on Intelligent Agents Web Technologies ...

Volumn , Issue , 2006, Pages 18-

  Lamrous, Sid ^a   Taïleb, Mounira ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Content based image retrieval; K means; Non binary hierarchical clustering

Indexed keywords

CLUSTERING ALGORITHMS; CONTENT BASED RETRIEVAL; TREES (MATHEMATICS);

CLUSTERS NODES; HIERARCHICAL CLUSTER TREES; NONBINARY HIERARCHICAL CLUSTERING;

HIERARCHICAL SYSTEMS;

EID: 38849207023     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIMCA.2006.89     Document Type: Conference Paper

References (18)

1. G.A.F. Seber, "Multivariate Observations", Wiley, New York, 1984.
2. Anderberg, M. R. Cluster Analysis for Applications. Academic Press, Inc., New York, NY, 1973.
3. C. Faloutsos, and al, "Efficient and Effective Querying by Image Content". Journal of Intelligent Information System (JIIS), 1994, pp.231-262.
4. J.R. Smith, S. Chang, "VisualSEEk: A Fully Automated Content-based Image Query System". ACM Multimedia, Boston, MA, 1996.
5. B.C. Ooi and al, "Fast Image Retrieval using Colorspatial Information". The VLDB Journal, 1998, 7(2): 115-128.
6. S.A. Berrani. "Recherche approximative de plus proche voisins avec contrôle probabiliste de la précision; application
7. à la recherche d'images par le contenu". PhD. Thesis at the University of Rennes, 2004.
8. C. Faloutsos. "Searching Multimedia Databases by Content". Kluwer Academic Publishers, 1996.
9. D.A. Keim, A. Hinneburg, "Clustering Methods for Large Databases: From the past to the Future". SIGMOD Conference, Philadelphia, 1999: 509.
10. T. Zhang, R. Ramakrishnan, M. Linvy, "Birch: An efficient data clustering method for very large databases". In Proceedings of the ACM SIGMOD International Conference on Management of Data, Montreal, Canada, 1996 pp. 103-114.
11. N. Beckman, H.P.Kriegel, R. Schneider, & B. Seeger, (1990). "The R*-tree: An efficient and robust access method for points and rectangles". In Proceeding of the ACM SIGMOD International Conference on Management of Data, Atlantic City, New Jersey, USA, 1990, pp. 322-331.
12. S. Bertchold, D.A. Keim, H.P. Kriegel, "The X-tree: An index structure for hight-dimentional data". In Proceeding of the 22nd Internatioanl Conference on Very Large Data Bases, Mumbai (Bombay), India, 1996, pp. 28-39
13. M.S. Sergio, D.L. Boley, "A comparative analysis on the bisecting K-means and the PDDP clustering algorithms". Intelligent Data, 2004, pp. 345-362.
14. J.E .Jackson, "A User's Guide to Principal Components", John Wiley and Sons, Inc., 1991, p. 592.
15. J.B. MacQueen. "Some Methods for classification and Analysis of Multivariate Observations", Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, University of California Press, 1967, pp. 281-297.
16. M. Oughdi, S. Lamrous, A. Caminada, B. Morin, "Time- Clustering of Load in Mobile Networks", to appear in proceding IEEE IC'SSSM 2006
17. L. Kaufman, P.J. Rousseeuw, "Finding groups in data: an introduction to cluster analysis", ed. Wiley, 1990
18. N. Roussopoulos, S. Kelly, F. Vincent, "Nearest Neighbor Queries". Proc. ACM SIGMOD, San Jose, CA, 1995.