Sciweavers

368 search results - page 48 / 74
» Probabilistic Modeling for Information Retrieval with Unsupe...
Sort
View
WSDM
2010
ACM
210views Data Mining» more  WSDM 2010»
14 years 5 months ago
Towards Recency Ranking in Web Search
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...
Anlei Dong, Yi Chang, Zhaohui Zheng, Gilad Mishne,...
NIPS
2004
13 years 9 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
SIGIR
2010
ACM
13 years 11 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
CIKM
2009
Springer
14 years 2 months ago
Automatic link detection: a sequence labeling approach
The popularity of Wikipedia and other online knowledge bases has recently produced an interest in the machine learning community for the problem of automatic linking. Automatic hy...
James J. Gardner, Li Xiong
ECIR
2009
Springer
14 years 4 months ago
Joint Ranking for Multilingual Web Search
Ranking for multilingual information retrieval (MLIR) is a task to rank documents of different languages solely based on their relevancy to the query regardless of query’s langu...
Wei Gao, Cheng Niu, Ming Zhou, Kam-Fai Wong