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 条
  • [41] Learning to detect partially labeled people
    Rachlin, Y
    Dolan, J
    Khosla, P
    IROS 2003: PROCEEDINGS OF THE 2003 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, 2003, : 1536 - 1541
  • [42] A Graph-Based Differentially Private Algorithm for Mining Frequent Sequential Patterns
    Nunez-del-Prado, Miguel
    Maehara-Aliaga, Yoshitomi
    Salas, Julian
    Alatrista-Salas, Hugo
    Megias, David
    APPLIED SCIENCES-BASEL, 2022, 12 (04):
  • [43] Effectively and efficiently mining frequent patterns from dense graph streams on disk
    Braun, Peter
    Cameron, Juan J.
    Cuzzocrea, Alfredo
    Jiang, Fan
    Leung, Carson K.
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS 18TH ANNUAL CONFERENCE, KES-2014, 2014, 35 : 338 - 347
  • [44] Frequent Patterns Mining from Data Cube Using Aggregation and Directed Graph
    Singh, Kuldeep
    Shakya, Harish Kumar
    Biswas, Bhaskar
    PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON FRONTIERS IN INTELLIGENT COMPUTING: THEORY AND APPLICATIONS (FICTA) 2015, 2016, 404 : 167 - 177
  • [45] AGraP: an algorithm for mining frequent patterns in a single graph using inexact matching
    Flores-Garrido, Marisol
    Carrasco-Ochoa, Jesus-Ariel
    Fco Martinez-Trinidad, Jose
    KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 44 (02) : 385 - 406
  • [46] An Algorithm Based on Dataflow Model for Mining Frequent Patterns from a Large Graph
    Tang X.-C.
    Fan X.-F.
    Zhou J.-W.
    Li Z.-H.
    Jisuanji Xuebao/Chinese Journal of Computers, 2020, 43 (07): : 1293 - 1311
  • [47] SWFTPMiner: Mining Weighted Frequent Patterns from Graph Traversals with Noisy Information
    Geng, Runian
    Dong, Xiangjun
    Zhao, Jing
    Xu, Wenbo
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 5585 - +
  • [48] AGraP: an algorithm for mining frequent patterns in a single graph using inexact matching
    Marisol Flores-Garrido
    Jesús-Ariel Carrasco-Ochoa
    José Fco. Martínez-Trinidad
    Knowledge and Information Systems, 2015, 44 : 385 - 406
  • [49] Mining Frequent Independent Patterns and Frequent Correlated Patterns Synchronously
    Zhou, Zhongmei
    FIFTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 5, PROCEEDINGS, 2008, : 552 - 556
  • [50] The Complexity of Bottleneck Labeled Graph Problems
    Refael Hassin
    Jérôme Monnot
    Danny Segev
    Algorithmica, 2010, 58 : 245 - 262