Sciweavers

475 search results - page 70 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
14 years 2 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
ECAI
2004
Springer
14 years 29 days ago
Towards Efficient Learning of Neural Network Ensembles from Arbitrarily Large Datasets
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
Kang Peng, Zoran Obradovic, Slobodan Vucetic
CVPR
2010
IEEE
14 years 3 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
CIVR
2003
Springer
269views Image Analysis» more  CIVR 2003»
14 years 24 days ago
HPAT Indexing for Fast Object/Scene Recognition Based on Local Appearance
Abstract. The paper describes a fast system for appearance based image recognition . It uses local invariant descriptors and efficient nearest neighbor search. First, local affine ...
Hao Shao, Tomás Svoboda, Tinne Tuytelaars, ...