7150 search results - page 1089 / 1430 » Graph-Based Data Mining |
132
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
109
Voted
ICDM
2006
IEEE
15 years 8 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 ...
108
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we examine a particular form of social network which we call a friendship-event network. A friendship-event network captures both the friendship relationship among ...
96
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
162
Voted
ICDM
2006
IEEE
15 years 8 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...