2011 | OriginalPaper | Buchkapitel
On Hard c-Means Using Quadratic Penalty-Vector Regularization for Uncertain Data
verfasst von : Yasunori Endo, Arisa Taniguchi, Aoi Takahashi, Yukihiro Hamasuna
Erschienen in: Modeling Decision for Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Clustering is one of the unsupervised classification techniques of the data analysis. Data are transformed from a real space into a pattern space to apply clustering methods. However, the data cannot be often represented by a point because of uncertainty of the data, e.g., measurement error margin and missing values in data. In this paper, we introduce quadratic penalty-vector regularization to handle such uncertain data into hard
c
-means (HCM) which is one of the most typical clustering algorithms. First, we propose a new clustering algorithm called hard
c
-means using quadratic penalty-vector regularization for uncertain data (HCMP). Second, we propose sequential extraction hard
c
-means using quadratic penalty-vector regularization (SHCMP) to handle datasets whose cluster number is unknown. Moreover, we verify the effectiveness of our propose algorithms through some numerical examples.