Locality Sensitive K-means Clustering
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
305 | en_US |
dc.citation.spage |
289 | en_US |
dc.citation.volume |
34 | en_US |
dc.contributor.author |
Liu, Chlen-Liang | en_US |
dc.contributor.author |
Hsai, Wen-Hoar | en_US |
dc.contributor.author |
Chang, Tao-Hsing | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
工業工程與管理學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.contributor.department |
Department of Industrial Engineering and Management | en_US |
dc.date.accessioned |
2018-08-21T05:53:14Z | |
dc.date.available |
2018-08-21T05:53:14Z | |
dc.date.issued |
2018-01-01 | en_US |
dc.description.abstract |
This study considers clustering and dimensionality reduction simultaneously to devise an unsupervised clustering algorithm called locality sensitive K-means (LS-K means). The goal is to find a linear transformation to project data points into a lower dimensional space, so that clustering can perform well in the new space. We design a novel objective function for LS-Kmeans to achieve the goal, and further show that the proposed method can be reformulated as a matrix trace minimization with constraints problem. The original optimization problem becomes a generalized eigenvalue problem when relaxing the optimization problem of LS-Kmeans by allowing the indicator entries to take arbitrary values in R. This paper also shows that the continuous solutions for the transformed cluster membership indicator vectors of LS-Kmeans are located in the subspace spanned by the first K-1 eigenvectors. In the experiments, we use two synthetic datasets to show that the proposed method can cluster non-linearly separable data points. Besides, the experimental results of eight real datasets indicate that the proposed algorithm can generally outperform other alternatives. | en_US |
dc.identifier.doi |
10.6688/JISE.2018.34.1.17 | en_US |
dc.identifier.issn |
1016-2364 | en_US |
dc.identifier.journal |
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | en_US |
dc.identifier.uri |
http://dx.doi.org/10.6688/JISE.2018.34.1.17 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/144422 | |
dc.identifier.wosnumber |
WOS:000423254700017 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
unsupervised learning | en_US |
dc.subject |
clustering | en_US |
dc.subject |
locality sensitive clustering | en_US |
dc.subject |
dimensionality reduction | en_US |
dc.subject |
linear transformation | en_US |
dc.title |
Locality Sensitive K-means Clustering | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文