Parallel Algorithm For Level Clustering


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 2, pp. 148-155, Mar. 1995
10.3745/KIPSTE.1995.2.2.148,   PDF Download:

Abstract

When we analize many amount of patterns, it is necessary for these patterns are to be clustering into several groups according to a certain evaluation function. This process, in case that there are lots of input patterns, needs a considerable amount of computations and is reqired parallel algorithm for these. To solve this problem, this paper propose parallel clustering algorithm which parallelized k-means algorithm and implemented it under the MIMD parallel computer based message passing. The result is through the experiment and performance analysis, that this parallel algorithm is appropriate in case these are many input patterns.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. Y. Keun, "Parallel Algorithm For Level Clustering," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 2, no. 2, pp. 148-155, 1995. DOI: 10.3745/KIPSTE.1995.2.2.148.

[ACM Style]
Bae Yong Keun. 1995. Parallel Algorithm For Level Clustering. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 2, 2, (1995), 148-155. DOI: 10.3745/KIPSTE.1995.2.2.148.