Sciweavers

180 search results - page 36 / 36
» Active Learning for Class Probability Estimation and Ranking
Sort
View
AIRS
2009
Springer
14 years 2 days ago
A Latent Dirichlet Framework for Relevance Modeling
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
Viet Ha-Thuc, Padmini Srinivasan
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
13 years 11 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
CVPR
2010
IEEE
13 years 5 months ago
Label propagation in video sequences
This paper proposes a probabilistic graphical model for the problem of propagating labels in video sequences, also termed the label propagation problem. Given a limited amount of ...
Vijay Badrinarayanan, Fabio Galasso, Roberto Cipol...
COR
2008
122views more  COR 2008»
13 years 5 months ago
First steps to the runtime complexity analysis of ant colony optimization
: The paper presents results on the runtime complexity of two ant colony optimization (ACO) algorithms: Ant System, the oldest ACO variant, and GBAS, the first ACO variant for whic...
Walter J. Gutjahr
JMLR
2010
146views more  JMLR 2010»
13 years 8 days ago
Accurate Ensembles for Data Streams: Combining Restricted Hoeffding Trees using Stacking
The success of simple methods for classification shows that is is often not necessary to model complex attribute interactions to obtain good classification accuracy on practical p...
Albert Bifet, Eibe Frank, Geoffrey Holmes, Bernhar...