System for generating query suggestions using a network of...

Details System for generating query suggestions using a network of... System for generating query suggestions using a network of...

2011-04-05

2011-04-05

Vo, Tim T. (Department: 2168)

Data processing: database and file management or data structures

Database and file access

Post processing of search results

C707S706000, C707S751000, C707S767000, C707SE17014, C709S218000

Reexamination Certificate

active

07921107

ABSTRACT:
A system is described for generating query suggestions using a network of users and advertisers. The system may include a memory, an interface, and a processor. The memory may store a data representing a network comprising query items linked to advertisement items via link items, wherein each link item comprises a weight representing the strength of the relationship between each query item and advertisement item, a search query item, and a relevance value for each query item. The processor may be operatively connected to the memory and the interface and may identify the data representing the network and receive a search query item. The processor may calculate a relevance value for each additional query item in the network based on its relationship to the received search query item. The processor may then suggest the query items with the highest relevance values to the user via the interface.

REFERENCES:
patent: 6006225 (1999-12-01), Bowman et al.
patent: 6098065 (2000-08-01), Skillen et al.
patent: 6564213 (2003-05-01), Ortega et al.
patent: 6876997 (2005-04-01), Rorex et al.
patent: 6947930 (2005-09-01), Anick et al.
patent: 7225182 (2007-05-01), Paine et al.
patent: 7542969 (2009-06-01), Rappaport et al.
patent: 2003/0046161 (2003-03-01), Kamangar et al.
patent: 2003/0055816 (2003-03-01), Paine et al.
patent: 2004/0024752 (2004-02-01), Manber et al.
patent: 2005/0015366 (2005-01-01), Carrasco et al.
patent: 2005/0021397 (2005-01-01), Cui et al.
patent: 2005/0131758 (2005-06-01), Desikan et al.
patent: 2005/0137939 (2005-06-01), Calabria et al.
patent: 2006/0206516 (2006-09-01), Mason
patent: 2006/0248035 (2006-11-01), Gendler et al.
patent: 2006/0287919 (2006-12-01), Rubens et al.
patent: 2007/0027754 (2007-02-01), Collins et al.
patent: 2007/0027864 (2007-02-01), Collins et al.
patent: 2007/0027865 (2007-02-01), Bartz et al.
patent: 2007/0027869 (2007-02-01), Collins
patent: 2007/0156887 (2007-07-01), Wright et al.
patent: 2007/0174258 (2007-07-01), Jones et al.
patent: 2007/0282813 (2007-12-01), Cao et al.
patent: 2008/0154738 (2008-06-01), Jain et al.
patent: 2008/0208841 (2008-08-01), Zeng et al.
Hang Cui et al.; “Probabilistic Query Expansion Using Query Logs”; WWW 2002, May 7-11, 2002; Honolulu, Hawaii, USA; ACM 1-58113-449-5/02/0005; 9 pages.
Brian D. Davison et al.; “Finding Relevant Website Queries”; Department of Computer Sciences & Engineering, Lehigh University; WWW2003, May 20-24, 2003, Budapest, Hungary; 2 pages.
Deborah Fallows, PhD; Pew/Internet, Pew Internet & American Life Project; Search Engine Users,Internet searchers are confident, satisfied and trusting-but they are also unaware and naïve.; Embargoed for publication until 4pm, Jan. 23, 2005.
Trevor Hastie, et al., “The Elements of Statistical Learning”, Data Mining, Inference, and Prediction, Springer Series in Statistics. Springer-Verlag, New York, 2001.
Wikipedia, “Bipartite Graph,” pp. 1-3 at: http://en.wikipedia.org/wiki/Bipartite—graph (last visited Jul. 9, 2007).
Wikipedia, “Collaborative Filtering,” pp. 1-7at: http://wikipedia.org/wiki/Collaborative—filtering (last visited Jul. 9, 2007).
Wikipedia, “Jaccard Index,” pp. 1-3at: http://en.wikipedia.org/wiki/Jaccard—index (last visited Jul. 9, 2007).
Wikipedia, “K-means Algorithm,” pp. 1-4at: http://en.wikipedia.org/wiki/K-means—algorithm (last visited Jul. 9, 2007).
Wikipedia, “Pearson Product-Moment Correlation Coefficient,” pp. 1-2at: http://en.wikipedia.org/wikiPearson—product-moment—correlation—coefficient (last visited Jul. 9, 2007).
Office Action mailed Dec. 9, 2009 for U.S. Appl. No. 11/830,753, 20 pages.
Office Action mailed Apr. 26, 2010 for U.S. Appl. No. 11/786,326, 13 pages.
Office Action mailed May 25, 2010 for U.S. Appl. No. 11/830,693, 20 pages.
Office Action mailed May 27, 2010 for U.S. Appl. No. 11/830,515, 17 pages.
Office Action mailed Jun. 23, 2010 for U.S. Appl. No. 11/830,726, 21 pages.
Google Scholar search results page for the submitted search “+query +query +suggestion +value +exploit” in database “Articles and Patents,” printout generated Nov. 19, 2009, 10 pages.

Affiliated with

Also associated with

Rating

System for generating query suggestions using a network of... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System for generating query suggestions using a network of..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for generating query suggestions using a network of... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2648340