641 search results - page 11 / 129 » Collusion set detection using graph clustering |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
CVPR
2011
IEEE
13 years 10 days ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
HT
2003
ACM
14 years 1 months ago
2003
ACM
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Detecting the time of occurrence of an acoustic event (for instance, a cheer) embedded in a longer soundtrack is useful and important for applications such as search and retrieval...
COLT
2004
Springer
14 years 2 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...