Dryade: a new approach for discovering closed frequent trees in heterogeneous tree databases
作者： A. Termier , M.-C. Rousset , M. Sebag
关键词:
摘要: In this paper we present a novel algorithm for discovering tree patterns in database. This uses relaxed inclusion definition, making the problem more complex (checking is NP-complete), but allowing to mine highly heterogeneous databases. To obtain good performances, our DRYADE algorithm, discovers only closed frequent patterns.
irisa.fr 
sci-hub.se 参考文章(15)
Richard R. Muntz, Yirong Yang, Yun Chi, Mining Frequent Rooted Trees and Free Trees Using Canonical Forms ,(2003)
節夫 有川, 比呂志 坂本, 真治 川副, Setsuo Arikawa, 賢治 安部, 達哉 浅井, 博紀 有村, Shinji Kawasoe, Kenji Abe, Hiroshi Sakamoto, Hiroki Arimura, Tatsuya Asai, Efficient Substructure Discovery from Large Semi-structed Data DOI Technical Report. ,vol. 200, ,(2001)
T. Asai, Efficient substructure discovery from large semi-structured data siam international conference on data mining. pp. 158- 174 ,(2002)
Mohammed Javeed Zaki, Ching-Jiu Hsiao, CHARM : An Efficient Algorithm for Closed Itemset Mining siam international conference on data mining. pp. 457- 473 ,(2002)
C Borgelt, EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT PROC OF THE IEEE ICDM WORKSHOP ON FREQUENT ITEMSET MINING IMPLEMENTATIONS. pp. 0- 0 ,(2003)
Tatsuya Asai, Hiroki Arimura, Takeaki Uno, Shin-ichi Nakano, Discovering frequent substructures in large unordered trees discovery science. ,vol. 2843, pp. 47- 61 ,(2003) , 10.1007/978-3-540-39644-4_6
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, Discovering Frequent Closed Itemsets for Association Rules international conference on database theory. ,vol. 1540, pp. 398- 416 ,(1999) , 10.1007/3-540-49257-7_25
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz, CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees Advances in Knowledge Discovery and Data Mining. pp. 63- 73 ,(2004) , 10.1007/978-3-540-24775-3_9
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data european conference on principles of data mining and knowledge discovery. pp. 13- 23 ,(2000) , 10.1007/3-540-45372-5_2
Luc Dehaspe, Frequent pattern discovery in first-order logic Ai Communications. ,vol. 12, pp. 115- 117 ,(1999)