A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining

Fuente: Redalyc
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Niusvel Acosta Mendoza
Format: Artículo científico
Sprache:en
Veröffentlicht: Universidad de las Ciencias Informáticas 2018
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1876454867217678336
author Niusvel Acosta Mendoza
author_facet Niusvel Acosta Mendoza
contents A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining Niusvel Acosta Mendoza Computación graph multi graph mining Approximate mining based classification Frequent approximate subgraph (FAS) mining has been successfully applied in several science domains, because in many applications, approximate approaches have achieved better results than exact approaches. However, there are real applications based on multi-graphs where traditional FAS miners cannot be applied because they were not designed to deal with this type of graph. Only one method based on graph transformation, which allows the use of traditional simple-graph FAS miners on multi-graph problems was reported, but it has high computational cost. This paper aims at accelerating the mining process, thus a more efficient method is proposed for transforming multi-graphs into simple graphs and vice versa without losing topological or semantic information, that allows using traditional FAS mining algorithms and returning the mined patterns to the multi-graph space. Finally, we analyze the performance of the proposed method over synthetic multi-graph collections and additionally we show the effectiveness of the proposal in image classification tasks where images are represented as multi-graphs. 2018 artículo científico 1994-1536 https://www.redalyc.org/articulo.oa?id=378365832001 https://www.redalyc.org/journal/3783/378365832001/ https://www.redalyc.org/journal/3783/378365832001/html/ https://www.redalyc.org/journal/3783/378365832001/378365832001.epub https://www.redalyc.org/journal/3783/378365832001/movil en http://www.redalyc.org/revista.oa?id=3783 Revista Cubana de Ciencias Informáticas application/pdf Universidad de las Ciencias Informáticas Revista Cubana de Ciencias Informáticas (Cuba) Num.3 Vol.12
format Artículo científico
id redalyc_378365832001
institution Redalyc
language en
publishDate 2018
publisher Universidad de las Ciencias Informáticas
spellingShingle A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining
Niusvel Acosta Mendoza
Computación
graph
multi
graph mining
Approximate mining
based classification
A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining Niusvel Acosta Mendoza Computación graph multi graph mining Approximate mining based classification Frequent approximate subgraph (FAS) mining has been successfully applied in several science domains, because in many applications, approximate approaches have achieved better results than exact approaches. However, there are real applications based on multi-graphs where traditional FAS miners cannot be applied because they were not designed to deal with this type of graph. Only one method based on graph transformation, which allows the use of traditional simple-graph FAS miners on multi-graph problems was reported, but it has high computational cost. This paper aims at accelerating the mining process, thus a more efficient method is proposed for transforming multi-graphs into simple graphs and vice versa without losing topological or semantic information, that allows using traditional FAS mining algorithms and returning the mined patterns to the multi-graph space. Finally, we analyze the performance of the proposed method over synthetic multi-graph collections and additionally we show the effectiveness of the proposal in image classification tasks where images are represented as multi-graphs. 2018 artículo científico 1994-1536 https://www.redalyc.org/articulo.oa?id=378365832001 https://www.redalyc.org/journal/3783/378365832001/ https://www.redalyc.org/journal/3783/378365832001/html/ https://www.redalyc.org/journal/3783/378365832001/378365832001.epub https://www.redalyc.org/journal/3783/378365832001/movil en http://www.redalyc.org/revista.oa?id=3783 Revista Cubana de Ciencias Informáticas application/pdf Universidad de las Ciencias Informáticas Revista Cubana de Ciencias Informáticas (Cuba) Num.3 Vol.12
title A New Multi-graph Transformation Method for Frequent Approximate Subgraph Mining
topic Computación
graph
multi
graph mining
Approximate mining
based classification
url https://www.redalyc.org/articulo.oa?id=378365832001
https://www.redalyc.org/journal/3783/378365832001/
https://www.redalyc.org/journal/3783/378365832001/html/
https://www.redalyc.org/journal/3783/378365832001/378365832001.epub
https://www.redalyc.org/journal/3783/378365832001/movil