Method for partitioning combinatorial graphs
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Oct 1, 2013
Grant Date -
Jan 29, 2009
app pub date -
May 2, 2008
filing date -
May 3, 2007
priority date (Note) -
In Force
status (Latency Note)
Importance
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.
First Claim
Other Claims data not available
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Maintenance Fees
| Fee | Large entity fee | small entity fee | micro entity fee | due date |
|---|---|---|---|---|
| 11.5 Year Payment | $7400.00 | $3700.00 | $1850.00 | Apr 1, 2025 |
