The parallel complexities of the K-medians related problems
K -medians is a well-known clustering algorithm in data mining literature. This paper describes three decision problems related to k-medians. These problems are called MEDIANS REPLACEMENT IN k-MEDIANS, MEDIAN DETERMINATION, and TITERATIONS k-MEDIANS problems. We show that these problems are in NC, e...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2014
|
| 在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-52949140540&partnerID=40&md5=e48a4a7100d37eecb0f0adcdf5a472c3 http://cmuir.cmu.ac.th/handle/6653943832/5467 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |
| 語言: | English |
| 總結: | K -medians is a well-known clustering algorithm in data mining literature. This paper describes three decision problems related to k-medians. These problems are called MEDIANS REPLACEMENT IN k-MEDIANS, MEDIAN DETERMINATION, and TITERATIONS k-MEDIANS problems. We show that these problems are in NC, each has a (logn)O(1) parallel time algorithm on an EREW PRAM model using nO(1) processors, and the result in each case is the strongest possible.1 ©2008 IEEE. |
|---|