Sciweavers

1915 search results - page 21 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
KES
2005
Springer
14 years 1 months ago
A SVM Regression Based Approach to Filling in Missing Values
In KDD procedure, to fill in missing data typically requires a very large investment of time and energy - often 80% to 90% of a data analysis project is spent in making the data re...
Honghai Feng, Chen Guoshun, Yin Cheng, Bingru Yang...
IPMU
2010
Springer
13 years 6 months ago
Attribute Value Selection Considering the Minimum Description Length Approach and Feature Granularity
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Kemal Ince, Frank Klawonn
SDM
2008
SIAM
119views Data Mining» more  SDM 2008»
13 years 9 months ago
An Efficient Local Algorithm for Distributed Multivariate Regression in Peer-to-Peer Networks
This paper offers a local distributed algorithm for multivariate regression in large peer-to-peer environments. The algorithm is designed for distributed inferencing, data compact...
Kanishka Bhaduri, Hillol Kargupta
TKDE
2008
152views more  TKDE 2008»
13 years 7 months ago
SRDA: An Efficient Algorithm for Large-Scale Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features that preserves class separability. The projection functions of LDA are commonly obtained by max...
Deng Cai, Xiaofei He, Jiawei Han
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 9 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel