Sciweavers

695 search results - page 56 / 139
» Efficient Algorithms for General Active Learning
Sort
View
ICML
2008
IEEE
14 years 9 months ago
Modeling interleaved hidden processes
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
Niels Landwehr
SIGIR
2009
ACM
14 years 3 months ago
The importance of manual assessment in link discovery
Using a ground truth extracted from the Wikipedia, and a ground truth created through manual assessment, we show that the apparent performance advantage seen in machine learning a...
Darren Wei Che Huang, Andrew Trotman, Shlomo Geva
ICCV
2001
IEEE
14 years 10 months ago
Human Tracking with Mixtures of Trees
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
Sergey Ioffe, David A. Forsyth
KDD
2005
ACM
143views Data Mining» more  KDD 2005»
14 years 9 months ago
SVM selective sampling for ranking with application to data retrieval
Learning ranking (or preference) functions has been a major issue in the machine learning community and has produced many applications in information retrieval. SVMs (Support Vect...
Hwanjo Yu
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 9 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...