Evaluating query classification algorithms.
Query clustering and query classification aim to capture the intended meaning of queries in order to improve the efficiency of search engines. This research explored the relationship between the query clustering and the query classification approaches and proposed new query classification approache...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/41517 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-41517 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-415172019-12-10T13:07:12Z Evaluating query classification algorithms. Tran Hanh. Goh Hoe Lian, Dion Wee Kim Wee School of Communication and Information DRNTU::Library and information science::Libraries::Information retrieval and analysis Query clustering and query classification aim to capture the intended meaning of queries in order to improve the efficiency of search engines. This research explored the relationship between the query clustering and the query classification approaches and proposed new query classification approaches named Single Learning and Iterative Learning. The intuition of the Single Learning approach is that given a set of queries categorized under a subject, the subject then can be defined as a cluster of queries. The query cluster gives the semantic description for the subject. If a query Q is similar to a cluster of queries categorized under a subject S, then the query Q can be categorized under the subject S. The Single Learning approach makes use of the Web as a knowledge base to build up the term-weight vectors representing the queries. The subject can then be represented by the query cluster-centroid vector. The similarity SIM (S,Q) between the query cluster S and the query Q is computed and compared to a threshold Teta. If SIM(S,Q) >= Teta then the query Q is categorized under the subject S with the degree of Teta. Master of Science (Information Systems) 2010-07-16T03:48:07Z 2010-07-16T03:48:07Z 2008 2008 Thesis http://hdl.handle.net/10356/41517 en Nanyang Technological University 115 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Library and information science::Libraries::Information retrieval and analysis |
spellingShingle |
DRNTU::Library and information science::Libraries::Information retrieval and analysis Tran Hanh. Evaluating query classification algorithms. |
description |
Query clustering and query classification aim to capture the intended meaning of queries in order to improve the efficiency of search engines. This research explored the relationship between the query
clustering and the query classification approaches and proposed new query classification approaches named Single Learning and Iterative Learning. The intuition of the Single Learning approach is that given a set of queries categorized under a subject, the subject then can be defined as a cluster of queries. The
query cluster gives the semantic description for the subject. If a query Q is similar to a cluster of queries categorized under a subject S, then the query Q can be categorized under the subject S. The Single
Learning approach makes use of the Web as a knowledge base to build up the term-weight vectors representing the queries. The subject can then be represented by the query cluster-centroid vector. The
similarity SIM (S,Q) between the query cluster S and the query Q is computed and compared to a threshold Teta. If SIM(S,Q) >= Teta then the query Q is categorized under the subject S with the degree of Teta. |
author2 |
Goh Hoe Lian, Dion |
author_facet |
Goh Hoe Lian, Dion Tran Hanh. |
format |
Theses and Dissertations |
author |
Tran Hanh. |
author_sort |
Tran Hanh. |
title |
Evaluating query classification algorithms. |
title_short |
Evaluating query classification algorithms. |
title_full |
Evaluating query classification algorithms. |
title_fullStr |
Evaluating query classification algorithms. |
title_full_unstemmed |
Evaluating query classification algorithms. |
title_sort |
evaluating query classification algorithms. |
publishDate |
2010 |
url |
http://hdl.handle.net/10356/41517 |
_version_ |
1681041601333297152 |