Sciweavers

135 search results - page 18 / 27
» VIF Regression: A Fast Regression Algorithm for Large Data
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Online Ranking/Collaborative Filtering Using the Perceptron Algorithm
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
Edward F. Harrington
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
14 years 1 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
ICDM
2010
IEEE
127views Data Mining» more  ICDM 2010»
13 years 5 months ago
Learning Markov Network Structure with Decision Trees
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
Daniel Lowd, Jesse Davis
TIP
2008
113views more  TIP 2008»
13 years 7 months ago
Phase Local Approximation (PhaseLa) Technique for Phase Unwrap From Noisy Data
The local polynomial approximation (LPA) is a nonparametric regression technique with pointwise estimation in a sliding window. We apply the LPA of the argument of cos and sin in o...
Vladimir Katkovnik, Jaakko Astola, Karen O. Egiaza...
JMLR
2006
85views more  JMLR 2006»
13 years 7 months ago
Streamwise Feature Selection
In streamwise feature selection, new features are sequentially considered for addition to a predictive model. When the space of potential features is large, streamwise feature sel...
Jing Zhou, Dean P. Foster, Robert A. Stine, Lyle H...