3068 search results - page 60 / 614 » Clustering with Multiple Graphs |
174
click to vote
ICTAI
2006
IEEE
16 years 1 days ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
180
click to vote
PAKDD
2007
ACM
16 years 3 days ago
2007
ACM
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
155
click to vote
PAKDD
2004
ACM
15 years 11 months ago
2004
ACM
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known minmax clustering principle. Compar...
166
click to vote
ICDM
2008
IEEE
16 years 13 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
176
click to vote
ICPR
2008
IEEE
16 years 13 days ago
2008
IEEE
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...