Sciweavers

848 search results - page 86 / 170
» Transductive Learning from Relational Data
Sort
View
DEBU
2000
101views more  DEBU 2000»
13 years 8 months ago
Learning to Understand the Web
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
William W. Cohen, Andrew McCallum, Dallan Quass
JMLR
2007
87views more  JMLR 2007»
13 years 8 months ago
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
We show that, given data from a mixture of k well-separated spherical Gaussians in Rd, a simple two-round variant of EM will, with high probability, learn the parameters of the Ga...
Sanjoy Dasgupta, Leonard J. Schulman
PAA
2002
13 years 8 months ago
Hierarchical Fusion of Multiple Classifiers for Hyperspectral Data Analysis
: Many classification problems involve high dimensional inputs and a large number of classes. Multiclassifier fusion approaches to such difficult problems typically centre around s...
Shailesh Kumar, Joydeep Ghosh, Melba M. Crawford
JAIR
2006
110views more  JAIR 2006»
13 years 8 months ago
Domain Adaptation for Statistical Classifiers
The most basic assumption used in statistical learning theory is that training data and test data are drawn from the same underlying distribution. Unfortunately, in many applicati...
Hal Daumé III, Daniel Marcu
CORR
2002
Springer
180views Education» more  CORR 2002»
13 years 8 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer