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

NaturalMotion: Exploring Gesture Controls for Visualizing Time-Evolving Graphs

Samuel Clarke, Nathan Dass, Duen Horng, Chau

چکیده

We are investigating new ways for people to explore time-evolving graph data represented as the recently-introduced Matrix Cube, through natural gestures in a 3D environment. In the cube, one axis is time, and the other two axes comprise an adjacency matrix of a graph. We want to understand how recent advances in virtual reality technologies may help the user more naturally explore the dimensionality and richness of this 3D visualization, enabling them to more effectively gain insights into relationships and anomalies in the data. We use a Leap Motion controller to capture the user’s hand gestures that manipulate the cube into its many possible projections. We prototyped this synergy of data visualization and virtual reality on a time-evolving graph of annual trading volumes among major countries from 1995 through 2010. Please see the accompanying video for a demo of our prototype.1

اسناد مشابه

  • Visualizing and Interacting with Time-Evolving Graphs

    سند علمی۲۰۱۷Lisa Jin

    Large, time-evolving graphs can be directly and indirectly observed in a variety of phenomena across domains. Speci€cally, for following the evolution of communities over time, applications can range from tracking modules in protein-protein interaction networks [10] to groups in

  • Time-Evolving Graph Processing on Commodity Clusters

    سند علمی۲۰۱۷Anand Padmanabha Iyer

    Graph-structured data is on the rise, in size, complexity and dynamism [1]. This growth has spurred the development of a large number of graph processing systems [5, 6, 8, 10– 12, 14, 16–18, 21, 24–27, 29] in both academia and opensource community. By leveraging specialized abstr

  • Fast Nearest Neighbor Search on Large Time-Evolving Graphs

    سند علمی۲۰۱۴ECML/PKDDLeman Akoglu, Rohit Khandekar, Vibhore Kumar, Srinivasan Parthasarathy

    Finding the k nearest neighbors (k-nns) of a given vertex in a graph has many applications such as link prediction, keyword search, and image tagging. One robust measure of vertex-proximity in graphs is the Personalized Page Rank (ppr) score based on random walk with restarts. Si

  • Mining Interesting Patterns and Rules in a Time-evolving Graph

    سند علمی۲۰۱۱Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa

    Time-evolving graphs, i.e. dynamic networks changing their structures with time, are becoming ubiquitous recently. A typical example is an email communication network whose vertex corresponds to an individual and whose edge corresponds to an email communication within a time peri

  • Time-Evolving Graph Convolutional Recurrent Network for Traffic Prediction

    مقاله‌ی دسترسی آزاد۲۰۲۲Applied sciences['Weimin Mai', 'Junxin Chen', 'Xiang Chen', '']

    Accurate traffic prediction is crucial to the construction of intelligent transportation systems. This task remains challenging because complicated and dynamic spatiotemporal dependency in networks. While various graph-based networks have been proposed for prediction, most them r

  • Real-Time Diameter Monitoring for Time-Evolving Graphs

    سند علمی۲۰۱۱DASFAAYasuhiro Fujiwara, Makoto Onizuka, Masaru Kitsuregawa

    The goal of this work is to identify the diameter, the maximum distance between any two nodes, of graphs that evolve over time. This problem is useful for many applications such as improving the quality of P2P networks. Our solution, G-Scale, can track the diameter of time-evolvi