• Home
  • Search
  • Structural-semantic approach for approximate frequent subgraph mining
  • Cite Icon1
  • https://doi.org/10.1109/aiccsa.2015.7507244Copy DOI Icon

Structural-semantic approach for approximate frequent subgraph mining

  • Nov 1, 2015
  • Mohamed Moussaoui +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Frequent subgraph mining refers usually to graph matching and it is widely used when analyzing big data with large graphs. A lot of research works dealt with structural exact or inexact graph matching but a little attention is paid to semantic matching when graph vertices and/or edges are attributed and typed. Therefore, it seems very interesting to integrate background knowledge into the analysis and that extracted frequent subgraphs should become more pruned by applying a new semantic filter instead of using only structural similarity in graph matching process. Consequently, this paper focuses on developing a new hybrid approximate structural semantic graph matching to discover a set of frequent subgraphs. It uses both similarity measures. An approximate structural similarity function based on graph edit distance function and a semantic vertices similarity function based on possibilistic information affinity function. Both structural and semantic filters contribute together to prune extracted frequent sets. Indeed, new hybrid structural-semantic frequent subgraph mining approach will be suitable to be applied to several applications such as community detection and social network analysis.

Similar Papers
  • PDF
  • Research Article
  • Citations8

A Graph Mining Approach for Ranking and Discovering the Interesting Frequent Subgraph Patterns

  • Aug 04, 2021
  • International Journal of Computational Intelligence Systems
  • Saif Ur Rehman +4
  • Conference Article
  • Citations117

Near-optimal supervised feature selection among frequent subgraphs

  • Apr 30, 2009
  • Marisa Thoma +9
  • Conference Article

A Frequent Subgraph Publishing Algorithm Based on Differential Privacy

  • Sep 01, 2022
  • Wenfen Liu +3
  • Research Article
  • Citations2

Mining Association Rules from a Single Large Graph

  • Dec 24, 2022
  • Cybernetics and Systems
  • Bao Huynh +9
  • Conference Article
  • Citations2

Frequent Subgraph Mining on BigData

  • Jun 01, 2018
  • K.M Sreedevi +2
  • Book Chapter
  • Citations6

Clustering Improves the Exploration of Graph Mining Results

  • Jan 01, 2007
  • Edgar H De Graaf +2
  • Dissertation

Efficient algorithms for subgraph counting and enumeration on large graphs

  • Jan 01, 2024
  • Kaixin Wang
  • Conference Article
  • Citations7

JPMiner: Mining Frequent Jump Patterns from Graph Databases

  • Jan 01, 2009
  • Yong Liu +2
  • Conference Article
  • Citations1

Towards using subpattern distributions in Social Network Analysis

  • Aug 01, 2016
  • Benjamin Cabrera
  • Conference Article
  • Citations27

Efficient Discovery of Frequent Correlated Subgraph Pairs

  • Dec 01, 2009
  • Yiping Ke +2
  • Research Article
  • Citations3

Mining approximate frequent subgraph with sampling techniques

  • Apr 21, 2021
  • Materials Today: Proceedings
  • Shriya Sahu +3
  • Conference Article
  • Citations2

Pathway Based Human Disease Clustering and Similarity Analysis Tool Using Frequent Structure Mining

  • Jul 01, 2018
  • Delwyn P Mendoza +2
  • Conference Article
  • Citations19

REAFUM: Representative Approximate Frequent Subgraph Mining

  • Jun 30, 2015
  • Ruirui Li +1
  • Research Article
  • Citations32

Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction

  • May 01, 2024
  • IEEE Transactions on Dependable and Secure Computing
  • Xinrui Ge +2
  • Book Chapter
  • Citations7

Maximal Induced Matchings in Triangle-Free Graphs

  • Jan 01, 2014
  • Manu Basavaraju +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.