Sciweavers

1915 search results - page 171 / 383
» Computing LTS Regression for Large Data Sets
Sort
View
CSDA
2008
158views more  CSDA 2008»
15 years 4 months ago
Outlier identification in high dimensions
A computationally fast procedure for identifying outliers is presented, that is particularly effective in high dimensions. This algorithm utilizes simple properties of principal c...
Peter Filzmoser, Ricardo A. Maronna, Mark Werner
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 8 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
16 years 4 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
CSDA
2004
124views more  CSDA 2004»
15 years 3 months ago
Fast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the k...
Mia Hubert, Katrien van Driessen
CIS
2005
Springer
15 years 9 months ago
An Improved EMASK Algorithm for Privacy-Preserving Frequent Pattern Mining
Abstract. As a novel research direction, privacy-preserving data mining (PPDM) has received a great deal of attentions from more and more researchers, and a large number of PPDM al...
Congfu Xu, Jinlong Wang, Hongwei Dan, Yunhe Pan