Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm

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

Volumn 3861 LNCS, Issue , 2006, Pages 313-330

  Vathy Fogarassy, Agnes ^a   Kiss, Attila ^b   Abonyi, Janos ^a  

^a UNIVERSITY OF PANNONIA   (Hungary)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DATABASE SYSTEMS; HIERARCHICAL SYSTEMS; NUMERICAL ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

CLUSTERING ALGORITHM; HYBRID MINIMAL SPANNING TREE; HYBRIDIZATION; NUMERICAL PROBLEMS;

TREES (MATHEMATICS);

EID: 33745654747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11663881_18     Document Type: Conference Paper

References (25)

1. J.G. Augustson, J. Minker, An analysis of some graph theoretical clustering techniques. J. ACM, Vol.17, 4, 571-588, 1970.
2. F.B. Backer, L.J. Hubert, A graph-theoretic approach to goodness-of-fit in complete-link hierarchical clustering. J. Am. Stat. Assoc., Vol. 71, 870-878, 1976.
3. J.D. Barrow, S.P. Bhavsar, D.H. Sonoda, Minimal spanning trees, filaments and galaxy clustering. In Monthly Notices of the Royal Astronomical Society, 216:17-35, 1985.
4. rd Annual International Conference on Computational Molecular Biology (RECOMB99), 11-14, 1999.
5. J.C. Bezdek, L.P. Clarke, M.L. Silbiger, J.A. Arrington, A.M. Bensaid, L.O. Hall, R.F. Murtagh, Validity-guided (re)clustering with applications to image segmentation. IEEE Transactions on Fuzzy Systems, 4:112-123, 1996.
6. G. Castellano, A.M. Fanelli, C. Mencar, A fuzzy clustering approach for mining diagnostic rules. In Proceedings of 2003 IEEE International Conference on Systems, Man & Cybernetics (IEEE SMC'03), Vol. 1, 2007-2012, 2003.
7. R. Cooley, B. Mobasher, J. Srivastava, Data preparation for mining world wide web browsing. In Journal of Knowledge Information Systems, 1, 1, 5-32, 1999.
8. A.P. Dempster, N.M. Laird, D.B. Rubin, Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B (Methodological), 39(1):1-38, 1977.
9. R.C. Dubes, How many clusters are best? - an experiment. Pattern Recogn., 20(6):645-663, 1987.
10. J.C. Dunn, Well separated clusters and optimal fuzzy partitions. Journal Cybernetics, 4:95-104, 1974.
11. M. Forina, C. Oliveros, M. Concepcion, C. Casolino, M. Casale, Minimum spanning tree: ordering edges to identify clustering structure. In Analytica Chimica Acta 515: 43-53, 2004.
12. I. Gath, A.B. Geva, Unsupervised Optimal Fuzzy Clustering. IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. 11, pp. 773-781, 1989.
13. J.M. Gonzáles-Barrios and A.J. Quiroz, A clustering procedure based on the comparsion between the k nearest neighbors graph and the minimal spanning tree. In Statistics & Probability Letter, 62:23-34, 2003.
14. C.C. Gotlieb, S. Kumar, Semantic Clustering of Index Terms. J. ACM, 15(4):493-513, 1968.
15. J.C. Gower, G. J.S. Ross, Minimal Spanning Trees and Single Linkage Cluster Analysis. Applied Statistics, Vol. 18, 54-64, 1969.
16. J. Heer and E. Chi, Identification of Web user traffic composition using multimodal clustering and information scent. 1st SIAM ICDM, Workshop on Web Mining, Chicago, IL., 51-58, 2001.
17. A.K. Jain and R.C. Dubes, Algorithms for Clustering Data. Prentice-Hall advanced reference series, Prentice-Hall, Inc., 1988.
18. J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem. In American Mathematical Society, 7:48-50, 1956.
19. T. Mitchell, Machine Learning. McGraw-Hill, Inc., New York, NY, 1997.
20. N. Päivinen, Clustering with a minimum spanning tree of scale-free-like structure. In Pattern Recognition Letters, 26(7):921-930, 2005.
21. R. Prim, Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
22. V.V. Raghavan, C.T. Yu, A comparison of the stability characteristics of some graph theoretic clustering methods. IEEE Trans. Pattern Anal. Mach. Intell., 3, 3-402, 1981.
23. J. Sander, M. Ester, H.-P. Kriegel, X. Xu, Density-based clustering in spatial databases: the algorithm GDBSCAN and its applications. In Data Mining and Knowledge Discovery, 2, 2, 169-194, 1998.
24. S. Varma, R. Simon, Iterative class discovery and feature selection using Minimal Spanning Trees. BMC Bioinformatics, 5:126-134, 2004.
25. C.T. Zahn, Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transaction on Computers C20:68-86, 1971.