首页> 外文会议>International Symposium on Information Technologies and Applications in Education >Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms
【24h】

Comparison and Analysis of Two Typical Frequent Subgraph Mining Algorithms

机译:两种典型频繁子图挖掘算法的比较与分析

获取原文

摘要

AGM algorithm and HSIGRAM algorithm are two typical frequent subgraph mining algorithms. They have important influence on graph-based data mining. These two algorithms are introduced briefly in this paper. The differences and similarities of these algorithms are analyzed from two aspects of algorithm idea and technology. Combined with the characteristics of graph-based data mining, the improved strategies of these two algorithms are proposed. It benefits to improve the efficiency of other frequent subgraph mining algorithms.
机译:AGM算法和HSIGRAM算法是两个典型的频繁子图挖掘算法。它们对基于图形的数据挖掘具有重要影响。本文简要介绍了这两种算法。从算法思想和技术的两个方面分析了这些算法的差异和相似性。结合基于图形的数据挖掘的特征,提出了这两种算法的改进策略。它有利于提高其他频繁的子图挖掘算法的效率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号