Method of clustering multi-dimensional related data in a computer database by combining the two verticles of a graph connected by an edge having the highest score
US5706503A · kind A · utility
Inventors
Key dates
| Filing date | May 18, 1994 |
| Grant date | Jan 6, 1998 |
| Priority date | — |
| Expiry date | May 18, 2014 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99943
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of clustering multi-dimensional related data performed by identifying features from a collection of data, each of said features being represented by a vertex, selecting pairs of features that it is desirable to cluster together, connecting the pair of vertices representing every selected pair of features by an edge, assigning a score to every edge according to a predetermined formula, selecting an edge having the highest score, creating a new vertex by merging the vertices connected by the selected edge, creating new edges between the new vertex and the vertices previously connected to the merged vertices, and repeating this procedure until every edge has a predetermined score.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.