Sciweavers

1351 search results - page 45 / 271
» Learning from compressed observations
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
15 years 10 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
PERCOM
2007
ACM
15 years 9 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
15 years 10 months ago
Active exploration for learning rankings from clickthrough data
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
Filip Radlinski, Thorsten Joachims
EMNLP
2008
14 years 11 months ago
Acquiring Domain-Specific Dialog Information from Task-Oriented Human-Human Interaction through an Unsupervised Learning
We describe an approach for acquiring the domain-specific dialog knowledge required to configure a task-oriented dialog system that uses human-human interaction data. The key aspe...
Ananlada Chotimongkol, Alexander I. Rudnicky
IDA
2003
Springer
15 years 3 months ago
Learning Dynamic Bayesian Networks from Multivariate Time Series with Changing Dependencies
Abstract. Many examples exist of multivariate time series where dependencies between variables change over time. If these changing dependencies are not taken into account, any mode...
Allan Tucker, Xiaohui Liu