4009 search results - page 23 / 802 » Clustering on Complex Graphs |
ACISICIS
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
CIAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
LAWEB
2003
IEEE
14 years 1 months ago
2003
IEEE
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We study line systems in metric spaces induced by graphs. A line is a subset of vertices defined by a relation of betweeness. We show that the class of all graphs having exactly k ...
DATAMINE
2007
13 years 8 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...