Sciweavers

98 search results - page 11 / 20
» Testing the Maximum Entropy Principle for Information Retrie...
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
PAMI
2006
143views more  PAMI 2006»
13 years 7 months ago
Variational Bayes for Continuous Hidden Markov Models and Its Application to Active Learning
In this paper we present a variational Bayes (VB) framework for learning continuous hidden Markov models (CHMMs), and we examine the VB framework within active learning. Unlike a ...
Shihao Ji, Balaji Krishnapuram, Lawrence Carin
ICASSP
2008
IEEE
14 years 1 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
ISCI
2007
142views more  ISCI 2007»
13 years 7 months ago
Semantic passage segmentation based on sentence topics for question answering
We propose a semantic passage segmentation method for a Question Answering (QA) system. We define a semantic passage as sentences grouped by semantic coherence, determined by the...
Hyo-Jung Oh, Sung-Hyon Myaeng, Myung-Gil Jang
CICLING
2010
Springer
13 years 11 months ago
Selecting the N-Top Retrieval Result Lists for an Effective Data Fusion
Although the application of data fusion in information retrieval has yielded good results in the majority of the cases, it has been noticed that its achievement is dependent on the...
Antonio Juárez-González, Manuel Mont...