Sciweavers

641 search results - page 9 / 129
» Collusion set detection using graph clustering
Sort
View
AAAI
2006
13 years 10 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
PAMI
2007
113views more  PAMI 2007»
13 years 8 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
IWDW
2004
Springer
14 years 1 months ago
Fingerprinting Curves
This paper presents a new method for robust data hiding in curves and highlights potential applications including digital fingerprinting of map document for trace and track purpos...
Hongmei Gou, Min Wu
NIPS
2003
13 years 10 months ago
Denoising and Untangling Graphs Using Degree Priors
This paper addresses the problem of untangling hidden graphs from a set of noisy detections of undirected edges. We present a model of the generation of the observed graph that in...
Quaid Morris, Brendan J. Frey
WWW
2010
ACM
14 years 3 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney