ویراساینس.
سند علمی

Graph Mining using Graph Pattern Profiles

Sofus A. Macskassy, Claude Nanjo

چکیده

This paper presents our investigation into graph mining methods to help users understand large graphs. Our approach is a two-step process: First calculate subgraph labels and then calculate distribution statistics on these labels. Our approach is flexible in that it can identify a range of patterns from very abstract to very specific (e.g., isomorphisms). The statistics that we calculate can be used to find rare and common patterns, patterns that are (dis)similar to the distribution of induced subgraphs of the same size, patterns that are (dis)similar to each other, as well as variance of graph patterns given a specific set of input node types. We also investigate a method to understand structural characteristics by analyzing clusters that are created by “collapsing” overlapping instances of user-specified patterns. We evaluated our approach on two publicly available networks—the Texas CS web-site from WebKB and the internet movie database.

اسناد مشابه

  • Mining spatiotemporal patterns in dynamic plane graphs

    سند علمی۲۰۱۳Intell. Data Anal.Adriana Prado, Baptiste Jeudy, Élisa Fromont, Fabien Diot

    Dynamic graph mining is the task of searching for subgraph patterns that capture the evolution of a dynamic graph. In this paper, we are interested in mining dynamic graphs in videos. A video can be regarded as a dynamic graph, whose evolution over time is represented by a series

  • A Graph Approach to Mining Biological Patterns in the Binding Interfaces

    سند علمی۲۰۱۷Journal of Computational BiologyWen Cheng, Changhui Yan

    Protein-RNA interactions play important roles in the biological systems. Searching for regular patterns in the Protein-RNA binding interfaces is important for understanding how protein and RNA recognize each other and bind to form a complex. Herein, we present a graph-mining meth

  • CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms

    سند علمی۲۰۱۶ICDMKijung Shin, Tina Eliassi-Rad, Christos Faloutsos

    How do the k-core structures of real-world graphs look like? What are the common patterns and the anomalies? How can we use them for algorithm design and applications? A k-core is the maximal subgraph where all vertices have degree at least k. This concept has been applied to suc

  • Mining Sequential Pattern of Multi-dimensional Wind Profiles

    سند علمی۲۰۱۵N. Yusof

    Wind has become increasingly important as a source of energy although the generation of wind energy is quite erratic because of its changeable nature. For a given location, wind speed and direction change over time and at different heights. Previous studies have discovered differ

  • A Graph Mining Approach for Ranking and Discovering the Interesting Frequent Subgraph Patterns

    مقاله‌ی دسترسی آزاد۲۰۲۱International Journal of Computational Intelligence Systems['Saif Ur Rehman', 'Kexing Liu', 'Tariq Ali', 'Asif Nawaz', 'Simon Fong', '']

    Abstract Graph mining is a well-established research field, and lately it has drawn in considerable communities. It allows to process, analyze, discover significant knowledge from graph data. In mining, one of the most challenging tasks frequent subgraph (FSM). FSM consists apply

  • Big Graph Mining: Frameworks and Techniques

    سند علمی۲۰۱۶Big Data ResearchSabeur Aridhi, Engelbert Mephu Nguifo

    Big graph mining is an important research area and it has attracted considerable attention. It allows to process, analyze, and extract meaningful information from large amounts of graph data. Big graph mining has been highly motivated not only by the tremendously increasing size