New efficient width-first algorithm for mining frequent subgraph

被引：0

作者：

School of Information Engineering, Univ. of Science and Technology Beijing, Beijing 100083, China ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Xi Tong Cheng Yu Dian Zi Ji Shu/Syst Eng Electron | / 3卷 / 548-552期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Data mining

引用

共 50 条

[41] An efficient algorithm for mining frequent closed itemsets
Fang, Gang
Wu, Yue
Li, Ming
Chen, Jia
Informatica (Slovenia), 2015, 39 (01): : 87 - 98
[42] An efficient algorithm for approximate frequent intemset mining
Uppal, Veepu
International Journal of Database Theory and Application, 2015, 8 (03): : 279 - 288
[43] SPADE: An efficient algorithm for mining frequent sequences
Zaki, MJ
MACHINE LEARNING, 2001, 42 (1-2) : 31 - 60
[44] An Efficient Close Frequent Pattern Mining Algorithm
Tan, Jun
Bu, Yingyong
Yang, Bo
ICICTA: 2009 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTATION TECHNOLOGY AND AUTOMATION, VOL I, PROCEEDINGS, 2009, : 528 - 531
[45] BitTableFI: An efficient mining frequent itemsets algorithm
Dong, Jie
Han, Min
KNOWLEDGE-BASED SYSTEMS, 2007, 20 (04) : 329 - 335
[46] An Efficient Algorithm for Mining Frequent Closed Itemsets
Fang, Gang
Wu, Yue
Li, Ming
Chen, Jia
INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2015, 39 (01): : 87 - 98
[47] An efficient algorithm for finding frequent and diverse subgraph patterns in PPI networks
Ma, Wubin
Liu, Mingxing
Huang, Hongbin
Su, Deng
INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2014, 16 (04) : 210 - 216
[48] A New Approach to Minimize Memory Requirements of Frequent Subgraph Mining Algorithms
Bilgin, Turgay Tugay
Oguz, Murat
JOURNAL OF POLYTECHNIC-POLITEKNIK DERGISI, 2021, 24 (01): : 237 - 246
[49] An Efficient Distributed Subgraph Mining Algorithm in Extreme Large Graphs
Wu, Bin
Bai, YunLong
ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, PT I, 2010, 6319 : 107 - 115
[50] A New Algorithm for Mining Frequent Pattern
李力
靳蕃
Journal of Southwest Jiaotong University, 2002, (01) : 10 - 20

← 1 2 3 4 5 →