Sciweavers

146 search results - page 24 / 30
» Recurrent Subgraph Prediction
Sort
View
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
IPPS
2007
IEEE
14 years 3 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
METRICS
1999
IEEE
14 years 1 months ago
Measuring Coupling and Cohesion: An Information-Theory Approach
The design of software is often depicted by graphs that show components and their relationships. For example, a structure chart shows the calling relationships among components. O...
Edward B. Allen, Taghi M. Khoshgoftaar
DILS
2006
Springer
14 years 1 months ago
Link Discovery in Graphs Derived from Biological Databases
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Ki...
JMLR
2006
125views more  JMLR 2006»
13 years 9 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer