首页> 外文OA文献 >MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks

【2h】

MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks

机译：mFC：在不平衡ppI网络中挖掘没有候选维护的最大频繁密集子图

页面导航

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

著录项

作者
Miao Wang; Xuequn Shang; Zhanhuai Li;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks [J] . Miao Wang, Xuequn Shang, Zhanhuai Li Journal of software . 2011,第3期

机译：MFC：在不平衡的PPI网络中挖掘没有候选维护的最大频繁密集子图
2. MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks [J] . Miao Wang, Xuequn Shang, Zhanhuai Li Journal of Computers . 2011,第3期

机译：MFC：在不平衡的PPI网络中挖掘没有候选维护的最大频繁密集子图
3. MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks [J] . Miao Wang, Xuequn Shang, Zhanhuai Li Journal of software . 2011,第3期

机译：MFC：在不平衡的PPI网络中挖掘没有候选维护的最大频繁密集子图
4. Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in PPI Networks [C] . Wang Miao, Shang Xuequn, Lei Xiaogang, 2010 2nd International Workshop on Intelligent Systems and Applications (ISA 2010) . 2010

机译：在PPI网络中无需候选维护的情况下挖掘最大频繁密集子图
5. Algorithms for Mining Maximal Quasi Frequent Subnetworks [D] . El Radie, Eihab Salah. 2018

机译：用于采矿最大准则频繁子网的算法
6. FREQUENT SUBGRAPH MINING OF PERSONALIZED SIGNALING PATHWAY NETWORKS GROUPS PATIENTS WITH FREQUENTLY DYSREGULATED DISEASE PATHWAYS AND PREDICTS PROGNOSIS [O] . Arda Durmaz, Tim A. D. Henderson, Douglas Brubaker, -1

机译：频繁失调的疾病通路和预测的个性化信号通路网络组的频率子图挖掘
7. MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks [O] . Xuequn Shang, Miao Wang, Zhanhuai Li 2011

机译：MFC：在不平衡的PPI网络中挖掘没有候选维护的最大频繁密集子图

MFC: Mining Maximal Frequent Dense Subgraphs without Candidate Maintenance in Imbalanced PPI Networks

著录项

引文网络

相似文献

相关主题

期刊订阅