Mining frequent labeled and partially labeled graph patterns

被引:6
|
作者
Vanetik, N [1 ]
Gudes, E [1 ]
机构
[1] Ben Gurion Univ Negev, Dept Comp Sci, IL-84105 Beer Sheva, Israel
关键词
D O I
10.1109/ICDE.2004.1319987
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Whereas data mining in structured data focuses on frequent data values, in semi-structured and graph data the emphasis is on frequent labels and common topologies. Here, the structure of the data is just as important as its content. When data contains large amount of different labels, both fully labeled and partially labeled data may be useful. More informative patterns can be found in the database if some of the pattern nodes can be regarded as 'unlabeled'. We study the problem of discovering typical fully and partially labeled patterns of graph data. Discovered patterns are useful in many applications, including: compact representation of source information and a road-map for browsing and querying information sources.
引用
收藏
页码:91 / 102
页数:12
相关论文
共 50 条
  • [21] FRISSMiner: Mining Frequent Graph Sequence Patterns Induced by Vertices
    Inokuchi, Akihiro
    Washio, Takashi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2012, E95D (06): : 1590 - 1602
  • [22] NODAR: mining globally distributed substructures from a single labeled graph
    Hellal, Aya
    Ben Romdhane, Lotfi
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2013, 40 (01) : 1 - 15
  • [23] NODAR: mining globally distributed substructures from a single labeled graph
    Aya Hellal
    Lotfi Ben Romdhane
    Journal of Intelligent Information Systems, 2013, 40 : 1 - 15
  • [24] Adversarially regularized graph attention networks for inductive learning on partially labeled graphs
    Xiao, Jiaren
    Dai, Quanyu
    Xie, Xiaochen
    Lam, James
    Kwok, Ka-Wai
    KNOWLEDGE-BASED SYSTEMS, 2023, 268
  • [25] A Distance for Partially Labeled Trees
    Calvo, Jorge
    Rizo, David
    Inesta, Jose M.
    PATTERN RECOGNITION AND IMAGE ANALYSIS: 5TH IBERIAN CONFERENCE, IBPRIA 2011, 2011, 6669 : 492 - 499
  • [26] Counting frequent patterns in large labeled graphs: a hypergraph-based approach
    Meng, Jinghan
    Pitaksirianan, Napath
    Tu, Yi-Cheng
    DATA MINING AND KNOWLEDGE DISCOVERY, 2020, 34 (04) : 980 - 1021
  • [27] Counting frequent patterns in large labeled graphs: a hypergraph-based approach
    Jinghan Meng
    Napath Pitaksirianan
    Yi-Cheng Tu
    Data Mining and Knowledge Discovery, 2020, 34 : 980 - 1021
  • [28] Mining Weighted Frequent Patterns from Path Traversals on Weighted Graph
    Lee, Seong Dae
    Park, Hyu Chan
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (04): : 140 - 148
  • [29] A Graph Mining Approach for Ranking and Discovering the Interesting Frequent Subgraph Patterns
    Rehman, Saif Ur
    Liu, Kexing
    Ali, Tariq
    Nawaz, Asif
    Fong, Simon James
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2021, 14 (01)
  • [30] Mining maximal frequent patterns in a single graph using inexact matching
    Flores-Garrido, M.
    Carrasco-Ochoa, J. A.
    Martinez-Trinidad, J. F.
    KNOWLEDGE-BASED SYSTEMS, 2014, 66 : 166 - 177