Method and apparatus for almost-constant-time clustering of arbi

Details Method and apparatus for almost-constant-time clustering of arbi Method and apparatus for almost-constant-time clustering of arbi

1998-01-26

2000-03-14

Black, Thomas G.

Data processing: database and file management or data structures

Database design

Data structure types

707 3, 707 5, G06F 1730

Patent

active

06038557&

ABSTRACT:
A method and apparatus for almost-constant-time re-clustering of corpus subsets with customizable time/precision tradeoff, is usable in a basic browsing method, such as Scatter/Gather, to successfully partition a large document collection into clusters of related documents. The user is first presented with a clustering of the entire corpus into metadocuments from which the worst metadocument is selected and replaced with its "children". Children containing no documents of interest are pruned and the remaining metadocuments are further expanded until a predetermined number of children metadocuments are obtain. The resulting metadocuments are then reclustered. The process is repeated until the user obtains the desired degree of specificity.

REFERENCES:
patent: 5317507 (1994-05-01), Gallant
patent: 5442778 (1995-08-01), Pedersen et al.
patent: 5483650 (1996-01-01), Pedersen et al.
patent: 5619709 (1997-04-01), Caid et al.

Affiliated with

Also associated with

Rating

Method and apparatus for almost-constant-time clustering of arbi 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 and apparatus for almost-constant-time clustering of arbi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for almost-constant-time clustering of arbi will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-178928