Clustering of large data based on the relational analysis

Clustering categorical data based on the relational analysis approach and MapReduce

“…16 clusters have been discovered, of which 13 reached the maximum purity value. As reported in [3], the number of clusters discovered by the Transitive heuristic is 14 for this data set. The clusters 6, 12, and 13 in Table 4 are also observed in the result of the original method.…”

“…Lamari and Slaoui J Big Data (2017) Page 2 of 16 Lamari and Slaoui J Big Data (2017) 4:28 focus on the clustering procedure, which aims to partition data into groups of similar objects fulfilling the conditions of the maximizing the similarity between objects in the same group, and the minimization of the similarity between objects in different groups [2]. In order to solve this problem, we propose PMR-Transitive, which is a new parallel heuristic based on the MapReduce programming model of a recently appeared method, named Transitive heuristic [3]. In this heuristic, clusters are obtained by partitioning categorical large data sets according to the relational analysis approach [4].…”

Big Data Processing for Full-Text Search and Visualization with Elasticsearch

“…Finally, the last step is responsible for the merge of core clusters and it is performed with a single MapReduce algorithm. [22] is a new parallel heuristic based on the MapReduce programming model of a recently appeared method, namely, Transitive heuristic [23]. In this heuristic, clusters are obtained by partitioning categorical large data sets according to the relational analysis approach.…”