Sciweavers

1039 search results - page 4 / 208
» Query reformulation with constraints
Sort
View
IPM
2006
144views more  IPM 2006»
13 years 7 months ago
Analysis of multiple query reformulations on the web: The interactive information retrieval context
This study examines the facets and patterns of multiple Web query reformulations with a focus on reformulation sequences. Based on IR interaction models, it was presumed that quer...
Soo Young Rieh, Hong Iris Xie
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
CP
2008
Springer
13 years 9 months ago
Reformulating Positive Table Constraints Using Functional Dependencies
Constraints that are defined by tables of allowed tuples of assignments are common in constraint programming. In this paper we present an approach to reformulating table constraint...
Hadrien Cambazard, Barry O'Sullivan
DKE
2006
68views more  DKE 2006»
13 years 7 months ago
Reformulating XPath queries and XSLT queries on XSLT views
Sven Groppe, Stefan Böttcher, Georg Birkenheu...
WEBI
2009
Springer
14 years 1 months ago
From "Dango" to "Japanese Cakes": Query Reformulation Models and Patterns
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, Se...