Data clustering: 50 years beyond K-means
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jain, Anil K. | - |
dc.date.accessioned | 2021-09-08T02:32:08Z | - |
dc.date.available | 2021-09-08T02:32:08Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-06-01 | - |
dc.identifier.issn | 0167-8655 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/116270 | - |
dc.description.abstract | Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organisms into a system of ranked taxa: domain, kingdom, phylum, class, etc. Cluster analysis is the formal study of methods and algorithms for grouping, or clustering, objects according to measured or perceived intrinsic characteristics or similarity. Cluster analysis does not use category labels that tag objects with prior identifiers, i.e., class labels. The absence of category information distinguishes data clustering (unsupervised learning) from classification or discriminant analysis (supervised learning). The aim of clustering is to find structure in data and is therefore exploratory in nature. Clustering has a long and rich history in a variety of scientific fields. One of the most popular and simple clustering algorithms, K-means, was first published in 1955. In spite of the fact that K-means was proposed over 50 years ago and thousands of clustering algorithms have been published since then, K-means is still widely used. This speaks to the difficulty in designing a general purpose clustering algorithm and the ill-posed problem of clustering. We provide a brief overview of clustering, summarize well known clustering methods, discuss the major challenges and key issues in designing clustering algorithms, and point out some of the emerging and useful research directions, including semi-supervised clustering, ensemble clustering, simultaneous feature selection during data clustering, and large scale data clustering. (C) 2009 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.subject | SCALABLE FRAMEWORK | - |
dc.subject | ALGORITHM | - |
dc.title | Data clustering: 50 years beyond K-means | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jain, Anil K. | - |
dc.identifier.doi | 10.1016/j.patrec.2009.09.011 | - |
dc.identifier.scopusid | 2-s2.0-77950369345 | - |
dc.identifier.wosid | 000277552600002 | - |
dc.identifier.bibliographicCitation | PATTERN RECOGNITION LETTERS, v.31, no.8, pp.651 - 666 | - |
dc.relation.isPartOf | PATTERN RECOGNITION LETTERS | - |
dc.citation.title | PATTERN RECOGNITION LETTERS | - |
dc.citation.volume | 31 | - |
dc.citation.number | 8 | - |
dc.citation.startPage | 651 | - |
dc.citation.endPage | 666 | - |
dc.type.rims | ART | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.subject.keywordPlus | SCALABLE FRAMEWORK | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Data clustering | - |
dc.subject.keywordAuthor | User&apos | - |
dc.subject.keywordAuthor | s dilemma | - |
dc.subject.keywordAuthor | Historical developments | - |
dc.subject.keywordAuthor | Perspectives on clustering | - |
dc.subject.keywordAuthor | King-Sun Fu prize | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.