Sciweavers

46 search results - page 6 / 10
» A Discovery Algorithm for Directed Cyclic Graphs
Sort
View
COCOA
2011
Springer
13 years 9 months ago
Algorithmic Aspects of Heterogeneous Biological Networks Comparison
Biological networks are commonly used to model molecular activity within the cell. Recent experimental studies have shown that the detection of conserved subnetworks across several...
Guillaume Blin, Guillaume Fertin, Hafedh Mohamed-B...
CEC
2007
IEEE
15 years 3 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
15 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
SAC
2005
ACM
15 years 3 months ago
Mining concept associations for knowledge discovery in large textual databases
In this paper, we describe a new approach for mining concept associations from large text collections. The concepts are short sequences of words that occur frequently together acr...
Xiaowei Xu, Mutlu Mete, Nurcan Yuruk
CCCG
2008
14 years 11 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia