Users who need several queries before finding what they need can benefit from an automatic search assistant that provides feedback on their query modification strategies. We present a method to learn from a search log which types of query modifications have and have not been effective in the past. The method analyses query modifications along two dimen-sions: a traditional term-based dimension and a semantic di-mension, for which queries are enriches with linked data en-tities. Applying the method to the search logs of two search engines, we identify six opportunities for a query modifi-cation assistant to improve search: modification strategies that are commonly used, but that often do not lead to sat-isfactory results. 1
Information overload has led to a situation where users are swamped with too much information, resul...
Abstract. Query recommendation suggests related queries for search engine users when they are not sa...
This paper describes an algorithm whereby an initial, naive user query to a search engine can be sub...
Modern search engines have been moving away from simplistic interfaces that aimed at satisfying a us...
Although interactive query reformulation has been actively studied in the laboratory, little is know...
Although interactive query reformulation has been actively studied in the laboratory, little is know...
We present a method that exploits `linked data' to determine semantic relations between consecutive ...
Web search query logs contain traces of users ’ search modifications. One strategy users employ is d...
Abstract. Searchers ’ difficulty in formulating effective queries for their information needs is wel...
An important application of semantic web technology is recognizing human-defined concepts in text. Q...
Existing methods for automatically analyzing search logs describe search behavior on the basis of sy...
A search engine retrieves the documents based on the query submitted to it. However, incorporation o...
This paper examines patterns and features of query reformulation within a Web searching session. We ...
This poster investigates a novel query suggestion technique that selects query refinements through a...
An important way to improve users ’ satisfaction in Web search is to assist them to issue more effec...
Information overload has led to a situation where users are swamped with too much information, resul...
Abstract. Query recommendation suggests related queries for search engine users when they are not sa...
This paper describes an algorithm whereby an initial, naive user query to a search engine can be sub...
Modern search engines have been moving away from simplistic interfaces that aimed at satisfying a us...
Although interactive query reformulation has been actively studied in the laboratory, little is know...
Although interactive query reformulation has been actively studied in the laboratory, little is know...
We present a method that exploits `linked data' to determine semantic relations between consecutive ...
Web search query logs contain traces of users ’ search modifications. One strategy users employ is d...
Abstract. Searchers ’ difficulty in formulating effective queries for their information needs is wel...
An important application of semantic web technology is recognizing human-defined concepts in text. Q...
Existing methods for automatically analyzing search logs describe search behavior on the basis of sy...
A search engine retrieves the documents based on the query submitted to it. However, incorporation o...
This paper examines patterns and features of query reformulation within a Web searching session. We ...
This poster investigates a novel query suggestion technique that selects query refinements through a...
An important way to improve users ’ satisfaction in Web search is to assist them to issue more effec...
Information overload has led to a situation where users are swamped with too much information, resul...
Abstract. Query recommendation suggests related queries for search engine users when they are not sa...
This paper describes an algorithm whereby an initial, naive user query to a search engine can be sub...