Sciweavers

368 search results - page 36 / 74
» Probabilistic Modeling for Information Retrieval with Unsupe...
Sort
View
AAAI
1990
13 years 9 months ago
Constructor: A System for the Induction of Probabilistic Models
The probabilistic network technology is a knowledgebased technique which focuses on reasoning under uncertainty. Because of its well defined semantics and solid theoretical founda...
Robert M. Fung, Stuart L. Crawford
SIGIR
2006
ACM
14 years 1 months ago
Learning a ranking from pairwise preferences
We introduce a novel approach to combining rankings from multiple retrieval systems. We use a logistic regression model or an SVM to learn a ranking from pairwise document prefere...
Ben Carterette, Desislava Petkova
MM
2004
ACM
248views Multimedia» more  MM 2004»
14 years 1 months ago
Incremental semi-supervised subspace learning for image retrieval
Subspace learning techniques are widespread in pattern recognition research. They include Principal Component Analysis (PCA), Locality Preserving Projection (LPP), etc. These tech...
Xiaofei He
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
Algorithms for incorporating prior topological information in HMMs: application to transmembrane proteins
Background: Hidden Markov Models (HMMs) have been extensively used in computational molecular biology, for modelling protein and nucleic acid sequences. In many applications, such...
Pantelis G. Bagos, Theodore D. Liakopoulos, Stavro...
CIKM
2011
Springer
12 years 7 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke