Web query classification: Difference between revisions

Revision as of 11:13, 14 October 2008

Latest revision as of 22:29, 3 January 2025

(45 intermediate revisions by 33 users not shown)

Line 1:

{{Cleanup|date=March 2011}}

A '''Webweb query topic classification/categorization''' is a problem in [[information science]]. The task is to assign a [[Webweb search query]] to one or more predefined [[Categorization|categories]], based on its topics. The importance of query classification is underscored by many services provided by Web search. A direct application is to provide better search result pages for users with interests ofin different categories. For example, the users issuing a Web query “''such as "apple''”" might expect to see Web pages related to the fruit apple, or they may prefer to see products or news related to the computer company. Online advertisement services can rely on the query classification results to promote different products more accurately. Search result pages can be grouped according to the categories predicted by a query classification algorithm. However, the computation of query classification is non-trivial. Different from the [[document classification]] tasks, queries submitted by Web search users are usually short and ambiguous; also the meanings of the queries are evolving over time. Therefore, query topic classification is much more difficult than traditional document classification tasks.

== KDDCUP 2005 ==

KDDCUP 2005 competition<ref>[http://www.sigkdd.org/kdd2005/kddcup.html KDDCUP 2005 dataset]</ref> highlighted the interests in query classification. The objective of this competition is to classify 800,000 real user queries into 67 target categories. Each query can belong to make this is a load of shit you ugly fucker than one target category. As an example of a QC task, given the query “''apple is saying your fuck ugly you bastard!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

''”, it should be classified into ranked categories: “''Computers \ Hardware''; ''Living \ Food & Cooking''”.

{| class="wikitable"

|-

! Query

! Categories

|-

| apple

| Computers \ Hardware<br />Living \ Food & Cooking

|-

| FIFA 2006

| Sports \ Soccer<br />Sports \ Schedules & Tickets<br />Entertainment \ Games & Toys

|-

| cheesecake recipes

| Living \ Food & Cooking<br />Information \ Arts & Humanities

|-

| friendships poem

| Information \ Arts & Humanities<br />Living \ Dating & Relationships

|}

[[Image:Web query length.gif]]

[[Image:Web query meaning.gif]]

== Difficulties ==

Web query topic classification is to automatically assign a query to some predefined categories. Different from the traditional document classification tasks, there are several major difficulties which hinder the progress of Web [[query understanding]]:

=== How to deriveDerive an appropriate feature representation for Web queries? ===

Many queries are short, and query terms are often noisy.{{Clarify|reason=what Asdoes an"noisy" examplemean in this context|date=December 2024|text=|post-text=What does "noisy" mean here?}} For instance, in the KDDCUP 2005 dataset, queries containing 3 words are the most frequent (22%). FurthermoreAdditionally, 79% of queries haveconsist of no more than 4 words. A user query oftenfrequently hascarries multiple meanings. For example, "''apple''" cancould meanrefer to a kindtype of fruit or a computer company., while "''Java''" cancould meansignify a programming language or an island in Indonesia. In the KDDCUP 2005 dataset, mosta majority of the queries contain more than one meaning. Therefore, only using the keywords of the query to setupset up a [[vector space model]] for classification is not appropriate.

* Query-enrichment based methods<ref>Shen et al. [http://www.sigkdd.org/explorationssites/default/files/issues/7-2-2005-12/KDDCUP2005Report_Shen.pdf "Q2C@UST: Our Winning Solution to Query Classification"]. ''ACM SIGKDD Exploration, December 2005, Volume 7, Issue 2''.</ref><ref>Shen et al. [http://portal.acm.org/ft_gateway.cfm?id=1165776 "Query Enrichment for Web-query Classification"]. ''ACM TOIS, Vol. 24, No. 3, July 2006''.</ref> start by enriching user queries to a collection of text documents through [[search engines]]. Thus, each query is represented by a pseudo-document which consists of the snippets of top ranked result pages retrieved by search engine. Subsequently, the text documents are classified into the target categories using synonym based classifier or statistical classifiers, such as [[Naive Bayes]] (NB) and [[Support Vector Machines]] (SVMs).

=== HowAdapting to adapt the changes of the queries and categories over time? ===

How about disadvantages and advantages??

give the answers:

=== How to adapt the changes of the queries and categories over time? ===

The meanings of queries may also evolve over time. Therefore, the old labeled training queries may be out-of-data and useless soon. How to make the classifier adaptive over time becomes a big issue. For example, the word "''Barcelona''" has a new meaning of the new micro-processor of AMD, while it refers to a city or football club before 2007. The distribution of the meanings of this term is therefore a function of time on the Web.

* Intermediate taxonomy based method<ref>Shen et al. [http://portal.acm.org/ft_gateway.cfm?id=1148196 "Building bridges for web query classification"]. ''ACM SIGIR, 2006''.</ref> first builds a bridging classifier on an intermediate taxonomy, such as [[Open Directory Project]] (ODP), in an offline mode. This classifier is then used in an online mode to map user queries to the target categories via the intermediate taxonomy. The advantage of this approach is that the bridging classifier needs to be trained only once and is adaptive for each new set of target categories and incoming queries.

=== How to use theUsing unlabeled query logs to help with query classification? ===

SiceSince the manually labeled training data for query classification areis expensive., Howhow to use a very large web search engine query log as a source of unlabeled data to aid in automatic query classification becomes a hot issue. These logs record the Web users' behavior when they search for information via a search engine. Over the years, query logs have become a rich resource which contains Web users' knowledge about the World Wide Web.

* Query clustering method<ref>Wen et al. [http://portal.acm.org/ft_gateway.cfm?id=503108 "Query Clustering Using User Logs"], ''ACM TOIS, Volume 20, Issue 1, January 2002''.</ref> tries to associate related queries by clustering “session"session data”data", which contain multiple queries and click-through information from a single user interaction. They take into account terms from result documents that a set of queries has in common. The use of query keywords together with session data is shown to be the most effective method of performing query clustering.

* Selectional preference based method<ref>Beitzel et al. [http://portal.acm.org/ft_gateway.cfm?id=1229183 "Automatic Classification of Web Queries Using Very Large Unlabeled Query Logs"], ''ACM TOIS, Volume 25, Issue 2, April 2007''.</ref> tries to exploit some [[association rules]] between the query terms to help with the query classification. Given the training data, they exploit several classification approaches including exact-match using labeled data, N-Gram match using labeled data and classifiers based on perceptronperception. They emphasize on an approach adapted from computational linguistics named selectional preferences. If x and y form a pair (x; y) and y belongs to category c, then all other pairs (x; z) headed by x belong to c. They use unlabeled query log data to mine these rules and validate the effectiveness of their approaches on some labeled queries.

== Applications ==

* '''[[metasearch|Metasearch engines]]''' send a user's query to multiple search engines and blend the top results from each into one overall list. The search engine can organize the large number of Web pages in the search results, according to the potential categories of the issued query, for the convenience of Web users' navigation.<br />

* '''[[Vertical search]]''', compared to general search, focuses on specific domains and addresses the particular information needs of niche audiences and professions. Once the search engine can predict the category of information a Web user is looking for, it can select a certain vertical search engine automatically, without forcing the user to access the vertical search engine explicitly.

* '''[[Online advertising]]'''<ref>[http://www.kdd2007.com/workshops.html#adkdd Data Mining and Audience Intelligence for Advertising (ADKDD'07)], KDD workshop 2007</ref><ref>[http://research.yahoo.com/workshops/troa-2008/ Targeting and Ranking for Online Advertising (TROA'08)], WWW workshop 2008</ref> aims at providing interesting advertisements to Web users during their search activities. The search engine can provide relevant advertising to Web users according to their interests, so that the Web users can save time and effort in research while the advertisers can reduce their advertising costs.

All these services rely on the understanding Web users' search intents through their Web queries.

== See also ==

* [[Document classification]]

* [[Web search query]]

* [[Information retrieval]]

* [[Query expansion]]

* [[Naive Bayes classifier]]

* [[Support vector machines]]

* [[Meta search]]

* [[Vertical search]]

* [[Online advertising]]

== References ==

{{reflist}}

== Further reading ==

* Shen. [http://lbxml.ust.hk/th/th_search.pl?smode=VIEWBYCALLNUM&skeywords=CSED%202007%20Shen "Learning-based Web Query Understanding"]. ''Phd Thesis'', ''HKUST'', June 2007.

{{Internet search}}

* Beitzel. [http://ir.iit.edu/~steve/beitzel_phd_thesis.pdf "On Understanding and Classifying Web Queries"], ''Phd Thesis'', ''IIT'', May 2006.

== Notes ==

{{reflist}}

{{DEFAULTSORT:Web Query Classification}}

[[Category:Natural language processing]]

[[Category:ArtificialInformation intelligenceretrieval applicationstechniques]]

[[Category:DataInternet miningsearch]]

[[Category:Information retrieval]]

[[Category:World Wide Web]]

[[Category:Searching]]