Name
Abstract | ||
|---|---|---|
Users often find it difficult to build suitable Web search queries even if they can explain the target of their search. In this situation, users must create complex queries using Boolean search operators such as “AND” and “NOT” by trial and error. However, complex queries often narrow down search results to a great extent. Therefore, we consider that users would like to replace their queries with simple queries that can retrieve the same target as complex queries. In this paper, we propose an integration method for complex queries based on hyponymy relations. We retrieve the same target as a complex query using a keyword that represents a narrower concept of one of the keywords in a complex query. Using this method, users can use understandable, simple queries and obtain many Web search results that have the same target as the complex query. |
Year | Venue | Field |
|---|---|---|
2015 | DEXA | Data mining,Trial and error,Information retrieval,Web page clustering,Computer science,Boolean algebra,Operator (computer programming) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daisuke Kitayama | 1 | 60 | 19.42 |
| Takuma Matsumoto | 2 | 1 | 0.75 |