FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2464391576> ?p ?o ?g. }

• W2464391576 endingPage "207" @default.
• W2464391576 startingPage "198" @default.
• W2464391576 abstract "In recent years, an increasing number of works have been reported that modeling data as multi-graphs more efficiently solves some practical problems. In these contexts, data mining techniques could be useful for discovering patterns, helping to solve more complex tasks like classification. Additionally, in real-world applications, it is very useful to mine patterns allowing approximate matching between graphs. However, to the best of our knowledge, in literature there is only one method that allows mining these types of patterns in multi-graph collections. This method does not compute the approximate patterns directly from the multi-graph collections, which makes it inefficient. In this paper, an algorithm for directly mining patterns in multi-graph collections in a more efficient way than the only alternative reported in the literature is proposed. Our algorithm, introduces an extension of a canonical form based on depth-first search, which allows representing multi-graphs. Experiments on different public standard databases are carried out to demonstrate the performance of the proposed algorithm. The algorithm is compared with the only alternative reported in the literature for mining patterns in multi-graph collections. Note that the new algorithm and the referenced algorithm [N. Acosta-Mendoza, J.A. Carrasco-Ochoa, J.F. Martínez-Trinidad, A. Gago-Alonso, and J.E. Medina-Pagola. A New Method Based on Graph Transformation for FAS Mining in Multi-graph Collections. In The 7th Mexican Conference on Pattern Recognition (MCPR’2015), Pattern Recognition, volume LNCS 9116, pages 13–22. Springer, 2015.] produce the same results but the new algorithm is more efficient." @default.
• W2464391576 created "2016-07-22" @default.
• W2464391576 creator A5009534889 @default.
• W2464391576 creator A5009754927 @default.
• W2464391576 creator A5022183538 @default.
• W2464391576 creator A5036722310 @default.
• W2464391576 creator A5058191966 @default.
• W2464391576 date "2016-10-01" @default.
• W2464391576 modified "2023-10-14" @default.
• W2464391576 title "A new algorithm for approximate pattern mining in multi-graph collections" @default.
• W2464391576 cites W1509693624 @default.
• W2464391576 cites W1958643634 @default.
• W2464391576 cites W1969850235 @default.
• W2464391576 cites W2018245790 @default.
• W2464391576 cites W2022775046 @default.
• W2464391576 cites W2024662824 @default.
• W2464391576 cites W2024762634 @default.
• W2464391576 cites W2037314220 @default.
• W2464391576 cites W2059356048 @default.
• W2464391576 cites W2072639683 @default.
• W2464391576 cites W2131792733 @default.
• W2464391576 cites W2165155543 @default.
• W2464391576 cites W2285962874 @default.
• W2464391576 cites W2293537288 @default.
• W2464391576 cites W231720905 @default.
• W2464391576 cites W2339329611 @default.
• W2464391576 cites W580955258 @default.
• W2464391576 doi "https://doi.org/10.1016/j.knosys.2016.07.003" @default.
• W2464391576 hasPublicationYear "2016" @default.
• W2464391576 type Work @default.
• W2464391576 sameAs 2464391576 @default.
• W2464391576 citedByCount "7" @default.
• W2464391576 countsByYear W24643915762018 @default.
• W2464391576 countsByYear W24643915762019 @default.
• W2464391576 countsByYear W24643915762020 @default.
• W2464391576 countsByYear W24643915762021 @default.
• W2464391576 countsByYear W24643915762023 @default.
• W2464391576 crossrefType "journal-article" @default.
• W2464391576 hasAuthorship W2464391576A5009534889 @default.
• W2464391576 hasAuthorship W2464391576A5009754927 @default.
• W2464391576 hasAuthorship W2464391576A5022183538 @default.
• W2464391576 hasAuthorship W2464391576A5036722310 @default.
• W2464391576 hasAuthorship W2464391576A5058191966 @default.
• W2464391576 hasConcept C11413529 @default.
• W2464391576 hasConcept C124101348 @default.
• W2464391576 hasConcept C132525143 @default.
• W2464391576 hasConcept C154945302 @default.
• W2464391576 hasConcept C176225458 @default.
• W2464391576 hasConcept C41008148 @default.
• W2464391576 hasConcept C68859911 @default.
• W2464391576 hasConcept C80444323 @default.
• W2464391576 hasConceptScore W2464391576C11413529 @default.
• W2464391576 hasConceptScore W2464391576C124101348 @default.
• W2464391576 hasConceptScore W2464391576C132525143 @default.
• W2464391576 hasConceptScore W2464391576C154945302 @default.
• W2464391576 hasConceptScore W2464391576C176225458 @default.
• W2464391576 hasConceptScore W2464391576C41008148 @default.
• W2464391576 hasConceptScore W2464391576C68859911 @default.
• W2464391576 hasConceptScore W2464391576C80444323 @default.
• W2464391576 hasFunder F4320321739 @default.
• W2464391576 hasLocation W24643915761 @default.
• W2464391576 hasOpenAccess W2464391576 @default.
• W2464391576 hasPrimaryLocation W24643915761 @default.
• W2464391576 hasRelatedWork W1981862454 @default.
• W2464391576 hasRelatedWork W2004949443 @default.
• W2464391576 hasRelatedWork W2020100607 @default.
• W2464391576 hasRelatedWork W2084777082 @default.
• W2464391576 hasRelatedWork W2156357380 @default.
• W2464391576 hasRelatedWork W2553130930 @default.
• W2464391576 hasRelatedWork W2913317685 @default.
• W2464391576 hasRelatedWork W3160133939 @default.
• W2464391576 hasRelatedWork W4297790704 @default.
• W2464391576 hasRelatedWork W7836671 @default.
• W2464391576 hasVolume "109" @default.
• W2464391576 isParatext "false" @default.
• W2464391576 isRetracted "false" @default.
• W2464391576 magId "2464391576" @default.
• W2464391576 workType "article" @default.