Sciweavers

124 search results - page 19 / 25
» Mining Graph Evolution Rules
Sort
View
RSFDGRC
2005
Springer
134views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
The Computational Complexity of Inference Using Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
Cory J. Butz, Wen Yan, Boting Yang
COORDINATION
2005
Springer
14 years 1 months ago
Synchronized Hyperedge Replacement for Heterogeneous Systems
Abstract. We present a framework for modelling heterogeneous distributed systems using graph transformations in the Synchronized Hyperedge Replacement approach, which describes com...
Ivan Lanese, Emilio Tuosto
ENTCS
2008
98views more  ENTCS 2008»
13 years 8 months ago
A Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...
Oana Andrei, Hélène Kirchner
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 7 months ago
A resource-based Korean morphological annotation system
We describe a resource-based method of morphological annotation of written Korean text. Korean is an agglutinative language. The output of our system is a graph of morphemes annot...
Hyun-Gue Huh, Eric Laporte
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 2 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey