Clustering data including those with asymmetric relationships

Details Clustering data including those with asymmetric relationships Clustering data including those with asymmetric relationships

2005-08-02

2005-08-02

Rimell, Sam (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C382S173000, C382S176000, C707S793000

Reexamination Certificate

active

06925460

ABSTRACT:
The present invention relates to a method, system and computer program product for clustering data points and its application to text summarization, customer profiling for web personalization and product cataloging.The method for clustering data points with defined quantified relationships between them comprises the steps of obtaining lead value for each data point either by deriving from said quantified relationships or as given input, ranking each data point in a lead value sequence list in descending order of lead value, assigning the first data point in said lead value sequence list as the leader of the first cluster, and considering each subsequent data point in said lead value sequence list as a leader of a new cluster if its relationship with the leaders of each of the previous clusters is less than a defined threshold value or as a member of one or more clusters where its relationship with the cluster leader is more than or equal to said threshold value. The said relationships between data points are symmetric or asymmetric. Similarly, system and computer program product have also been claimed.

REFERENCES:
patent: 5630018 (1997-05-01), Hayashi et al.
patent: 5638543 (1997-06-01), Pedersen et al.
patent: 5841437 (1998-11-01), Fishkin et al.
patent: 5867164 (1999-02-01), Bornstein et al.
patent: 5963969 (1999-10-01), Tidwell et al.
patent: 6141443 (2000-10-01), Nakao et al.
patent: 6289354 (2001-09-01), Aggarwal et al.
patent: 6468476 (2002-10-01), Friend et al.
patent: 6567936 (2003-05-01), Yang et al.
patent: 2002/0099702 (2002-07-01), Oddo
W.B. Frakes and R. Baeza-Yates, Information Retrieval: Data Structures and Algorithms, Prentice Hall, Englewood Cliffs, NJ, 1992.
R. Agrawal, J.C. Shafer, “Parallel Mining of Association Rules”, IEEE Transactions on Knowledge and Data Engineering, vol. 8, No. 6, Dec. 1996.
S. Deerwester, S.T. Dumais, G.W. Furnas, T.K. Landauer, R. Harshman, “Indexing by Latent Semantic Analysis”, Journal of the American Society for Information Science, 41(6), 391-407, 1990.
P.W. Foltz, “Using Latent Semantic Indexing for Information Filtering,” In R.B. Allen (Ed.) Proceedings of the Conference on Office Information Systems, Cambridge, MA, 40-47, 1990. (http://www-psych.nmsu.edu/˜pfoltz/cois/filtering-cois.html).
E. Savia, T. Kurki, and S. Jokela, “Metadata Based Matching of Documents and Use Profiles,”Proceedings of 8th Finnish Artificial Conference, Human and Artificial Information Processing,pp. 61-69, 1998.
R. Srikant, R. Agrawal, “Mining Generalized Association Rules”, Proc. of the 21st Int'l Conference on Very Large Databases, Zurich, Switzerland, Sep. 1995.

Affiliated with

Also associated with

Rating

Clustering data including those with asymmetric relationships does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Clustering data including those with asymmetric relationships, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering data including those with asymmetric relationships will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3472492