Domain expert search

Details Domain expert search Domain expert search

2011-08-23

2011-08-23

Lewis, Alicia M (Department: 2164)

Data processing: database and file management or data structures

Database and file access

Search engines

C707S722000, C707S769000

Reexamination Certificate

active

08005813

ABSTRACT:
Expert domains for a query category represent domains from which a high percentage of search results for queries associated with the query category are retrieved. The expert domains are identified by establishing a base statistical model that indicates frequencies of appearance for domains in search results retrieved for queries corresponding to multiple categories. In addition, frequencies of domain appearance are determined for search results retrieved for queries associated with a category. Domains that appear more frequently in the search results corresponding to the category are identified as expert domains for the category. A user may be allowed to customize expert domains related to one or more categories by adding or removing expert domains for the category.

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
patent: 6012053 (2000-01-01), Pant
patent: 6175829 (2001-01-01), Li
patent: 6272507 (2001-08-01), Pirolli
patent: 6275820 (2001-08-01), Navin-Chandra
patent: 6311194 (2001-10-01), Sheth
patent: 6363378 (2002-03-01), Conklin
patent: 6424973 (2002-07-01), Baclawski
patent: 6460029 (2002-10-01), Fries
patent: 6571249 (2003-05-01), Garrecht
patent: 6574632 (2003-06-01), Fox et al.
patent: 6581057 (2003-06-01), Witbrock et al.
patent: 6594654 (2003-07-01), Salam et al.
patent: 6675159 (2004-01-01), Lin
patent: 6701310 (2004-03-01), Sugiura
patent: 6701318 (2004-03-01), Fox et al.
patent: 6704729 (2004-03-01), Klein et al.
patent: 6728704 (2004-04-01), Mao
patent: 6751611 (2004-06-01), Krupin
patent: 6778979 (2004-08-01), Grefenstette
patent: 6778982 (2004-08-01), Knight
patent: 6795820 (2004-09-01), Barnett
patent: 6944609 (2005-09-01), Witbrock
patent: 7007014 (2006-02-01), Liu et al.
patent: 7152059 (2006-12-01), Monteverde
patent: 7152064 (2006-12-01), Bourdoncle et al.
patent: 7428530 (2008-09-01), Ramarathnam et al.
patent: 7568148 (2009-07-01), Bharat et al.
patent: 2002/0026443 (2002-02-01), Chang
patent: 2002/0078003 (2002-06-01), Krysiak et al.
patent: 2002/0129015 (2002-09-01), Caudill
patent: 2002/0165860 (2002-11-01), Glover
patent: 2002/0169764 (2002-11-01), Kincaid
patent: 2002/0198869 (2002-12-01), Barnett
patent: 2003/0004939 (2003-01-01), Yamaguchi
patent: 2003/0041054 (2003-02-01), Mao et al.
patent: 2003/0069873 (2003-04-01), Fox et al.
patent: 2003/0120654 (2003-06-01), Edlund et al.
patent: 2003/0130998 (2003-07-01), Fox et al.
patent: 2003/0212673 (2003-11-01), Kadayam
patent: 2003/0220913 (2003-11-01), Doganata et al.
patent: 2003/0233224 (2003-12-01), Marchisio et al.
patent: 2004/0010491 (2004-01-01), Riedinger
patent: 2004/0019588 (2004-01-01), Doganata
patent: 2004/0024752 (2004-02-01), Manber
patent: 2004/0030690 (2004-02-01), Teng et al.
patent: 2004/0059729 (2004-03-01), Krupin
patent: 2004/0078224 (2004-04-01), Schramm-Apple 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
patent: 2006/0004716 (2006-01-01), Hurst-Hiller et al.
patent: 2006/0004850 (2006-01-01), Chowdhury
patent: 2006/0020672 (2006-01-01), Shannon
patent: 2006/0100990 (2006-05-01), Aaron
patent: 2006/0167927 (2006-07-01), Edelstein
patent: 2006/0235824 (2006-10-01), Cheung et al.
patent: 2006/0248045 (2006-11-01), Toledano
patent: 2009/0265346 (2009-10-01), Kadayam et al.
patent: 1434952 (2001-08-01), None
patent: WO 01/80077 (2001-10-01), None
Office Action from copending U.S. Appl. No. 11/023,642 dated Nov. 16, 2007, 47 pages.
USPTO Final Office Action issued in U.S. Appl. No. 11/023,645, mailed Jul. 24, 2009, 28 pages.
Office Action for Chinese Application No. 200580047571.X, mailed Sep. 12, 2008, with English-language translation.
Zamir, Oren et al., “Grouper: A Dynamic Clustering Interface to Web Search Results”, Proc. of the 8th International World Wide Web Conf., © 1999, pp. 1-15.
USPTO Final Office Action issued in U.S. Appl. No. 11/023,642, mailed Jan. 7, 2010, 55 pages.
Office Action from copending U.S. Appl. No. 11/023,645 dated Sep. 11, 2007.
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., “Modem 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.
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-lsi.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.iitedu/˜abdur/publications/p435-chowdhury.pdf on Mar. 4, 2005, (pp. 435-442).
Office Action from copending U.S. Appl. No. 11/023,633 dated Oct. 4, 2007, 17 pages.
European Office Action for Application No. 05855735.6, dated Mar. 9, 2009, 6 pages.

Affiliated with

Also associated with

Rating

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

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2779952