Sciweavers

743 search results - page 97 / 149
» Performance Measurements for Privacy Preserving Data Mining
Sort
View
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 5 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 7 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
KDD
2010
ACM
249views Data Mining» more  KDD 2010»
15 years 6 months ago
Semi-supervised sparse metric learning using alternating linearization optimization
In plenty of scenarios, data can be represented as vectors mathematically abstracted as points in a Euclidean space. Because a great number of machine learning and data mining app...
Wei Liu, Shiqian Ma, Dacheng Tao, Jianzhuang Liu, ...
PAMI
2006
141views more  PAMI 2006»
15 years 4 months ago
Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameter
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
Stéphane Lafon, Ann B. Lee
PODS
2008
ACM
159views Database» more  PODS 2008»
16 years 4 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor