Abstract

The Partition Around Medoids (PAM) is a variation of well known k-Means clustering algorithm where center of each cluster should be chosen as an object of clustered set of objects. PAM is used in a wide spectrum of applications, e.g. text analysis, bioinformatics, intelligent transportation systems, etc. There are approaches to speed up k-Means and PAM algorithms by means of graphic accelerators but there none for accelerators based on the Intel Many Integrated Core architecture. This paper presents a parallel version of PAM for the Intel Xeon Phi many-core coprocessor. Parallelization is based on the OpenMP technology. Loop operations are adapted to provide vectorization. Distance matrix is precomputed and stored in the coprocessor's memory. Experimental results are presented and confirm the efficiency of the algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.