Hadoop Silhouette Coefficient Calculation for Massive Data

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods for analyzing the significance of clustering massive data are inefficient due to high computational complexity, which makes it impractical for a single computer to handle the calculations required for the silhouette coefficient, especially when dealing with large datasets.

Innovation Solution

A system and method utilizing the Hadoop framework to distribute the calculation of the silhouette coefficient across multiple computers, dividing data into blocks, and using a map/reduce process to efficiently calculate and verify the clustering significance index.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If the silhouette coefficient is calculated using the typical methodology for massive data, then the clustering significance can be verified, but the computational complexity becomes prohibitively large and cannot be handled by a single computer

Engineering Contradiction:
Improveclustering significance verificationVSAvoidcomputational complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent divides the massive data into multiple blocks and distributes them across multiple computers in a Hadoop cluster. Each computer calculates the silhouette coefficient for its assigned block independently, then the results are aggregated. This segmentation reduces the computational burden on any single device while maintaining the reliability of the overall clustering verification.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If all massive data is loaded into the memory of a single computer for calculation, then the silhouette coefficient can be calculated, but the system becomes impractical due to memory and processing limitations

Engineering Contradiction:
Improvesilhouette coefficient calculationVSAvoidprocessing efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent transitions from a single-computer architecture to a distributed multi-computer architecture. By adding the dimension of spatial distribution across multiple nodes in a Hadoop cluster, the system can process massive data that would be impossible to handle on a single machine, thereby maintaining measurement precision while dramatically improving productivity.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

3Reliability

If the number of calculations is increased to verify clustering significance for massive data, then more accurate results are obtained, but the processing time becomes excessively long

Engineering Contradiction:
Improveclustering result verificationVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent merges the computational resources of multiple computers in a Hadoop cluster to perform the silhouette coefficient calculations simultaneously. By combining the processing power of multiple nodes, the system maintains high reliability through comprehensive verification while reducing the overall processing time compared to sequential calculation on a single machine.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS10402427B2System and method for analyzing result of clustering massive data
Publication Date: 2019.09.03 SK PLANET CO LTD
  • US10402427B2 patent drawing
  • US10402427B2 patent drawing
  • US10402427B2 patent drawing

AI summary

Disclosed are a system and a method for analyzing a result of clustering massive data. An open-source map/reduce framework named Hadoop is used to calculate a silhouette coefficient corresponding to a significance verification index capable of evaluating a result of clustering massive data. To implement the system and the method for analyzing a result of clustering massive data, clustered data is divided into blocks. For all of the blocks, input splits are generated. Then, the generated input splits are assigned to multiple computers. Each computer stores only data of blocks included in an input split assigned in a memory, and calculates a silhouette coefficient for each record. Each computer provides only the calculated silhouette coefficient to an index coefficient calculation apparatus, and enables the index coefficient calculation apparatus to calculate a silhouette coefficient for a cluster. Therefore, the result of clustering the massive data can be rapidly and objectively analyzed.