Sciweavers

145 search results - page 13 / 29
» Mining closed relational graphs with connectivity constraint...
Sort
View
DIMACS
1996
15 years 1 months ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle
KAIS
2010
139views more  KAIS 2010»
14 years 10 months ago
Periodic subgraph mining in dynamic networks
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
Mayank Lahiri, Tanya Y. Berger-Wolf
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 2 days ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
15 years 1 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
CSL
1998
Springer
15 years 3 months ago
Revision Programming = Logic Programming + Integrity Constraints
We study revision programming, a logic-based mechanism for enforcing constraints on databases. The central concept of this approach is that of a justi ed revision based on a revisi...
V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczyns...