Sciweavers

1915 search results - page 100 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
JMLR
2010
104views more  JMLR 2010»
13 years 4 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
13 years 10 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ICDE
2012
IEEE
223views Database» more  ICDE 2012»
11 years 11 months ago
Incremental Detection of Inconsistencies in Distributed Data
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...
Wenfei Fan, Jianzhong Li, Nan Tang, Wenyuan Yu
ICMLA
2010
13 years 7 months ago
Smoothing Gene Expression Using Biological Networks
Gene expression (microarray) data have been used widely in bioinformatics. The expression data of a large number of genes from small numbers of subjects are used to identify inform...
Yue Fan, Mark A. Kon, Shinuk Kim, Charles DeLisi
EOR
2007
165views more  EOR 2007»
13 years 9 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang