Sciweavers

3068 search results - page 226 / 614
» Clustering with Multiple Graphs
Sort
View
PC
2008
111views Management» more  PC 2008»
15 years 5 months ago
A partitioning algorithm for block-diagonal matrices with overlap
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
Guy Antoine Atenekeng Kahou, Laura Grigori, Masha ...
159
Voted
ACISICIS
2007
IEEE
15 years 11 months ago
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...
Gerhard Visser, David L. Dowe
TREC
2008
15 years 6 months ago
Weighted PageRank: Cluster-Related Weights
PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting ...
Danil Nemirovsky, Konstantin Avrachenkov
COLING
2010
15 years 11 days ago
A Global Relaxation Labeling Approach to Coreference Resolution
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based grap...
Emili Sapena, Lluís Padró, Jordi Tur...
CVPR
2004
IEEE
16 years 7 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma