Scalable random sampling K-prototypes using spark

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Big data clustering has become an important challenge in machine learning. Several Big data frameworks have been developed to scale clustering methods for Big data analysis. One such framework called Spark works well for iterative algorithms by supporting in-memory computations. We propose in this paper a new Scalable Random Sampling K-Prototypes, implemented on Spark framework. This method is able to perform grouping from mixed large scale data. Experiments realized on simulated and real data sets show the efficiency of the proposed method compared to existing k-prototypes methods.

Author supplied keywords

Cite

CITATION STYLE

APA

Ben HajKacem, M. A., Ben N’cir, C. E., & Essoussi, N. (2018). Scalable random sampling K-prototypes using spark. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11031 LNCS, pp. 317–326). Springer Verlag. https://doi.org/10.1007/978-3-319-98539-8_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free