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...
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. ...
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...
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...
—Traditional clustering algorithms identify just a single clustering of the data. Today’s complex data, however, allow multiple interpretations leading to several valid groupin...