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: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-52949140540&partnerID=40&md5=e48a4a7100d37eecb0f0adcdf5a472c3 http://cmuir.cmu.ac.th/handle/6653943832/5467 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| id |
th-cmuir.6653943832-5467 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-54672014-08-30T02:56:34Z The parallel complexities of the K-medians related problems Vittayakorn S. Kantabutra S. Tanprasert C. 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. 2014-08-30T02:56:34Z 2014-08-30T02:56:34Z 2008 Conference Paper 1424421012; 9781424421015 10.1109/ECTICON.2008.4600360 73753 http://www.scopus.com/inward/record.url?eid=2-s2.0-52949140540&partnerID=40&md5=e48a4a7100d37eecb0f0adcdf5a472c3 http://cmuir.cmu.ac.th/handle/6653943832/5467 English |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| language |
English |
| description |
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. |
| format |
Conference or Workshop Item |
| author |
Vittayakorn S. Kantabutra S. Tanprasert C. |
| spellingShingle |
Vittayakorn S. Kantabutra S. Tanprasert C. The parallel complexities of the K-medians related problems |
| author_facet |
Vittayakorn S. Kantabutra S. Tanprasert C. |
| author_sort |
Vittayakorn S. |
| title |
The parallel complexities of the K-medians related problems |
| title_short |
The parallel complexities of the K-medians related problems |
| title_full |
The parallel complexities of the K-medians related problems |
| title_fullStr |
The parallel complexities of the K-medians related problems |
| title_full_unstemmed |
The parallel complexities of the K-medians related problems |
| title_sort |
parallel complexities of the k-medians related problems |
| publishDate |
2014 |
| url |
http://www.scopus.com/inward/record.url?eid=2-s2.0-52949140540&partnerID=40&md5=e48a4a7100d37eecb0f0adcdf5a472c3 http://cmuir.cmu.ac.th/handle/6653943832/5467 |
| _version_ |
1681420431236530176 |