Method of clustering multi-dimensional related data in a compute

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395603, 395605, 395613, 395614, 395776, 395779, G06F 700, G06F 1718

Patent

active

057065039

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.

REFERENCES:
patent: 5212794 (1993-05-01), Pettis et al.
patent: 5249295 (1993-09-01), Briggs et al.
patent: 5331554 (1994-07-01), Graham
patent: 5396631 (1995-03-01), Hayashi
patent: 5418717 (1995-05-01), Su
patent: 5457799 (1995-10-01), Srivastava
patent: 5495605 (1996-02-01), Cadot

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method of clustering multi-dimensional related data in a compute does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method of clustering multi-dimensional related data in a compute, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of clustering multi-dimensional related data in a compute will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2338176

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.