Data Clustering: A Review

Data Clustering: A Review (1999)

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by A K Jain , M N Murty , P. J. Flynn

Venue:	ACM COMPUTING SURVEYS
Citations:	912 - 9 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	AND	SVM HeaderParse 0.1
AUTHOR NAME	P. J. Flynn	SVM HeaderParse 0.1
AUTHOR AFFIL	; The Ohio State University; Authors ’ addresses: A. Jain, Department of Computer Science, Michigan State University, A714 Wells; Hall, East Lansing, MI 48824; M. Murty; Institute of Science; Ohio State University, Columbus	SVM HeaderParse 0.2
AUTHOR ADDR	; Department of Computer Science and Automation, Indian; Bangalore, 560 012, India; P. Flynn, Department of Electrical Engineering, The; OH 43210.	SVM HeaderParse 0.1
ABSTRACT	Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval.	SVM HeaderParse 0.1
CITATIONS	223 found	ParsCit 1.0