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...

Full description

Saved in:
Bibliographic Details
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
id th-cmuir.6653943832-60296
record_format dspace
spelling th-cmuir.6653943832-602962018-09-10T03:42:16Z The parallel complexities of the K-medians related problems Sirion Vittayakorn Sanpawat Kantabutra Chularat Tanprasert Computer Science Engineering 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. 2018-09-10T03:40:41Z 2018-09-10T03:40:41Z 2008-10-06 Conference Proceeding 2-s2.0-52949140540 10.1109/ECTICON.2008.4600360 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949140540&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296
institution Chiang Mai University
building Chiang Mai University Library
country Thailand
collection CMU Intellectual Repository
topic Computer Science
Engineering
spellingShingle Computer Science
Engineering
Sirion Vittayakorn
Sanpawat Kantabutra
Chularat Tanprasert
The parallel complexities of the K-medians related problems
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 Proceeding
author Sirion Vittayakorn
Sanpawat Kantabutra
Chularat Tanprasert
author_facet Sirion Vittayakorn
Sanpawat Kantabutra
Chularat Tanprasert
author_sort Sirion Vittayakorn
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 2018
url https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=52949140540&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/60296
_version_ 1681425409678245888