Sciweavers

165 search results - page 12 / 33
» Algorithms for Sparse Linear Classifiers in the Massive Data...
Sort
View
NIPS
2003
13 years 8 months ago
Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher, Jon...
JAIR
2006
110views more  JAIR 2006»
13 years 7 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
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 9 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
CVPR
2006
IEEE
14 years 9 months ago
Accelerated Kernel Feature Analysis
A fast algorithm, Accelerated Kernel Feature Analysis (AKFA), that discovers salient features evidenced in a sample of n unclassified patterns, is presented. Like earlier kernel-b...
Xianhua Jiang, Yuichi Motai, Robert R. Snapp, Xing...
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 8 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth