Sciweavers

504 search results - page 77 / 101
» PCS: An Efficient Clustering Method for High-Dimensional Dat...
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
APVIS
2009
13 years 8 months ago
Optimized data transfer for time-dependent, GPU-based glyphs
Particle-based simulations are a popular tool for researchers in various sciences. In combination with the availability of ever larger COTS clusters and the consequently increasin...
Sebastian Grottel, Guido Reina, Thomas Ertl
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
PAKDD
2004
ACM
96views Data Mining» more  PAKDD 2004»
14 years 1 months ago
Spectral Energy Minimization for Semi-supervised Learning
The use of unlabeled data to aid classification is important as labeled data is often available in limited quantity. Instead of utilizing training samples directly into semi-super...
Chun Hung Li, Zhi-Li Wu
ALT
2003
Springer
13 years 11 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini