2227 search results - page 52 / 446 » Graph Mining based on a Data Partitioning Approach |
115
click to vote
KDD
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
126
Voted
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it...
107
Voted
KDD
2004
ACM
16 years 28 days ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
164
Voted
WSDM
2012
ACM
13 years 8 months ago
2012
ACM
A key element of the social networks on the internet such as Facebook and Flickr is that they encourage users to create connections between themselves, other users and objects. On...
WSDM
2009
ACM
15 years 7 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...