Sciweavers

4972 search results - page 581 / 995
» Ranking on graph data
Sort
View
CGF
2008
110views more  CGF 2008»
15 years 7 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
FGCS
2002
138views more  FGCS 2002»
15 years 6 months ago
Armada: a parallel I/O framework for computational grids
High-performance computing increasingly occurs on "computational grids" composed of heterogeneous and geographically distributed systems of computers, networks, and stor...
Ron Oldfield, David Kotz
ICDM
2010
IEEE
117views Data Mining» more  ICDM 2010»
15 years 4 months ago
Node Similarities from Spreading Activation
In this paper we propose two methods to derive two different kinds of node similarities in a network based on their neighborhood. The first similarity measure focuses on the overla...
Kilian Thiel, Michael R. Berthold
JMLR
2011
133views more  JMLR 2011»
15 years 1 months ago
Operator Norm Convergence of Spectral Clustering on Level Sets
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...
Bruno Pelletier, Pierre Pudlo
ML
2011
ACM
179views Machine Learning» more  ML 2011»
15 years 1 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...