Fast and flexible unsupervised clustering algorithm based on ultrametric properties

Q2SWinet'11 - Proceedings of the 7th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Co-located with MSWiM'11

Volumn , Issue , 2011, Pages 35-42

  Fouchal, Said ^a   Lavallée, Ivan ^a  

^a UNIVERSITÉ PARIS 8   (France)

Author keywords

Amortized analysis; Average analysis; Clustering; Complexity; Ordered space; Ultrametric

Indexed keywords

AMORTIZED ANALYSIS; AVERAGE ANALYSIS; CLUSTERING; COMPLEXITY; ORDERED SPACE; ULTRAMETRIC;

CLUSTER ANALYSIS; COBALT COMPOUNDS;

CLUSTERING ALGORITHMS;

EID: 83055177189     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2069105.2069112     Document Type: Conference Paper

References (30)

1. M. Ankerst, M. M. Breunig, H. P. Kreigel and J. Sander, OPTICS: Oredering Points To Identify the Clustering Structure, ACM SIGMOD International Conference on Management of Data, Philadelphia PA, 1999.
2. J. P. Bartheĺemy and F. Brucker, Binary Clustering, Journal of Discrete Applied Mathematics, 156, 1237-1250, 2008.
3. th International Conference on Database Theory (ICDT) LNCS, 1540: 217-235, Springer-Verlag London, UK, 1999.
4. th IEEE Conference on Local Computer Networks (LCN), 785-790, Denver, Colorado, U.S.A., 2010.
5. J. Ben-Othman, F. Valois, Multiservice Allocation in Hierarchical Cellular Networks (MAHCN), Proceedings of the Fourth IEEE Symposium on Computers and Communications (ISCC), 80-86, Sharm El Sheikh, Red Sea, Egypt. 1999.
6. F. Brucker, Modèles de classification en classes empiétantes, Phd Thesis, Equipe d'accueil : Dep. IASC de l'École Supérieure des Télécommunications de Bretagne, France, 2001.
7. th International Conference on Pattern Recognition, 2008.
8. G. Cleuziou, Une metéhode de classification non-superviseé pour l'apprentissage de reg̀les et la recherche d'information, Phd Thesis, Université d'Orleans, France, 2006.
9. rd IEEE International Workshop Performance Evaluation of Communications in Distributed Systems and Web-based Service Architectures (PEDISWESA), 123-128, Greece, 2011.
10. th International conference Knowledge-based and intelligent information and Engineering Systems (KES), Part I: 452-460, Cardiff, UK, 2010.
11. L. Gají, Metric locally constant function on some subset of ultrametric space, Novi Sad Journal of Mathematics (NSJOM), Vol. 35, n-. 1, 123-125, 2005.
12. L. Gají, On ultrametric space, Novi Sad Journal of Mathematics (NSJOM), Vol. 31, n-. 2, 69-71, 2001.
13. I. Gronau and S. Moran, Optimal implentations of UPGMA and other common clustering algorithms, Information Processing Letters, Vol 104, Issue 6, 205-210, 2007. (Pubitemid 47368277)
14. rd IEEE Coference on Data Mining and Optimization (DMO), 190-193, Malaysia, 2011.
15. A. Hinneburg and D. A. Keim, An Efficient Approach to Clustering in Large Multimedia Databases with Noise, In Proceedings of the fourth international conference on Knowledge Discovery and Datamining (KDD), 58-65, New York, USA, 1998.
16. L. Hubert and P. Arabie, Iterative projection strategies for the least squares fitting of tree structures to proximity data, British Journal of Mathematical and Statistical Psychology, Vol. 48, 281-317, 1995.
17. L. Hubert, Spanning Trees and Aspects of Clustering, British Journal of Mathematical and Statistical Psychology, Vol. 27, 14-28, 1974.
18. A. K. Jain, M. N. Murty and P. J. Flynn, Data Clustering: A Review, ACM Computing Surveys, Vol. 31, n-. 3, 264-323, 1999.
19. M. Krasner, Espace ultramétrique et valuation, Séminaire Dubreil Algèbre et théorie des nombres, Tome 1, exp. n-1, 1-17, 1947-1948.
20. H. P. Kriegel, P. Kroger and A. Zymek, Clustering High-Dimensional Data: A Survey on Subspace Clustering, Pattern-Based Clustering, and Correlation Clustering, ACM Transactions on Knowledge Discovery from Data, Vol. 3, no. 1, Article 1, 2009.
21. I. Lavallée, Complexité et algorithmique avancée "une introduction", 2ème édition, Hermann éditeurs, 2008.
22. B. Leclerc, Description combinatoire des ultrametériques, Mathemátiques et Sciences Humaines, Vol. 73, 5-37, 1981.
23. F. Murtagh, Complexities of Hierarchic Clustering Algorithms: State of the Art, Computational Statistics Quartely, Vol. 1, Issue 2, 101-113, 1984.
24. F. Murtagh, A Survey of Recent Advances in Hierarchical Clustering Algorithms, The Computer Journal, Vol. 26, n-. 4, 354-359, 1983. (Pubitemid 14590891)
25. K. P. R. Rao, G. N. V. Kishore and T.R. Rao, Some Coincidence Point Theorems in Ultra Metric Spaces, Int. Journal of Math. Analysis, Vol. 1, n-. 18, 897-902, 2007.
26. D.D. Sleator and R.E. Tarjans, Amortized Efficiency Of List Update and Paging Rules, In Proceedings of Commun. ACM, Vol. 28, 202-208, 1985.
27. M. Sun, L. Xiong, H. Sun and D. Jiang, A GA-Based Feature Selection for High-Dimensional Data Clustering, In Proceedings of the 3rd International Conference on Genetic and Evolutionary Computing (WGEC), 769 - 772, 2009.
28. R. E. Tarjans, Data structures and network algorithms, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 1983.
29. M. Terrenoire and D. Tounissoux, Classification hieréarchique, Université de Lyon, 2003.
30. A. C-C. Yao, Probabilistic computations: Toward a unified measure of complexity, In Proceedings of the 18th IEEE Conference on Foundations of Computer Science, 222-227, 1977.