An Overview of Algorithms for Mining Frequent Patterns in Graph Data

GAO Lin; QIN Gui-min; ZHOU Xiao-feng

您当前的位置：

首页 >

文章列表页 >

An Overview of Algorithms for Mining Frequent Patterns in Graph Data

更新时间：2025-07-16

- An Overview of Algorithms for Mining Frequent Patterns in Graph Data
- Acta Electronica Sinica Vol. 36, Issue 8, Pages: 1603-1609(2008)
- 作者机构：
  
  1. 西安电子科技大学计算机学院,陕西,西安,710071
  2. 西安电子科技大学软件学院,陕西,西安,710071
  3. 西安电子科技大学计算机学院陕西西安,710071
  4. 西安电子科技大学软件学院陕西西安,710071
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Published：2008
- 稿件说明：
移动端阅览
GAO Lin, QIN Gui-min, ZHOU Xiao-feng. An Overview of Algorithms for Mining Frequent Patterns in Graph Data[J]. Acta Electronica Sinica, 2008, 36(8): 1603-1609.
DOI：

GAO Lin, QIN Gui-min, ZHOU Xiao-feng. An Overview of Algorithms for Mining Frequent Patterns in Graph Data[J]. Acta Electronica Sinica, 2008, 36(8): 1603-1609. DOI：

摘要

本文对图数据中的频繁模式挖掘算法进行了综述.依据算法的特性和数学基础对算法进行了分类

主要集中于算法的求解思想和不同算法之间的关系的比较

并对一些著名的算法进行了详细的分析和讨论.基于算法的特性

比较了各种算法适用的范围以及应用领域.最后

讨论了频繁模式挖掘的最新进展及未来的研究方向.

Abstract

Graphs are widely used to model data in various applications.In recent years

a lot of algorithms have been developed to mine frequent pattern in graph data.We review some representative algorithms in this area.We classify the algorithms based on their properties and mathematical foundation

focusing on the algorithms underlying the approaches and how the algorithms relate to each other.Some typical algorithms are investigated.The comparison is then given based on the properties of the algorithms.New progress and future research directions are pointed.

关键词

Keywords

references

Views

2841

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Closed Frequent Subgraph Based Containment Query Algorithm

Related Author

LI Xian-tong

AN Shi

Related Institution

School of Transportation Science and Engineering,Harbin Institute of Technology

⁰