"An efficient partition-repetition approach in clustering of big data" by Bikram Karmakar and Indranil Mukhopadhayay
 

An efficient partition-repetition approach in clustering of big data

Document Type

Book Chapter

Publication Title

Big Data Analytics: Methods and Applications

Abstract

Addressing the problem of clustering, i.e. splitting the data into homogeneous groups in an unsupervised way, is one of the major challenges in big data analytics. Volume, variety and velocity associated with such big data make this problem even more complex. Standard clustering techniques might fail due to this inherent complexity of the data cloud. Some adaptations are required or demand for novel methods are to be fulfilled towards achieving a reasonable solution to this problem without compromising the performance, at least beyond a certain limit. In this article we discuss the salient features, major challenges and prospective solution paths to this problem of clustering big data. Discussion on current state of the art reveals the existing problems and some solutions to this issue. The current paradigm and research work specific to the complexities in this area is outlined with special emphasis on the characteristic of big data in this context. We develop an adaptation of a standard method that is more suitable to big data clustering when the data cloud is relatively regular with respect to inherent features. We also discuss a novel method for some special types of data where it is a more plausible and realistic phenomenon to leave some data points as noise or scattered in the domain of whole data cloud while a major portion form different clusters. Our demonstration through simulations reveals the strength and feasibility of applying the proposed algorithm for practical purpose with a very low computation time.

First Page

75

Last Page

93

DOI

10.1007/978-81-322-3628-3_5

Publication Date

1-1-2016

Comments

Open Access; Gold Open Access

Link to Full Text

Share

COinS