376 search results - page 24 / 76 » Completely connected clustered graphs |
COLT
2003
Springer
15 years 5 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
104
click to vote
ECML
2004
Springer
15 years 5 months ago
2004
Springer
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
IJCAI
2007
15 years 1 months ago
2007
Effective representation of Web search results remains an open problem in the Information Retrieval community. For ambiguous queries, a traditional approach is to organize search ...
123
click to vote
TKDE
2012
13 years 2 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
JMLR
2011
14 years 6 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...