System for classifying a search query

Details System for classifying a search query System for classifying a search query

2007-01-26

2009-10-13

Stevens, Robert (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07603348

ABSTRACT:
A system is described for classifying a search query. The system may create a machine learning classifier function that may be “trained” by a plurality of categorized queries within a query taxonomy. The system may represent the queries as term vectors and input the term vectors to the machine learning classifier function to generate a value that may correspond to a particular category within the query taxonomy. The system may regularize the machine learning classifier function based on user search click data to improve the classifying accuracy.

REFERENCES:
patent: 5625767 (1997-04-01), Bartell et al.
patent: 6233575 (2001-05-01), Agrawal et al.
patent: 6687696 (2004-02-01), Hofmann et al.
patent: 7051017 (2006-05-01), Marchisio
patent: 7266559 (2007-09-01), Cook et al.
patent: 7328216 (2008-02-01), Hofmann et al.
patent: 2002/0107853 (2002-08-01), Hofmann et al.
patent: 2004/0111419 (2004-06-01), Cook et al.
patent: 2004/0249796 (2004-12-01), Azzam
patent: 2005/0021357 (2005-01-01), Schuetze et al.
patent: 2005/0216448 (2005-09-01), Talib et al.
patent: 2005/0234879 (2005-10-01), Zeng et al.
patent: 2006/0167896 (2006-07-01), Kapur et al.
patent: 2007/0011110 (2007-01-01), Selvaraj et al.
patent: 2007/0203940 (2007-08-01), Wang et al.
patent: 2007/0214115 (2007-09-01), Liu et al.
patent: 2007/0214131 (2007-09-01), Cucerzan et al.
patent: 2007/0239734 (2007-10-01), Arellanes et al.
patent: 2008/0004864 (2008-01-01), Gabrilovich et al.
patent: 2008/0059508 (2008-03-01), Lu et al.
patent: 2008/0065624 (2008-03-01), Sun et al.
patent: 2008/0109285 (2008-05-01), Reuther et al.
patent: 2008/0126280 (2008-05-01), Liu et al.
Brahmi, Abderrezak, et al., “Regularized Classifiers for Information Retrieval”, AI 2005, LNCS 3501, Springer-Verlag, Berlin, Germany, May 3, 2005, pp. 427-431.
Wang, Fei, et al., “Semi-Supervised Classification Using Linear Neighborhood Propagation”, CVPR '06, Jun. 17-22, 2006, pp. 160-167.
Lu, Yumao, et al., “Coupling Feature Selection and Machine Learning Methods for Navigational Query Identification”, CIKM '06, Arlington, VA, Nov. 5-11, 2006, pp. 682-689.
Diaz, Fernando, et al., “When Less is More: Relevance Feedback Falls Short and Term Expansion Succeeds at HARD 2005”, TREC 2005, © 2005, pp. 1-6.
Wang, Jiao, et al., “Semi-Supervised Classification with Active Query Selection”, SSPR&SPR 2006, LNCS 4109, Springer-Verlag, Berlin, Germany, Aug. 9, 2006, pp. 741-746.
DeCoste, Dennis, et al., “Fast Query-Optimized Kernel Machine Classification Via Incremental Approximate Nearest Support Vectors”, ICML-2003, Washington, DC, © 2003, pp. 115-122.
Shimosaka, Masamichi, et al., “Efficient Margin-Based Query Learning on Action Classification”, Proc. of the 2006 IEEE/RSJ International Conf. on Intelligent Robots and Systems, Beijing, China, Oct. 9-15, 2006, pp. 2778-2784.
Sun, Yijun, et al., “Two New Regularized AdaBoost Algorithms”, International Conf. on Machine Learning and Applications, Louisville, KY, Dec. 16-18, 2004, pp. 1-7.
Jones, Rosie, et al., “Generating Query Substitutions”, WWW 2006, Edinburgh, Scotland, May 23-26, 2006, pp. 387-396.
Belkin, M., et al., “Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering,” In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2001. MIT Press, 7 pages (Dec. 2001).
Belkin, M., et al., “On Manifold Regularization,” Technical Report TR-2004-05, Department of Computer Science, The University of Chicago, 12 pages (Jun. 2004).
Billerbeck, B., et al., “Query Expansion using Associated Queries,”CIKM '03, New Orleans, Louisiana, USA, 8 pages (Nov. 3-8, 2003).
Carpineto, C., et al., “An Information-Theoretic Approach to Automatic Query Expansion,” 19(1)ACM Transactions on Information Systems1-27 (Jan. 2001).
Chung, Fan, “Spectral Graph Theory,” book based on CMBS Workshop in Jun. 1994, 25 pages (Sep. 1996).
Cui, H, et al., “Query Expansion by Mining User Logs,” 15(4)IEEE Transactions on Knowledge and Data Engineering829-839 (Jul./Aug. 2003).
He, X., et al., “Face Recognition Using Laplacianfaces,” 27(3)IEEE Transactions on Pattern Analysis and Machine Intelligence1-13 (Mar. 2005).
Ng, A, et al., “On Spectral Clustering: Analysis and an algorithm,” In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2001. MIT Press, 8 pages (Dec. 2001).
Pednault, E.P.D., “Statistical Learning Theory,” MIT Encyclopedia of the Cognitive Sciences, 5 pages (1998).
Shi, J., et al., “Normalized Cuts and Image Segmentation,” 22(8)IEEE Transactions on Pattern Analysis and Machine Intelligence888-905 (Aug. 2000).
Theobald, M, et al., “Efficient and Self-tuning Incremental Query Expansion for Top-k Query Processing,”SIGIR'05, Salvador, Brazil, 8 pages (Aug. 15-19, 2005).
Wen, J., et al., “Query Clustering Using User Logs,” 20(1)ACM Transactions on Information Systems59-81 (Jan. 2002).
Yang, Yiming, “An Evaluation of Statistical Approaches to Text Categorization,”Information Retrieval 1, 69-90 (1999).
Zhou, D., et al., “Learning with Local and Global Consistency,” In S. Thrun, L. K. Saul, and B. Scholkopf, editors, Advances in Neural Information Processing Systems 16, Cambridge, MA, 2003. MIT Press, 8 pages (Dec. 2003).

Affiliated with

Also associated with

Rating

System for classifying a search query 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 classifying a search query, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for classifying a search query will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4116138