|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM226801802 |
| 003 |
DE-627 |
| 005 |
20231224072235.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2013 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2012.228
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0756.xml
|
| 035 |
|
|
|a (DE-627)NLM226801802
|
| 035 |
|
|
|a (NLM)23599062
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Bai, Liang
|e verfasserin
|4 aut
|
| 245 |
1 |
4 |
|a The impact of cluster representatives on the convergence of the k-modes type clustering
|
| 264 |
|
1 |
|c 2013
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 15.11.2013
|
| 500 |
|
|
|a Date Revised 19.04.2013
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a As a leading partitional clustering technique, k-modes is one of the most computationally efficient clustering methods for categorical data. In the k-modes, a cluster is represented by a "mode," which is composed of the attribute value that occurs most frequently in each attribute domain of the cluster, whereas, in real applications, using only one attribute value in each attribute to represent a cluster may not be adequate as it could in turn affect the accuracy of data analysis. To get rid of this deficiency, several modified clustering algorithms were developed by assigning appropriate weights to several attribute values in each attribute. Although these modified algorithms are quite effective, their convergence proofs are lacking. In this paper, we analyze their convergence property and prove that they cannot guarantee to converge under their optimization frameworks unless they degrade to the original k-modes type algorithms. Furthermore, we propose two different modified algorithms with weighted cluster prototypes to overcome the shortcomings of these existing algorithms. We rigorously derive updating formulas for the proposed algorithms and prove the convergence of the proposed algorithms. The experimental studies show that the proposed algorithms are effective and efficient for large categorical datasets
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 700 |
1 |
|
|a Liang, Jiye
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Dang, Chuangyin
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Cao, Fuyuan
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 35(2013), 6 vom: 15. Juni, Seite 1509-22
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnns
|
| 773 |
1 |
8 |
|g volume:35
|g year:2013
|g number:6
|g day:15
|g month:06
|g pages:1509-22
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2012.228
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 35
|j 2013
|e 6
|b 15
|c 06
|h 1509-22
|