415 search results - page 51 / 83 » Bipolar Queries and Queries with Preferences |
ML
2007
ACM
15 years 1 days ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
114
Voted
SEMWEB
2010
Springer
14 years 10 months ago
2010
Springer
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
81
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...
104
click to vote
KDD
2006
ACM
16 years 28 days ago
2006
ACM
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
90
Voted
SAC
2010
ACM
15 years 7 months ago
2010
ACM
Keyword-based search returns its results without concern for the information needs of users at a particular time. In general, search queries are too short to represent what users ...