Similarity-based searching

Details Similarity-based searching Similarity-based searching

2008-03-31

2011-10-18

LeRoux, Etienne P (Department: 2161)

Data processing: database and file management or data structures

Database and file access

Reexamination Certificate

active

08041694

ABSTRACT:
Pairs of similar vectors in a set of vectors are identified. A comparison vector x is identified, and a set of candidate vectors corresponding to the vector x is identified. For each candidate vector y in the set, a similarity estimate between the comparison vector x and the candidate vector y is determined; if the similarity estimate meets a similarity threshold, a similarity score of the comparison vector x and the candidate vector y is determined; and if the similarity score meets the similarity threshold, the pair of vectors (x, y) is included in a list of similar pairs of vectors.

REFERENCES:
patent: 5933806 (1999-08-01), Beyerlein et al.
patent: 6055540 (2000-04-01), Snow et al.
patent: 2004/0194612 (2004-10-01), Parees
patent: 2005/0234953 (2005-10-01), Zhang et al.
patent: 2008/0005223 (2008-01-01), Flake et al.
patent: 2008/0021860 (2008-01-01), Wiegering et al.
patent: 2008/0031203 (2008-02-01), Bill
Arasu, A., et al., “Efficient Exact Set-Similarity Joins,” VLDB '06 Proceedings of the 32nd International Conference on Very Large Data Bases, Sep. 12-15, 2006, Seoul, Korea, pp. 918-929.
Broder, A.Z., et al., “Syntactic Clustering Conference of the Web,”Proc. Of the 6thInt'l World Wide Web Conference, 1997, pp. 391-303.
Charikar, M.S., “Similarity Estimation Techniques from Rounding Algorithms,”Proc. Of the 34thAnnual Symposium on Theory of Computing, 2002, pp. 380-388.
Chien, S., and Immorlica, N., “Semantic Similarity Between Search Engine Queries Using Temporal Correlation,”Proc. Of the 14thInt'l World Wide Web Conference, 2005, pp. 2-11.
Fagin, R., et al., “Efficient Similarity Search and Classification via Rank Aggregation,”Proc. Of the 2003 ACM-SIGMOID Int'l Conference on Management of Data, 2003, pp.301-312.
Gionis, A., “Similarity Search in High Dimensions via Hashing,”Proc. Of the 25thInt'l Conference on Very Large Data Bases, 1999,pp. 518-529.
Indyk, P., and Motwani, R., “Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality,”Proc. Of the 30thSymposium on the Theory of Computing, 1998, pp. 604-613.
Bayardo, R.J., et al., ‘ Scaling Up All Pairs Similarity Search,’ Proc. of the 16thInt'l Conf. on World Wide Web, WWW 2007, May 8-12, 2007, Banff, Alberta, Canada, pp. 131-140, revised May 21, 2007.
Buckley et al., “Optimization of Inverted Vector Searches” Proc. of the Eight Annual Int'l Conf. on Research & Dev. In Information Retrieval, pp. 97-110, 1985, 14 pages.
Chaudhuri et al., “A Primitive Operator for Similarity Joins in Data Cleaning” Proc. of the 22nd Int'l Conf. on Data Engineering, (to appear), 2006, 12 pages.
Sarawagi et al., “Efficient set joins on similarity predicates” Proc. of the ACM SIGMOD, pp. 743-754, 2004, 12 pages.
Turtle et al., “Query Evaluation: Strategies and Optimizations” Inform. Process. & Management 31(6):831-850, 1995, 20 pages.

Affiliated with

Also associated with

Rating

Similarity-based searching does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Similarity-based searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-based searching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4253806