DOM-based algorithm of mining frequent patterns from XML data

被引：0
|
作者：
Department of Computer, Nanjing Normal University, Nanjing 210097, China [1 ]
机构：
来源：
Nanjing Hangkong Hangtian Daxue Xuebao | 2006年 / 2卷 / 206-211期
关键词：
9;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] An Algorithm of Frequent Patterns Mining Based on Binary Information Granule
    Fang, G.
    Wu, Y.
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL APPLICATIONS (CISIA 2015), 2015, 18 : 47 - 50
  • [32] Complete Mining of Frequent Patterns from Graphs: Mining Graph Data
    Akihiro Inokuchi
    Takashi Washio
    Hiroshi Motoda
    [J]. Machine Learning, 2003, 50 : 321 - 354
  • [33] Complete mining of frequent patterns from graphs: Mining graph data
    Inokuchi, A
    Washio, T
    Motoda, H
    [J]. MACHINE LEARNING, 2003, 50 (03) : 321 - 354
  • [34] An efficient algorithm for mining maximal frequent patterns over data streams
    Yang, Junrui
    Wei, Yanjun
    Zhou, Fenfen
    [J]. 2015 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT HUMAN-MACHINE SYSTEMS AND CYBERNETICS IHMSC 2015, VOL II, 2015,
  • [35] Building XML data warehouse based on frequent patterns in user queries
    Zhang, J
    Ling, TW
    Bruckner, RM
    Tjoa, AM
    [J]. DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2003, 2737 : 99 - 108
  • [36] Mining frequent subtree on paging XML data stream
    Department of Compute Science and Engineering, East China University of Science and Technology, Shanghai 200237, China
    不详
    不详
    不详
    [J]. Jisuanji Yanjiu yu Fazhan, 9 (1926-1936):
  • [37] An algorithm based on bit vector decomposition and hash linklist for mining frequent patterns in data streams
    Ren, Jiadong
    Zhang, Yuanyuan
    Yu, Shiying
    [J]. International Journal of Digital Content Technology and its Applications, 2012, 6 (22) : 570 - 579
  • [38] An Efficient Frequent Patterns Mining Algorithm over Data Streams Based on FPD-Graph
    Tan JunShan
    Kuang Zhufang
    Yang Guogui
    [J]. MATERIALS SCIENCE AND INFORMATION TECHNOLOGY, PTS 1-8, 2012, 433-440 : 4457 - +
  • [39] An apriori-based algorithm for mining frequent substructures from graph data
    I.S.I.R, Osaka University, 8-1, Mihogaoka, Ibarakishi, Osaka
    567-0047, Japan
    不详
    Kanagawa
    242-8502, Japan
    [J]. Lect. Notes Comput. Sci., (13-23):
  • [40] An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
    Inokuchi, Akihiro
    Washio, Takashi
    Motoda, Hiroshi
    [J]. LECTURE NOTES IN COMPUTER SCIENCE <D>, 2000, 1910 : 13 - 23
12345