Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Frequent mining of subgraph structures

From MaRDI portal
Publication:3429325
Jump to:navigation, search

DOI10.1080/09528130600975691zbMath1111.68100OpenAlexW2032486683MaRDI QIDQ3429325

Ping Guo, Xinru Wang, Yan-Rong Kang

Publication date: 30 March 2007

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130600975691


zbMATH Keywords

data miningfrequent subgraphfrequent structurefrequent structure mining algorithmgraph structured mining


Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)


Related Items (1)

Meta itemset: a new concise representation of frequent itemset




Cites Work

  • Complete mining of frequent patterns from graphs: Mining graph data
  • Inductive Logic Programming: Theory and methods
  • Foreword to special issue on SODA 2002




This page was built for publication: Frequent mining of subgraph structures

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3429325&oldid=16733599"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 18:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki