Sciweavers

77 search results - page 4 / 16
» On the Anonymization of Sparse High-Dimensional Data
Sort
View
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 6 days ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
ICCS
2003
Springer
13 years 12 months ago
Parallelisation of Sparse Grids for Large Scale Data Analysis
Sparse Grids are the basis for efficient high dimensional approximation and have recently been applied successfully to predictive modelling. They are spanned by a collection of si...
Jochen Garcke, Markus Hegland, Ole Møller N...
DMIN
2009
185views Data Mining» more  DMIN 2009»
13 years 4 months ago
A Sparse Coding Based Similarity Measure
In high dimensional data sets not all dimensions contain an equal amount of information and most of the time global features are more important than local differences. This makes ...
Sebastian Klenk, Gunther Heidemann
JMLR
2008
133views more  JMLR 2008»
13 years 6 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
ITCC
2005
IEEE
14 years 9 days ago
A Scalable Generative Topographic Mapping for Sparse Data Sequences
We propose a novel, computationally efficient generative topographic model for inferring low dimensional representations of high dimensional data sets, designed to exploit data s...
Ata Kabán