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: | Vittayakorn S., Kantabutra S., Tanprasert C. |
---|---|
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 |
Similar Items
-
The parallel complexities of the K-medians related problems
by: Sirion Vittayakorn, et al.
Published: (2018) -
On the parallel complexity of hierarchical clustering and CC-complete problems
by: Greenlaw R., et al.
Published: (2014) -
On the parallel complexity of hierarchical clustering and CC-complete problems
by: Raymond Greenlaw, et al.
Published: (2018) -
On the parallel complexity of minimum sum of diameters clustering
by: Juneam N., et al.
Published: (2017) -
K-MEDIAN: SUATU ALGORITMA PENGELOMPOKAN NON-HIRARKI
by: DANY KURNIAWAN, 089911951
Published: (2004)