Sciweavers

475 search results - page 25 / 95
» A Distance-Based Packing Method for High Dimensional Data
Sort
View
NIPS
2008
13 years 9 months ago
Diffeomorphic Dimensionality Reduction
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
Christian Walder, Bernhard Schölkopf
ICDE
2007
IEEE
165views Database» more  ICDE 2007»
14 years 9 months ago
On Randomization, Public Information and the Curse of Dimensionality
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
Charu C. Aggarwal
PKDD
2005
Springer
101views Data Mining» more  PKDD 2005»
14 years 1 months ago
A Random Method for Quantifying Changing Distributions in Data Streams
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
Haixun Wang, Jian Pei
ICWS
2008
IEEE
13 years 9 months ago
High-Performance XML Parsing and Validation with Permutation Phrase Grammar Parsers
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
Wei Zhang, Robert A. van Engelen
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 1 months 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