Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm

Agnes Vathy-Fogarassy, Attila Kiss, J. Abonyi

Research output: Conference contribution

13 Citations (Scopus)

Abstract

Clustering is an important tool to explore the hidden structure of large databases. There are several algorithms based on different approaches (hierarchical, partitional, density-based, model-based, etc.). Most of these algorithms have some discrepancies, e.g. they are not able to detect clusters with convex shapes, the number of the clusters should be a priori known, they suffer from numerical problems, like sensitiveness to the initialization, etc. In this paper we introduce a new clustering algorithm based on the sinergistic combination of the hierarchial and graph theoretic minimal spanning tree based clustering and the partitional Gaussian mixture model-based clustering algorithms. The aim of this hybridization is to increase the robustness and consistency of the clustering results and to decrease the number of the heuristically defined parameters of these algorithms to decrease the influence of the user on the clustering results. As the examples used for the illustration of the operation of the new algorithm will show, the proposed algorithm can detect clusters from data with arbitrary shape and does not suffer from the numerical problems of the Gaussian mixture based clustering algorithms.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages313-330
Number of pages18
Volume3861 LNCS
DOIs
Publication statusPublished - 2006
Event4th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2006 - Budapest, Hungary
Duration: febr. 14 2006febr. 17 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3861 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2006
CountryHungary
CityBudapest
Period2/14/062/17/06

Fingerprint

Minimal Spanning Tree
Clustering algorithms
Clustering Algorithm
Cluster Analysis
Clustering
Model-based Clustering
Decrease
Gaussian Mixture
Gaussian Mixture Model
Initialization
Discrepancy
Model-based
Robustness
Arbitrary
Graph in graph theory
Databases

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Vathy-Fogarassy, A., Kiss, A., & Abonyi, J. (2006). Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3861 LNCS, pp. 313-330). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3861 LNCS). https://doi.org/10.1007/11663881_18

Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm. / Vathy-Fogarassy, Agnes; Kiss, Attila; Abonyi, J.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3861 LNCS 2006. p. 313-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3861 LNCS).

Research output: Conference contribution

Vathy-Fogarassy, A, Kiss, A & Abonyi, J 2006, Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3861 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3861 LNCS, pp. 313-330, 4th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2006, Budapest, Hungary, 2/14/06. https://doi.org/10.1007/11663881_18
Vathy-Fogarassy A, Kiss A, Abonyi J. Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3861 LNCS. 2006. p. 313-330. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11663881_18
Vathy-Fogarassy, Agnes ; Kiss, Attila ; Abonyi, J. / 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). Vol. 3861 LNCS 2006. pp. 313-330 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f726b6e553fd449986027918e4104208,
title = "Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm",
abstract = "Clustering is an important tool to explore the hidden structure of large databases. There are several algorithms based on different approaches (hierarchical, partitional, density-based, model-based, etc.). Most of these algorithms have some discrepancies, e.g. they are not able to detect clusters with convex shapes, the number of the clusters should be a priori known, they suffer from numerical problems, like sensitiveness to the initialization, etc. In this paper we introduce a new clustering algorithm based on the sinergistic combination of the hierarchial and graph theoretic minimal spanning tree based clustering and the partitional Gaussian mixture model-based clustering algorithms. The aim of this hybridization is to increase the robustness and consistency of the clustering results and to decrease the number of the heuristically defined parameters of these algorithms to decrease the influence of the user on the clustering results. As the examples used for the illustration of the operation of the new algorithm will show, the proposed algorithm can detect clusters from data with arbitrary shape and does not suffer from the numerical problems of the Gaussian mixture based clustering algorithms.",
author = "Agnes Vathy-Fogarassy and Attila Kiss and J. Abonyi",
year = "2006",
doi = "10.1007/11663881_18",
language = "English",
isbn = "3540317821",
volume = "3861 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "313--330",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Hybrid minimal spanning tree and mixture of Gaussians based clustering algorithm

AU - Vathy-Fogarassy, Agnes

AU - Kiss, Attila

AU - Abonyi, J.

PY - 2006

Y1 - 2006

N2 - Clustering is an important tool to explore the hidden structure of large databases. There are several algorithms based on different approaches (hierarchical, partitional, density-based, model-based, etc.). Most of these algorithms have some discrepancies, e.g. they are not able to detect clusters with convex shapes, the number of the clusters should be a priori known, they suffer from numerical problems, like sensitiveness to the initialization, etc. In this paper we introduce a new clustering algorithm based on the sinergistic combination of the hierarchial and graph theoretic minimal spanning tree based clustering and the partitional Gaussian mixture model-based clustering algorithms. The aim of this hybridization is to increase the robustness and consistency of the clustering results and to decrease the number of the heuristically defined parameters of these algorithms to decrease the influence of the user on the clustering results. As the examples used for the illustration of the operation of the new algorithm will show, the proposed algorithm can detect clusters from data with arbitrary shape and does not suffer from the numerical problems of the Gaussian mixture based clustering algorithms.

AB - Clustering is an important tool to explore the hidden structure of large databases. There are several algorithms based on different approaches (hierarchical, partitional, density-based, model-based, etc.). Most of these algorithms have some discrepancies, e.g. they are not able to detect clusters with convex shapes, the number of the clusters should be a priori known, they suffer from numerical problems, like sensitiveness to the initialization, etc. In this paper we introduce a new clustering algorithm based on the sinergistic combination of the hierarchial and graph theoretic minimal spanning tree based clustering and the partitional Gaussian mixture model-based clustering algorithms. The aim of this hybridization is to increase the robustness and consistency of the clustering results and to decrease the number of the heuristically defined parameters of these algorithms to decrease the influence of the user on the clustering results. As the examples used for the illustration of the operation of the new algorithm will show, the proposed algorithm can detect clusters from data with arbitrary shape and does not suffer from the numerical problems of the Gaussian mixture based clustering algorithms.

UR - http://www.scopus.com/inward/record.url?scp=33745654747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745654747&partnerID=8YFLogxK

U2 - 10.1007/11663881_18

DO - 10.1007/11663881_18

M3 - Conference contribution

AN - SCOPUS:33745654747

SN - 3540317821

SN - 9783540317821

VL - 3861 LNCS

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

SP - 313

EP - 330

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

ER -