A k-populations algorithm for clustering categorical data

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 438
  • Download : 0
In this paper, the conventional k-modes-type algorithms for clustering categorical data are extended by representing the clusters of categorical data with k-populations instead of the hard-type centroids used in the conventional algorithms. Use of a population-based centroid representation makes it possible to preserve the uncertainty inherent in data sets as long as possible before actual decisions are made. The k-populations algorithm was found to give markedly better clustering results through various experiments. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2005-07
Language
English
Article Type
Article
Citation

PATTERN RECOGNITION, v.38, pp.1131 - 1134

ISSN
0031-3203
DOI
10.1016/j.patcog.2004.11.017
URI
http://hdl.handle.net/10203/91797
Appears in Collection
BiS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0