Auxiliary Graph Construction for Dense Clustering
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional algorithms face difficulties in clustering larger and denser graphs due to increased computational complexity, making it challenging to identify meaningful subsets or clusters effectively.
Innovation Solution
Constructing an auxiliary graph that is less dense than the participation graph, allowing for more efficient analysis, and determining clusters by solving an objective function defined for the auxiliary graph, which can then be translated back to the participation graph.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional clustering algorithms are applied to larger and denser graphs, then clustering can be performed, but computational complexity increases significantly
Solution Approach 1:
The patent creates a copy of the original graph (the auxiliary graph) with modified edge weights that simplify the clustering problem. This auxiliary graph preserves the essential cluster structure of the original graph while having reduced computational complexity, allowing traditional algorithms to run efficiently on the simplified version rather than the dense original graph.
Solution Approach 2:
The patent changes the parameters of the graph by transforming edge weights in the auxiliary graph. Specifically, edge weights are adjusted to reflect cluster membership probabilities, converting the clustering problem into a parameter optimization problem that can be solved more efficiently using standard algorithms on the transformed graph structure.
2Reliability
If the graph becomes denser with more edges, then more relationships are captured, but the number of computations required for clustering increases
Solution Approach 1:
The patent copies the relationship structure from the dense original graph into an auxiliary graph, but represents these relationships through a simplified weight scheme. This allows the auxiliary graph to capture the same relationship information with fewer explicit edges, reducing computation time while maintaining reliability.
Solution Approach 2:
The patent extracts the essential clustering information from the dense graph by computing auxiliary edge weights that encapsulate multiple relationships. This extraction process identifies and isolates the critical structural elements needed for clustering, removing redundant computational overhead while preserving the essential relationship capture capability.
Data Source
AI summary
Various embodiments provide techniques for graph clustering. In one or more embodiments, a participation graph is obtained that represents relationships between entities. An auxiliary graph is constructed based on the participation graph. The auxiliary graph may be constructed such that the auxiliary graph is less dense than the participation graph and is therefore computationally less complex to analyze. Clusters in the auxiliary graph are determined by solving an objective function defined for the auxiliary graph. Clusters determined for the auxiliary graph may then be utilized to ascertain clusters in the participation graph that solve a related objective function defined for the participation graph.