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: | Sirion Vittayakorn, Sanpawat Kantabutra, Chularat Tanprasert |
---|---|
Format: | Conference Proceeding |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949140540&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The parallel complexities of the K-medians related problems
by: Vittayakorn S., et al.
Published: (2014) -
On the parallel complexity of minimum sum of diameters clustering
by: Nopadon Juneam, et al.
Published: (2018) -
On the parallel complexity of hierarchical clustering and CC-complete problems
by: Raymond Greenlaw, et al.
Published: (2018) -
The complexity of the overlay network verification and its related problems
by: Wattana Jindaluang, et al.
Published: (2018) -
The Complexity of the Infinity Replacement Problem in the Cyber Security Model
by: Supachai Mukdasanit, et al.
Published: (2018)