Obiekt
Tytuł: Inferring graph grammars by detecting overlap in frequent subgraphs
Współtwórca:
Kasiński, Andrzej - ed. ; Ponulak, Filip - ed.
Podtytuł:
Tytuł publikacji grupowej:
Abstract:
In this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. ; We can also infer a hierarchy of productions by compressing portions of a graph described by a production and then inferring new productions on the compressed graph. We validate the approach in experiments where we generate graphs from known grammars and measure how well the approach infers the original grammar from the generated graph. We show graph grammars found in biological molecules, biological networks, and analyze learning curves of the algorithm.
Wydawca:
Zielona Góra: Uniwersytet Zielonogórski
Identyfikator zasobu:
DOI:
Strony:
Źródło:
AMCS, volume 18, number 2 (2008) ; kliknij tutaj, żeby przejść
Jezyk:
Prawa do dysponowania publikacją:
Biblioteka Uniwersytetu Zielonogórskiego
Kolekcje, do których przypisany jest obiekt:
- Repozytorium > Jednostki organizacyjne > Wydział Informatyki, Elektrotechniki i Automatyki
- Repozytorium > Typy utworów > Artykuły
- Repozytorium > Czasopisma naukowe i serie wydawnicze UZ > International Journal of Applied Mathematics and Computer Science (AMCS)
- Repozytorium > Czasopisma naukowe i serie wydawnicze UZ > International Journal of Applied Mathematics and Computer Science (AMCS) > International Journal of Applied Mathematics and Computer Science (AMCS) (2008)
Data ostatniej modyfikacji:
2024-04-08
Data dodania obiektu:
2024-04-05
Liczba wyświetleń treści obiektu:
41
Wszystkie dostępne wersje tego obiektu:
https://zbc.uz.zgora.pl/repozytorium/publication/88474
Wyświetl opis w formacie RDF:
Wyświetl opis w formacie OAI-PMH:
-
International Journal of Applied Mathematics and Computer Science (AMCS)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 25 (2015)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 24 (2014)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 23 (2013)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 22 (2012)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 21 (2011)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 20 (2010)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 19 (2009)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18, number 1 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18, number 2 (2008)
- Analysis of the ReSuMe learning process for spiking neural networks
- Towards spike-based speech processing: A biologically plausible approach to simple acoustic classification
- Model based analysis of signaling pathways
- A new approach to image reconstruction from projections using a recurrent neural network
- Segmentation of breast cancer fine needle biopsy cytological images
- How to compensate a spreading disturbance for a class of nonlinear systems
- Time-optimal boundary control of an infinite order parabolic system with time lags
- Approximate controllability of infinite dimensional systems of the n-th order
- Controllability and observability of linear discrete-time fractional-order systems
- Fractional positive continuous-time linear systems and their reachability
- Extension of first order predictive functional controllers to handle higher order internal models
- Inferring graph grammars by detecting overlap in frequent subgraphs
- Creation of unequal error protection codes for two groups of symbols
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18, number 3 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18, number 4 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 18, number 1 (2008)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 17 (2007)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 16 (2006)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 15 (2005)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 13 (2003)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 12 (2002)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 11 (2001)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 10 (2000)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 9 (1999)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 8 (1998)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 7 (1997)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 6 (1996)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 5 (1995)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 4 (1994)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 3 (1993)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 2 (1992)
-
International Journal of Applied Mathematics and Computer Science (AMCS),volume 1 (1991)
-
International Journal of Applied Mathematics and Computer Science (AMCS), volume 26 (2016)
| Nazwa wydania | Data |
|---|---|
| Inferring graph grammars by detecting overlap in frequent subgraphs | 2024-04-08 |
