28 search results - page 4 / 6 » Clustering graphs by weighted substructure mining |
KDD
2005
ACM
14 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...
ICDM
2002
IEEE
14 years 10 days ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
SDM
2009
SIAM
14 years 4 months ago
2009
SIAM
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...