Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3430036.3430068acmotherconferencesArticle/Chapter ViewAbstractPublication PagesvinciConference Proceedingsconference-collections
poster

A fast method for detecting minority structures in a graph

Published: 08 December 2020 Publication History

Abstract

A graph contains plentiful structures. Some minority structures are important, such as high degree nodes and bridges. Detecting these minority structures is beneficial to accelerate computational graph analysis and improve the comprehension of graph visualization. Regarding four typical minority structures, this paper proposes two algorithms to detect these structures fast and efficiently. A set of experiments demonstrate the effectiveness of the proposed algorithms.

Reference

[1]
Y. Zhao, H. Jiang, Q. Chen, Y. Qin, H. Xie, Y. Wu, S. Liu, Z. Zhou, J. Xia, and F. Zhou. Preserving Minority Structures in Graph Sampling. IEEE Transactions on Visualization and Computer Graphics, 28(2):1--10, 2021.

Index Terms

  1. A fast method for detecting minority structures in a graph

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    VINCI '20: Proceedings of the 13th International Symposium on Visual Information Communication and Interaction
    December 2020
    205 pages
    ISBN:9781450387507
    DOI:10.1145/3430036
    Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 08 December 2020

    Check for updates

    Author Tags

    1. graph anomaly detection
    2. graph sampling
    3. graph visualization

    Qualifiers

    • Poster

    Conference

    VINCI 2020

    Acceptance Rates

    Overall Acceptance Rate 71 of 193 submissions, 37%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 51
      Total Downloads
    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Nov 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media