Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A New Approach for Mining Correlated Frequent Subgraphs

A New Approach for Mining Correlated Frequent Subgraphs Nowadays graphical datasets are having a vast amount of applications. As a result, graph mining—mining graph datasets to extract frequent subgraphs—has proven to be crucial in numerous aspects. It is important to perform correlation analysis among the subparts (i.e., elements) of the frequent subgraphs generated using graph mining to observe interesting information. However, the majority of existing works focuses on complexities in dealing with graphical structures, and not much work aims to perform correlation analysis. For instance, a previous work realized in this regard, operated with a very naive raw approach to fulfill the objective, but dealt only on a small subset of the problem. Hence, in this article, a new measure is proposed to aid in the analysis for large subgraphs, mined from various types of graph transactions in the dataset. These subgraphs are immense in terms of their structural composition, and thus parallel the entire set of graphs in real-world. A complete framework for discovering the relations among parts of a frequent subgraph is proposed using our new method. Evaluation results show the usefulness and accuracy of the newly defined measure on real-life graphical datasets. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Management Information Systems (TMIS) Association for Computing Machinery

A New Approach for Mining Correlated Frequent Subgraphs

Download PDF
28 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-new-approach-for-mining-correlated-frequent-subgraphs-ozynpKhmBk

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 Association for Computing Machinery.
ISSN
2158-656X
eISSN
2158-6578
DOI
10.1145/3473042
Publisher site
See Article on Publisher Site

Abstract

Nowadays graphical datasets are having a vast amount of applications. As a result, graph mining—mining graph datasets to extract frequent subgraphs—has proven to be crucial in numerous aspects. It is important to perform correlation analysis among the subparts (i.e., elements) of the frequent subgraphs generated using graph mining to observe interesting information. However, the majority of existing works focuses on complexities in dealing with graphical structures, and not much work aims to perform correlation analysis. For instance, a previous work realized in this regard, operated with a very naive raw approach to fulfill the objective, but dealt only on a small subset of the problem. Hence, in this article, a new measure is proposed to aid in the analysis for large subgraphs, mined from various types of graph transactions in the dataset. These subgraphs are immense in terms of their structural composition, and thus parallel the entire set of graphs in real-world. A complete framework for discovering the relations among parts of a frequent subgraph is proposed using our new method. Evaluation results show the usefulness and accuracy of the newly defined measure on real-life graphical datasets.

Journal

ACM Transactions on Management Information Systems (TMIS) – Association for Computing Machinery

Published: Oct 28, 2021

Keywords: Association rules

References

  • An Introduction to Frequent Pattern Mining
    [,
  • Fast algorithms for mining association rules in large databases In 20th International Conference on Very Large Data Bases
    [,
  • An improved graph based method for extracting association rules
    [,
  • GARM: A simple graph based algorithm for association rule mining
    [,
  • G-Miner: An efficient task-oriented graph mining system
    [,
  • Canonical correlation analysis of datasets with a common source graph
    [,
  • Applying the subdue substructure discovery system to the chemical toxicity domain
    [,
  • Introduction to Algorithms
    [,
  • A relational view of subgraph isomorphism
    [,
  • IOGP: An incremental online graph partitioning algorithm for distributed graph databases
    [,
  • Exploring decomposition for solving pattern mining problems
    [,
  • A graph-based approach to person name disambiguation in web
    [,
  • The Wilcoxon-Mann-Whitney test under scrutiny
    [,
  • Association rules with graph patterns
    [,
  • Mining frequent patterns from human interactions in meetings using directed acyclic graphs
    [,
  • Utility-driven mining of trend information for intelligent system
    [,
  • DFEP: Distributed funding-based edge partitioning
    [,
  • A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
    [,
  • Data Mining: Concepts and Techniques
    [,
  • Mining frequent patterns without candidate generation
    [,
  • The evolution of the association rules
    [,
  • A survey of frequent subgraph mining algorithms
    [,
  • Graph mining with graph neural networks
    [,
  • CCMine: Efficient mining of confidence-closed correlated patterns
    [,
  • Compact in-memory representation of large graph databases for efficient mining of maximal frequent sub graphs
    [,
  • Solving multiple depot vehicle routing problem (MDVRP) using genetic algorithm
    [,
  • AutoMine: Harmonizing high-level abstraction and high performance for graph mining
    [,
  • Case for omitting tied observations in the two-sample t-test and the Wilcoxon-Mann-Whitney Test
    [,
  • Mann Whitney U Test (Wilcoxon Rank Sum Test)
    [,
  • FlexGraph: Flexible partitioning and storage for scalable graph mining
    [,
  • Mining resource profiles from event logs
    [,
  • JA-BE-JA: A distributed algorithm for balanced graph partitioning
    [,
  • An overview of recent graph partitioning algorithms
    [,
  • From distance correlation to multiscale graph correlation
    [,
  • Association rule mining: A graph based approach for mining frequent itemsets
    [,
  • Fennel: Streaming graph partitioning for massive scale graphs
    [,
  • Discovering correlation in frequent subgraphs
    [,
  • Process mining: Overview and opportunities
    [,
  • Vehicle routing problem with drones
    [,
  • Re-examination of interestingness measures in pattern mining: A unified framework
    [,
  • Graph datasets
    [,
  • gSpan: Graph-based substructure pattern mining
    [,
  • Tree-based mining for discovering patterns of human interaction in meetings
    [,
  • Data Mining and Analysis: Fundamental Concepts and Algorithms
    [,