A novel two-box search paradigm for query disambiguation
Precision-oriented search results such as those typically returned by the major search engines are vulnerable to issues of polysemy. When the same term refers to different things, the dominant sense is preferred in the rankings of search results. In this paper, we propose a novel two-box technique i...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/106114 http://hdl.handle.net/10220/17117 |
| _version_ | 1826117685844377600 |
|---|---|
| author | Jiang, Xing Karypis, George Anastasiu, David C. Gao, Byron J. |
| author2 | School of Computer Engineering |
| author_facet | School of Computer Engineering Jiang, Xing Karypis, George Anastasiu, David C. Gao, Byron J. |
| author_sort | Jiang, Xing |
| collection | NTU |
| description | Precision-oriented search results such as those typically returned by the major search engines are vulnerable to issues of polysemy. When the same term refers to different things, the dominant sense is preferred in the rankings of search results. In this paper, we propose a novel two-box technique in the context of Web search that utilizes contextual terms provided by users for query disambiguation, making it possible to prefer other senses without altering the original query. A prototype system, Bobo, has been implemented. In Bobo, contextual terms are used to capture domain knowledge from users, help estimate relevance of search results, and route them towards a user-intended domain. A vast advantage of Bobo is that a wide range of domain knowledge can be effectively utilized, where helpful contextual terms do not even need to co-occur with query terms on any page. We have extensively evaluated the performance of Bobo on benchmark datasets that demonstrates the utility and effectiveness of our approach. |
| first_indexed | 2024-10-01T04:31:22Z |
| format | Journal Article |
| id | ntu-10356/106114 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:31:22Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/1061142020-05-28T07:18:20Z A novel two-box search paradigm for query disambiguation Jiang, Xing Karypis, George Anastasiu, David C. Gao, Byron J. School of Computer Engineering DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity Precision-oriented search results such as those typically returned by the major search engines are vulnerable to issues of polysemy. When the same term refers to different things, the dominant sense is preferred in the rankings of search results. In this paper, we propose a novel two-box technique in the context of Web search that utilizes contextual terms provided by users for query disambiguation, making it possible to prefer other senses without altering the original query. A prototype system, Bobo, has been implemented. In Bobo, contextual terms are used to capture domain knowledge from users, help estimate relevance of search results, and route them towards a user-intended domain. A vast advantage of Bobo is that a wide range of domain knowledge can be effectively utilized, where helpful contextual terms do not even need to co-occur with query terms on any page. We have extensively evaluated the performance of Bobo on benchmark datasets that demonstrates the utility and effectiveness of our approach. 2013-10-31T03:59:14Z 2019-12-06T22:04:49Z 2013-10-31T03:59:14Z 2019-12-06T22:04:49Z 2013 2013 Journal Article Anastasiu, D. C., Gao, B. J., Jiang, X., & Karypis, G. (2013). A novel two-box search paradigm for query disambiguation. World wide web, 16(1), 1-29. https://hdl.handle.net/10356/106114 http://hdl.handle.net/10220/17117 10.1007/s11280-011-0154-0 en World wide web |
| spellingShingle | DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity Jiang, Xing Karypis, George Anastasiu, David C. Gao, Byron J. A novel two-box search paradigm for query disambiguation |
| title | A novel two-box search paradigm for query disambiguation |
| title_full | A novel two-box search paradigm for query disambiguation |
| title_fullStr | A novel two-box search paradigm for query disambiguation |
| title_full_unstemmed | A novel two-box search paradigm for query disambiguation |
| title_short | A novel two-box search paradigm for query disambiguation |
| title_sort | novel two box search paradigm for query disambiguation |
| topic | DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity |
| url | https://hdl.handle.net/10356/106114 http://hdl.handle.net/10220/17117 |
| work_keys_str_mv | AT jiangxing anoveltwoboxsearchparadigmforquerydisambiguation AT karypisgeorge anoveltwoboxsearchparadigmforquerydisambiguation AT anastasiudavidc anoveltwoboxsearchparadigmforquerydisambiguation AT gaobyronj anoveltwoboxsearchparadigmforquerydisambiguation AT jiangxing noveltwoboxsearchparadigmforquerydisambiguation AT karypisgeorge noveltwoboxsearchparadigmforquerydisambiguation AT anastasiudavidc noveltwoboxsearchparadigmforquerydisambiguation AT gaobyronj noveltwoboxsearchparadigmforquerydisambiguation |