446 search results - page 76 / 90 » Randomization in Privacy-Preserving Data Mining |
SISAP
2008
IEEE
14 years 4 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper addresses the issue of extraction of an academic researcher social network. By researcher social network extraction, we are aimed at finding, extracting, and fusing the...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Text clustering is most commonly treated as a fully automated task without user supervision. However, we can improve clustering performance using supervision in the form of pairwi...
ICDM
2006
IEEE
14 years 4 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors ...