Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering
Hämäläinen, J., Jauhiainen, S., & Kärkkäinen, T. (2017). Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering. Algorithms, 10(3), Article 105. https://doi.org/10.3390/a10030105
Julkaistu sarjassa
AlgorithmsPäivämäärä
2017Tekijänoikeudet
© 2017 by the Authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license.
Clustering is an unsupervised machine learning and pattern recognition method. In general,
in addition to revealing hidden groups of similar observations and clusters, their number needs to
be determined. Internal clustering validation indices estimate this number without any external
information. The purpose of this article is to evaluate, empirically, characteristics of a representative
set of internal clustering validation indices with many datasets. The prototype-based clustering
framework includes multiple, classical and robust, statistical estimates of cluster location so that the
overall setting of the paper is novel. General observations on the quality of validation indices and on
the behavior of different variants of clustering algorithms will be given.
Julkaisija
MDPIISSN Hae Julkaisufoorumista
1999-4893Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/27369288
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Lisenssi
Ellei muuten mainita, aineiston lisenssi on © 2017 by the Authors. Licensee MDPI, Basel, Switzerland. This article is an open access
article distributed under the terms and conditions of the Creative Commons Attribution
(CC BY) license.
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Improvements and applications of the elements of prototype-based clustering
Hämäläinen, Joonas (Jyväskylän yliopisto, 2018) -
Application of a Knowledge Discovery Process to Study Instances of Capacitated Vehicle Routing Problems
Kärkkäinen, Tommi; Rasku, Jussi (Springer, 2020)Vehicle Routing Problems (VRP) are computationally challenging, constrained optimization problems, which have central role in logistics management. Usually different solvers are being developed and applied for different ... -
Clustering Incomplete Spectral Data with Robust Methods
Äyrämö, Sami; Pölönen, Ilkka; Eskelinen, Matti (International Society for Photogrammetry and Remote Sensing, 2017)Missing value imputation is a common approach for preprocessing incomplete data sets. In case of data clustering, imputation methods may cause unexpected bias because they may change the underlying structure of the data. ... -
Scalable implementation of dependence clustering in Apache Spark
Ivannikova, Elena (IEEE, 2017)This article proposes a scalable version of the Dependence Clustering algorithm which belongs to the class of spectral clustering methods. The method is implemented in Apache Spark using GraphX API primitives. Moreover, ... -
LR-NIMBUS : an interactive algorithm for uncertain multiobjective optimization with lightly robust efficient solutions
Koushki, Javad; Miettinen, Kaisa; Soleimani-damaneh, Majid (Springer Science and Business Media LLC, 2022)In this paper, we develop an interactive algorithm to support a decision maker to find a most preferred lightly robust efficient solution when solving uncertain multiobjective optimization problems. It extends the interactive ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.