Sciweavers

694 search results - page 36 / 139
» On the Dimensions of Data Complexity through Synthetic Data ...
Sort
View
ICIP
2006
IEEE
14 years 10 months ago
Lossy-To-Lossless Block-Based Compression of Hyperspectral Volumetric Data
An embedded, block-based, wavelet transform coding algorithm of low complexity is proposed. Three-Dimensional Set Partitioned Embedded bloCK(3D-SPECK) efficiently encodes hyperspe...
Xiaoli Tang, William A. Pearlman
PVLDB
2008
107views more  PVLDB 2008»
13 years 7 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu
COMPGEOM
2008
ACM
13 years 10 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
JDWM
2008
120views more  JDWM 2008»
13 years 8 months ago
Algebraic and Graphic Languages for OLAP Manipulations
This article deals with multidimensional analyses. Analyzed data are designed according to a conceptual model as a constellation of facts and dimensions, which are composed of mul...
Franck Ravat, Olivier Teste, Ronan Tournier, Gille...
JMLR
2010
99views more  JMLR 2010»
13 years 3 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko