Sciweavers

7913 search results - page 390 / 1583
» Information Collection on a Graph
Sort
View
WSDM
2009
ACM
125views Data Mining» more  WSDM 2009»
15 years 11 months ago
Less is more: sampling the neighborhood graph makes SALSA better and faster
In this paper, we attempt to improve the effectiveness and the efficiency of query-dependent link-based ranking algorithms such as HITS, MAX and SALSA. All these ranking algorith...
Marc Najork, Sreenivas Gollapudi, Rina Panigrahy
155
Voted
KI
2005
Springer
15 years 10 months ago
Temporalizing Spatial Calculi: On Generalized Neighborhood Graphs
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can chang...
Marco Ragni, Stefan Wölfl
SPIRE
2005
Springer
15 years 10 months ago
A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison
Abstract. We introduce a new data structure, called MiGaL for “Multiple Graph Layers”, that is composed of various graphs linked together ions of abstraction/refinement. The n...
Julien Allali, Marie-France Sagot
IDA
2007
Springer
15 years 4 months ago
Anomaly detection in data represented as graphs
An important area of data mining is anomaly detection, particularly for fraud. However, little work has been done in terms of detecting anomalies in data that is represented as a g...
William Eberle, Lawrence B. Holder
APVIS
2011
14 years 4 months ago
Multilevel agglomerative edge bundling for visualizing large graphs
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
Emden R. Gansner, Yifan Hu, Stephen C. North, Carl...