淡江大學機構典藏:Item 987654321/122636
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64188/96967 (66%)
Visitors : 11337323      Online Users : 36
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/122636


    Title: A Deep Generative Model for Reordering Adjacency Matrices
    Authors: Kwon, Oh-Hyun;Kao, Chiun-How;Chen, Chun-Houh;Ma, Kwan-Liu
    Keywords: Sorting;Data visualization;Neural networks;Computational modeling;Training;Computer architecture;Stochastic processes
    Date: 2022-02-25
    Issue Date: 2022-03-30 12:11:18 (UTC+8)
    Abstract: Depending on the node ordering, an adjacency matrix can highlight distinct characteristics of a graph. Deriving a "proper" node ordering is thus a critical step in visualizing a graph as an adjacency matrix. Users often try multiple matrix reorderings using different methods until they find one that meets the analysis goal. However, this trial-and-error approach is laborious and disorganized, which is especially challenging for novices. This paper presents a technique that enables users to effortlessly find a matrix reordering they want. Specifically, we design a generative model that learns a latent space of diverse matrix reorderings of the given graph. We also construct an intuitive user interface from the learned latent space by creating a map of various matrix reorderings. We demonstrate our approach through quantitative and qualitative evaluations of the generated reorderings and learned latent spaces. The results show that our model is capable of learning a latent space of diverse matrix reorderings. Most existing research in this area generally focused on developing algorithms that can compute "better" matrix reorderings for particular circumstances. This paper introduces a fundamentally new approach to matrix visualization of a graph, where a machine learning model learns to generate diverse matrix reorderings of a graph.
    Relation: IEEE Transactions on Visualization and Computer Graphics
    DOI: 10.1109/TVCG.2022.3153838
    Appears in Collections:[Graduate Institute & Department of Statistics] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML91View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback