961 search results - page 116 / 193 » Significance-Driven Graph Clustering |
156
click to vote
NIPS
2008
15 years 6 months ago
2008
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
127
click to vote
EOR
2010
15 years 4 months ago
2010
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
177
click to vote
AI
2006
Springer
15 years 4 months ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
125
click to vote
IJCV
2007
15 years 4 months ago
2007
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...