Method and system for filtering of information entities

Details Method and system for filtering of information entities Method and system for filtering of information entities

2006-02-07

2006-02-07

Le, Uyen (Department: 2163)

Data processing: database and file management or data structures

Database design

Data structure types

C715S252000

Reexamination Certificate

active

06996572

ABSTRACT:
A system and method are provided for eliciting interesting structure from a collection of entities or resources with explicit and/or implicit, static and/or dynamic relations, called “affinities,” between them. Interesting structure includes (1) notions of quality, authority, or definitiveness of information, (2) notions of relevance to a user's information need, (3) notions of similarity among the plurality of resources retrieved from a universe of resources by a query process, and (4) notions of similarity among the usages of resources by different users/servers. Similarities between entities are computed, based on similarities between the affinity values for the entities. That is, where the affinitiy values for two entities resemble each other, the two entities have a high degree of similarity. Using the similarities, the entities are ranked, clustered, etc., based on a significance derived from the similarities. The ranking, clustering, etc., makes up the interesting structure which is sought.

REFERENCES:
patent: 5257185 (1993-10-01), Farley et al.
patent: 5446891 (1995-08-01), Kaplan et al.
patent: 5535382 (1996-07-01), Ogawa
patent: 5727129 (1998-03-01), Barrett et al.
patent: 5778362 (1998-07-01), Deerwester
patent: 5819258 (1998-10-01), Vaithyanathan et al.
patent: 5832494 (1998-11-01), Egger et al.
patent: 5835905 (1998-11-01), Pirolli et al.
patent: 5855015 (1998-12-01), Shoham
patent: 5940821 (1999-08-01), Wical
patent: 6041311 (2000-03-01), Chislenko et al.
patent: 63-228221 (1988-09-01), None
White et al, “Similarity Indexing with the SS-tree”, Data Engineering 1996, Proceedings of the Twelfth International Conference, pp516-523.
Yuwono et al, “Search and Ranking Algorithms for Locating Resources on the World Wide Web”, Data Engineering 1996, Proceedings of the Twelfth International Conference, pp 164-171.
Microsoft Press Computer Dictionary, Third Edition, 1997, pp. 240, 478.
H. C. Arents et al., “Concept-based Retrieval of Hypermedia Information: From Term Indexing to Semantic Hyperindexing”,Information Processing&Management, vol. 29, No. 3, 1993, pp. 373-386.
J. Bichteler et al., “Document Retrieval by Means of an Automatic Classification Algorithm for Citations”,Information Storage and Retrieval, vol. 10, No. 7-8, Jul./Aug. 1971, pp. 267-279.
M. E. Frisse, “Searching for Information in a Hypertext Medical Handbook”,Communications of the ACM, vol. 31, No. 7, Jul. 1988, pp. 880-886.
G. H. Golub et al., “Matrix Computations”, 2nd Ed.,The Johns Hopkins University Press, 1989, pp. 218-219, 351-354.
T. R. Kochtanek, “Document Clustering, Using Macro Retrieval Techniques”,Journal of the American Society for Information Science, vol. 34, No. 5, Sep. 1983, pp. 356-359.
F. Nanin et al., “Bibliometrics”,Annual Review of Information Science and Technology, 1977, pp. 35-57.
R. Rada et al., “Retrieval Hierarchies in Hypertext”,Information Processing&Management, vol. 29, No. 3, 1993, pp. 359-371.
E. Rivlin et al., “Navigating in Hyperspace: Designing a Structure-based Toolbox”,Communications of the ACM, vol. 37, No. 2, Feb. 1994, pp. 87-96.
R. W. Schwanke et al., “Cross References are Features”,Springer-Verlag, 1993, pp 107-123.
W. M. Shaw, Jr., “Subject Indexing and Citation Indexing—Part II: An Evaluation and Comparison”,Information Processing&Management, vol. 26, No. 6, 1990, pp. 705-718.
W. M. Shaw, Jr., “Subject and Citation Indexing—Part I: The Clustering Structure of Composite Representations in the Cystic Fibrosis Document Collection”,Journal of the American Society for Information Science, vol. 42, No. 9, 1991, pp. 669-675.
W. M. Shaw, Jr., “Subject and Citation Indexing—Part II: The Optimal, Cluster-based Retrieval Performance of Composite Representations”,Journal of the American Society for Information Science, vol. 42, No. 9, 1991, pp. 676-684.
D. A. Spielman et al., “Spectral Partitioning Works: Planar Graphs and Finite Element Meshes”,Based on UC Berkeley Technical Report UCB//CSD-96-898.
R. Weiss et al., “HyPursuit: A Hierarchical Network Search Engine that Exploits Content-Link Hypertext Clustering”,MIT Laboratory for Computer Science, Cambridge, MA, no date.

Affiliated with

Also associated with

Rating

Method and system for filtering of information entities 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 system for filtering of information entities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for filtering of information entities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3658153