51 search results - page 2 / 11 » Clustering by weighted cuts in directed graphs |
DIS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Clustering algorithms based on a matrix of pairwise similarities (kernel matrix) for the data are widely known and used, a particularly popular class being spectral clust...
KDD
2004
ACM
14 years 6 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...
STOC
2007
ACM
14 years 6 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
WEBI
2005
Springer
13 years 11 months ago
2005
Springer
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
KDD
2005
ACM
14 years 6 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...