Method for partitioning combinatorial graphs
Abstract:
A method of partitioning a weighted combinatorial graph representative of a dataset consists of the steps of generating a generalized Laplacian matrix corresponding to the combinatorial graph, computing the eigenstructure of the generalized Laplacian matrix, determining if an end criterion is satisfied using the eigenstructure, and if the end criterion is not satisfied, calculating new values for at least some of the plurality of weighting factors using the eigenstructure, updating the combinatorial graph with the new values for at least some of the weighting factors, and returning to the generating step.
Public/Granted literature
Information query
Patent Agency Ranking
0/0