Iterative Clustering De-weighting Hidden Data Patterns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data clustering methods struggle with unsupervised, unstructured data due to multiple perspectives and measures of similarity, leading to non-trivial, mutually incompatible structures and clusters, which complicates the identification of meaningful patterns.
Innovation Solution
A computer-implemented method involving iterative clustering and de-weighting of data components using a clustering module and a cluster analysis module, where each pass focuses on de-weighting prominent features to reveal new, hidden clusters and similarity measures, allowing for a hierarchical representation of data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple measures of similarity are used to cluster unsupervised data, then different clustering perspectives are obtained, but the data structure becomes more complex and harder to interpret
Solution Approach 1:
The patent segments the clustering process into multiple passes, where each pass focuses on a specific similarity measure or data aspect. By dividing the complex clustering task into sequential stages (first pass, second pass, etc.), each handling a particular perspective, the system manages complexity while maintaining multiple clustering viewpoints. Each pass produces clusters based on specific criteria, making the overall structure more interpretable.
Solution Approach 2:
The patent introduces a temporal dimension to clustering by performing multiple passes over the data. Instead of attempting to visualize all clustering perspectives simultaneously in one static structure, the system unfolds them across multiple passes/time steps. This transforms the complexity from spatial (multiple dimensions at once) to temporal (sequential exploration), making the data structure more manageable and interpretable.
2Loss of information
If iterative clustering passes are performed to reveal hidden clusters, then tangential clusters are discovered, but the computational time increases
Solution Approach 1:
Each clustering pass performs preliminary action by identifying and clustering data points based on current similarity measures before the next pass begins. The first pass establishes initial clusters that serve as a foundation for subsequent passes. This preliminary clustering reduces the search space for hidden clusters in later passes, enabling discovery of tangential clusters more efficiently than if all passes were performed without leveraging previous results.
Solution Approach 2:
The patent employs periodic action by repeating the clustering process in discrete passes, where each pass applies a specific similarity measure or data transformation. This periodic application of clustering with varying parameters allows the system to systematically explore different data aspects and reveal hidden clusters at appropriate intervals, balancing thoroughness with computational efficiency.
Data Source
AI summary
An example embodiment of the invention provides a computer-implemented method of clustering data. The method comprises performing, by a clustering module, an nth pass of clustering on data to produce a plurality of nth clusters. A cluster analysis module calculates a plurality of components of each of the nth clusters and de-weights a largest component of each of the nth clusters to produce a plurality of de-weighted nth clusters. The clustering module performs an n+1th pass of clustering on the plurality of de-weighted nth clusters to produce a plurality of n+1th clusters. The method may be reiterated.


