首页> 外文OA文献 >MOSubdue: A Pareto Dominance-based Multiobjective Subdue Algorithm For Frequent Subgraph Mining

【2h】

MOSubdue: A Pareto Dominance-based Multiobjective Subdue Algorithm For Frequent Subgraph Mining

机译：mOsubdue：基于pareto Dominance的多目标子算法用于频繁子图挖掘

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
P. Shelokar et al.;
展开▼
作者单位

展开▼
年度 2015
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. MOSubdue: a Pareto dominance-based multiobjective Subdue algorithm for frequent subgraph mining [J] . Prakash Shelokar, Arnaud Quirin, Oscar Cordon Knowledge and information systems . 2013,第1期

机译：MOSubdue：基于Pareto优势的多目标Subdue算法，用于频繁的子图挖掘
2. A survey of frequent subgraph mining algorithms [J] . CHUNTAO JIANG, FRANS COENEN, MICHELE ZITO The Knowledge Engineering Review . 2013,第1期

机译：频繁子图挖掘算法研究
3. Classification and Analysis of Frequent Subgraphs Mining Algorithms [J] . Mohammad Reza Keyvanpour, Fereshteh Azizani Journal of software . 2012,第1期

机译：频繁子图挖掘算法的分类与分析
4. A multiobjective variant of the Subdue graph mining algorithm based on the NSGA-II selection mechanism [C] . Shelokar Prakash, Quirin Arnaud, Cordon Oscar IEEE Congress on Evolutionary Computation . 2010

机译：基于NSGA-II选择机制的Subdue图挖掘算法的多目标变体
5. Adaptation of Frequent Subgraph Mining Algorithms to Noncoding RNA Topology Alignment and Function Prediction [D] . Liu, Muyi. 2017

机译：频繁的子图挖掘算法适应非编码RNA拓扑比对和功能预测
6. RASMA: a reverse search algorithm for mining maximal frequent subgraphs [O] . Saeed Salem, Mohammed Alokshiya, Mohammad Al Hasan 2021

机译：RASMA：用于采矿最大频繁子图的反向搜索算法
7. Frequent Subgraph Mining Algorithms – A Survey [O] . Ramraj T., Prabhakar R. 2015

机译：子图频繁挖掘算法–调查
8. Genetic-Algorithm-Based Normal Boundary Intersection (GANBI) Method; An Efficient Approach to Pareto Multiobjective Optimization for Engineering Design [R] . Wettergren, T. A. 2006

机译：基于遗传算法的正常边界交点（GaNBI）方法;工程设计中pareto多目标优化的一种有效方法

MOSubdue: A Pareto Dominance-based Multiobjective Subdue Algorithm For Frequent Subgraph Mining

著录项

引文网络

相似文献

相关主题

期刊订阅