Sciweavers

160 search results - page 5 / 32
» The Application Research of High-dimensional Mixed-attribute...
Sort
View
ICDE
2008
IEEE
150views Database» more  ICDE 2008»
14 years 8 months ago
On the Anonymization of Sparse High-Dimensional Data
Abstract-- Existing research on privacy-preserving data publishing focuses on relational data: in this context, the objective is to enforce privacy-preserving paradigms, such as ka...
Gabriel Ghinita, Yufei Tao, Panos Kalnis
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 10 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
EDBT
2000
ACM
13 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
ICDE
2012
IEEE
208views Database» more  ICDE 2012»
11 years 9 months ago
Discovering Multiple Clustering Solutions: Grouping Objects in Different Views of the Data
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...
Emmanuel Müller, Stephan Günnemann, Ines...