Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296| Title: | The parallel complexities of the K-medians related problems |
| Authors: | Sirion Vittayakorn Sanpawat Kantabutra Chularat Tanprasert |
| Authors: | Sirion Vittayakorn Sanpawat Kantabutra Chularat Tanprasert |
| Keywords: | Computer Science;Engineering |
| Issue Date: | 6-Oct-2008 |
| Abstract: | 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. |
| URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949140540&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296 |
| Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.