Sciweavers

1756 search results - page 78 / 352
» Directed scale-free graphs
Sort
View
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
ICML
2008
IEEE
14 years 8 months ago
The skew spectrum of graphs
The central issue in representing graphstructured data instances in learning algorithms is designing features which are invariant to permuting the numbering of the vertices. We pr...
Risi Imre Kondor, Karsten M. Borgwardt
SEMWEB
2004
Springer
14 years 1 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
IMECS
2007
13 years 9 months ago
Using Background Knowledge for Graph Based Learning: A Case Study in Chemoinformatics
The benefit of incorporating background knowledge in the learning process has been successfully demonstrated in numerous applications of ILP methods. Nevertheless the effect of inc...
Thashmee Karunaratne, Henrik Boström
SDM
2004
SIAM
229views Data Mining» more  SDM 2004»
13 years 9 months ago
R-MAT: A Recursive Model for Graph Mining
How does a `normal' computer (or social) network look like? How can we spot `abnormal' sub-networks in the Internet, or web graph? The answer to such questions is vital ...
Deepayan Chakrabarti, Yiping Zhan, Christos Falout...