2651 search results - page 236 / 531 » Mining Diversity on Networks |
206
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we propose a new class of attacks that exploit advertising systems offering microtargeting capabilities in order to breach user privacy. We study the advertising syst...
151
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within...
205
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
201
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
195
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...