Sciweavers

415 search results - page 51 / 83
» Bipolar Queries and Queries with Preferences
Sort
View
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 7 months ago
Interactive learning of node selecting tree transducer
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. ...
Julien Carme, Rémi Gilleron, Aurélie...
SEMWEB
2010
Springer
13 years 5 months ago
An Expressive and Efficient Solution to the Service Selection Problem
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...
Daniel Izquierdo, Maria-Esther Vidal, Blai Bonet
STOC
2009
ACM
102views Algorithms» more  STOC 2009»
14 years 8 months ago
Multiple intents re-ranking
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...
Yossi Azar, Iftah Gamzu, Xiaoxin Yin
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Mining long-term search history to improve search accuracy
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...
Bin Tan, Xuehua Shen, ChengXiang Zhai
SAC
2010
ACM
14 years 2 months ago
Applying taxonomic knowledge to Bayesian belief network for personalized search
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 ...
Jae-won Lee, Han-joon Kim, Sang-goo Lee