961 search results - page 52 / 193 » Significance-Driven Graph Clustering |
106
click to vote
ICPP
2009
IEEE
15 years 7 months ago
2009
IEEE
Providing continuous on-demand streaming services with VCR functionality over ubiquitous environments is challenging due to the stringent QoS requirements of streaming service as ...
114
Voted
ECML
2004
Springer
15 years 6 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...
97
Voted
IFIP12
2007
15 years 2 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
ALT
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
101
Voted
WG
2007
Springer
15 years 6 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...