Sciweavers

3778 search results - page 155 / 756
» Representing Web Graphs
Sort
View
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
15 years 1 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
ENTCS
2006
154views more  ENTCS 2006»
14 years 10 months ago
Applying a Model Transformation Taxonomy to Graph Transformation Technology
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...
Tom Mens, Pieter Van Gorp, Dániel Varr&oacu...
DM
2000
111views more  DM 2000»
14 years 9 months ago
Representations of graphs modulo n
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
Anthony B. Evans, Garth Isaak, Darren A. Narayan
ACL
2010
14 years 8 months ago
Global Learning of Focused Entailment Graphs
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
Jonathan Berant, Ido Dagan, Jacob Goldberger
ICASSP
2011
IEEE
14 years 1 months ago
Factor graph switching portfolios under transaction costs
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Andrew J. Bean, Andrew C. Singer