Vittayakorn, Sirion, Kantabutra, Sanpawat and Tanprasert, Chularat (2008) The parallel complexities of the k-medians related problems In: 2008 5th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON), 2008-05-14, Krabi, Thailand.
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 T iterations k-medians problems. We show that these problems are in NC, each has a (logn)<sup>O(1)</sup> parallel time algorithm on an EREW PRAM model using n<sup>O(1)</sup> processors, and the result in each case is the strongest possible.
Item Type:
Conference or Workshop Item (Paper)
Identification Number (DOI):
Divisions:
Deposited by:
ระบบ อัตโนมัติ
Date Deposited:
2021-09-09 23:53:49
Last Modified:
2021-09-27 22:01:17