Sciweavers

103 search results - page 8 / 21
» Comparing Massive High-Dimensional Data Sets
Sort
View
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
O-IPCAC and its Application to EEG Classification
In this paper we describe an online/incremental linear binary classifier based on an interesting approach to estimate the Fisher subspace. The proposed method allows to deal with ...
Alessandro Rozza, Gabriele Lombardi, Marco Rosa, E...
CIKM
2003
Springer
14 years 16 days ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 4 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
BMVC
2010
13 years 5 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
CAIP
1997
Springer
125views Image Analysis» more  CAIP 1997»
13 years 11 months ago
An Algorithm for Intrinsic Dimensionality Estimation
Abstract. In this paper a new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is...
Jörg Bruske, Gerald Sommer