Filtering search results

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000

Reexamination Certificate

active

07571157

ABSTRACT:
Search results may be sorted or filtered based on scores assigned to the search results. For example, scores may be assigned to search results based on characteristics of surrogate representations of the search results, which are relatively short summaries or excerpts of the search result that may be presented in place of the search results themselves, and those assigned scores may be used to sort or filter the search results. In one example, pairs of search results may be examined to identify significant drops in quality between search results, which is indicated by a large relative or absolute difference in the scores of the search results. Search results with scores that indicate ranks that are lower than a lower ranked search result of the pair of search results may be eliminated when the difference between the scores assigned to the pair of search results exceeds a maximum allowable difference.

REFERENCES:
patent: 5265065 (1993-11-01), Turtle
patent: 5640553 (1997-06-01), Schultz
patent: 5924090 (1999-07-01), Krellenstein
patent: 5933822 (1999-08-01), Braden-Harder et al.
patent: 6012053 (2000-01-01), Pant et al.
patent: 6175829 (2001-01-01), Li et al.
patent: 6272507 (2001-08-01), Pirolli et al.
patent: 6275820 (2001-08-01), Navin-Chandra et al.
patent: 6311194 (2001-10-01), Sheth et al.
patent: 6363378 (2002-03-01), Conklin et al.
patent: 6424973 (2002-07-01), Baclawski
patent: 6460029 (2002-10-01), Fries et al.
patent: 6571249 (2003-05-01), Garrecht
patent: 6581057 (2003-06-01), Witbrock et al.
patent: 6675159 (2004-01-01), Lin et al.
patent: 6701310 (2004-03-01), Sugiura et al.
patent: 6704729 (2004-03-01), Klein et al.
patent: 6728704 (2004-04-01), Mao et al.
patent: 6751611 (2004-06-01), Krupin et al.
patent: 6778979 (2004-08-01), Grefenstette et al.
patent: 6778982 (2004-08-01), Knight
patent: 6795820 (2004-09-01), Barnett
patent: 7007014 (2006-02-01), Liu et al.
patent: 7152064 (2006-12-01), Bourdoncle et al.
patent: 2002/0026443 (2002-02-01), Chang
patent: 2002/0129015 (2002-09-01), Caudill et al.
patent: 2002/0165860 (2002-11-01), Glover et al.
patent: 2002/0169764 (2002-11-01), Kincaid et al.
patent: 2002/0198869 (2002-12-01), Barnett
patent: 2003/0004939 (2003-01-01), Yamaguchi et al.
patent: 2003/0120654 (2003-06-01), Edlund et al.
patent: 2003/0212673 (2003-11-01), Kadayam et al.
patent: 2003/0220913 (2003-11-01), Doganata et al.
patent: 2004/0010491 (2004-01-01), Riedinger
patent: 2004/0019588 (2004-01-01), Doganata et al.
patent: 2004/0024752 (2004-02-01), Manber et al.
patent: 2004/0059729 (2004-03-01), Krupin et al.
patent: 2004/0172393 (2004-09-01), Kazi et al.
patent: 2004/0215607 (2004-10-01), Travis, Jr.
patent: 2004/0220907 (2004-11-01), Camarillo
patent: 2004/0255237 (2004-12-01), Tong
patent: 2005/0050026 (2005-03-01), Kawamura et al.
patent: 2005/0154716 (2005-07-01), Watson et al.
patent: 2006/0004716 (2006-01-01), Hurst-Hiller et al.
patent: 2006/0004850 (2006-01-01), Chowdhury
patent: 2006/0020672 (2006-01-01), Shannon et al.
patent: 2006/0167927 (2006-07-01), Edelstein et al.
patent: 2006/0235824 (2006-10-01), Cheung et al.
patent: 2006/0248045 (2006-11-01), Toledano et al.
patent: 2008/0040316 (2008-02-01), Lawrence
patent: 1434952 (2001-08-01), None
patent: WO 01/80077 (2001-10-01), None
L. R. Khan, “Ontology-based Information Selection”, reprinted from http://www.utdallas/edu/research/esc/publication/ikhan-def.pdf on Mar. 4, 2005; (129 pages).
Luo Si et al., “Using Sampled Data and Regression to Merge Search Engine Results”, reprinted from http://www-2.cs.cum.edu/˜callan/papers/sigin02-Isi.pdf on Dec. 21, 2004, (8 pages).
Lemur: Distributed Information Retrieal, “Distributed Information Retrieval in Lemur”, reprinted from http://www-2.cs.cmu.edu/˜lemur/3.1/distrib.html on Dec. 21, 2004, (pp. 1-7).
Beitzel et al., “On Fusion of Effective Retrieval Strategies in the Same Information Retrieval System”, reprinted from http://www.in.iit.edu/publications/downloads/2004—JASIST—effectivestrategiesfusion.pdf on Mar. 4, 2005 (pp. 1-13).
Beitzel et al., “Evaluation of Filtering Current News Search Results”, reprinted from http://www.ir.itt.edu/publications/downloads/p135-beitzel.pdf on Mar. 4, 2005, (2 pages).
Chowdhury et al., “Operational Requirements for Scalable Search Systems”, reprinted from http://ir.iit.edu/˜abdur/publications/p435-chowdhury.pdf on Mar. 4, 2005, (pp. 435-442).
Rasolofo Y. et al., “Result Merging Strategies For A Current News Metasearcher,” Information Processing & Management 39 (2003), Elsevier, Barking GB, pp. 581-609.
Oztekin B.U. and Karypis, G. and Kumar, V., “Expert Agreement And Content Based Reranking In A Meta Search Environment Using Mearf,” Proceedings of the 11thInternational Conference on World Wide Web, May 7-11, 2002, Honolulu, Hawaii, pp. 333-344.
Craswell, N., Hawking, D. and Thistlewaite, P., “Merging Results from Isolated Search Engines,” Proceedings of the 10thAustralasian Database Conference, Aukland, New Zealand, Jan. 18-21, 1999, 12 pages.
Meng, W. et al. “Building Efficient and Effective Metasearch Engines,” ACM Computing Surveys, vol. 34, No. 1, Mar. 2002, New York, NY, pp. 48-89.
Spoerri A., “Coordinated Views And Tight Coupling To Support Mega Searching,” Proceedings of the Second International Conference on Coordinated and Multiple Views in Exploratory Visualization, 2004, pp. 39-48.
Baeza-Yates, R. et al., “Modern Information Retrieval, Chapter 13, Searching the web,” Modern Information Retrieval, Harlow: Addison-Wesley, GB, 1999, pp. 367-395.
Fei-Yue Wang et al., “An Application Specific Knowledge Engine For Researches In Intelligent Transportation Systems,” 2004 IEEE Intelligent Transportation Systems Conference, Washington, DC, Oct. 3-6, 2004, pp. 841-846.
Etzioni, O., “Moving Up the Information Food Chain, Deploying Sofbots on the World Wide Web,” Proceedings on the Thirteenth National Conference on Artificial Intelligence, Aug. 4, 1996, pp. 1322-1326.
Zhang, J. and Cheung, C. “Meta-Search-Engine Feature Analysis,” Online Information Review, vol. 27, No. 6, 2003, pp. 433-441.
Desai, M. and Spink, A., “An Approach to Document Clustering Based on System Relevance,” Proceedings of the 67th American Society for Information Science and Technology (ASIS&T), vol. 41, No. 1, Nov. 12, 2004, pp. 256-266.
Jain A. K., et al., “Data Clustering: A Review,” ACM Computing Surveys, New York, NY, vol. 31, No. 3, Sep. 3, 1999, pp. 264-323.
Gauch, Susan et al., “ProFusion* : Intelligent Fusion from Multiple, Distributed Search Engines,” Journal of Universal Computer Science, vol. 2, No. 9, Sep. 1996, 13 pages.
Office Action from copending U.S. Appl. No. 11/023,651, dated Apr. 30, 2007.
Office Action from copending U.S. Appl. No. 11/023,642, dated May 11, 2007.
Notice of Allowance from copending U.S. Appl. No. 11/023,648, dated May 16, 2007.
Office Action from copending U.S. Appl. No. 11/023,643, dated Apr. 2, 2007.
Office Action from copending U.S. Appl. No. 11/023,642, dated Nov. 16, 2007, 47 pages.
Office Action from copending U.S. Appl. No. 11/023,645, dated Sep. 11, 2007.
Office Action for Chinese Application No. 200580047571.X, mailed Sep. 12, 2008, with English-language translation.

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

Filtering search results does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-4112860

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