Paola Valdivia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Paola Valdivia has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Fabiano Petronetto
Federal University of Espírito Santo
6 shared publications- Fabio Dias
Department of Mechanical & Industrial Engineering University of Toronto Toronto ON Canada
4 shared publications - Alcebiades Dal Col
UFES
3 shared publications - Jean-Daniel Fekete
Université Paris-Saclay, CNRS, Inria, Orsay, France
3 shared publications - Luis Gustavo Nonato
Institute of Mathematical and Computer Sciences, University of São Paulo, São Carlos, Brazil
3 shared publications - Alexis Pister
University of Edinburgh
2 shared publications
Latest Publications
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 42 (4) , 89-102
VAST 2020 Contest Challenge: GraphMatchMaker—Visual Analytics for Graph Comparison and Matching
We report on the process and design for our visual analytics graph analysis challenge winning entry. Specifically, our team addressed the IEEE VAST 2020 Mini-Challenge 1 that asked participants to identify a group of people that accidentally caused an internet outage. To identify this group we were given a network profile and a large multi-variate social network to search in. Our approach involved statistical and graphical analysis as well as the design of three custom visual analytics tools. The submitted solution and visualizations are available at https://graphletmatchmaker.github.io/.
- 23 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 42 (4) , 89-102
VAST 2020 Contest Challenge: GraphMatchMaker—Visual Analytics for Graph Comparison and Matching
We report on the process and design for our visual analytics graph analysis challenge winning entry. Specifically, our team addressed the IEEE VAST 2020 Mini-Challenge 1 that asked participants to identify a group of people that accidentally caused an internet outage. To identify this group we were given a network profile and a large multi-variate social network to search in. Our approach involved statistical and graphical analysis as well as the design of three custom visual analytics tools. The submitted solution and visualizations are available at https://graphletmatchmaker.github.io/.
- Open Access
- 23 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (2) , 1775-1785
Integrating Prior Knowledge in Mixed-Initiative Social Network Clustering
We propose a new approach—called PK-clustering—to help social scientists create meaningful clusters in social networks. Many clustering algorithms exist but most social scientists find them difficult to understand, and tools do not provide any guidance to choose algorithms, or to evaluate results taking into account the prior knowledge of the scientists. Our work introduces a new clustering approach and a visual analytics user interface that address this issue. It is based on a process that 1) captures the prior knowledge of the scientists as a set of incomplete clusters, 2) runs multiple clustering algorithms (similarly to clustering ensemble methods), 3) visualizes the results of all the algorithms ranked and summarized by how well each algorithm matches the prior knowledge, 4) evaluates the consensus between user-selected algorithms and 5) allows users to review details and iteratively update the acquired knowledge. We describe our approach using an initial functional prototype, then provide two examples of use and early feedback from social scientists. We believe our clustering approach offers a novel constructive method to iteratively build knowledge while avoiding being overly influenced by the results of often randomly selected black-box clustering algorithms.
- 23 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (2) , 1775-1785
Open AccessIntegrating Prior Knowledge in Mixed-Initiative Social Network Clustering
We propose a new approach—called PK-clustering—to help social scientists create meaningful clusters in social networks. Many clustering algorithms exist but most social scientists find them difficult to understand, and tools do not provide any guidance to choose algorithms, or to evaluate results taking into account the prior knowledge of the scientists. Our work introduces a new clustering approach and a visual analytics user interface that address this issue. It is based on a process that 1) captures the prior knowledge of the scientists as a set of incomplete clusters, 2) runs multiple clustering algorithms (similarly to clustering ensemble methods), 3) visualizes the results of all the algorithms ranked and summarized by how well each algorithm matches the prior knowledge, 4) evaluates the consensus between user-selected algorithms and 5) allows users to review details and iteratively update the acquired knowledge. We describe our approach using an initial functional prototype, then provide two examples of use and early feedback from social scientists. We believe our clustering approach offers a novel constructive method to iteratively build knowledge while avoiding being overly influenced by the results of often randomly selected black-box clustering algorithms.
- 6 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (1) , 1-13
Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization
Parallel Aggregated Ordered Hypergraph (PAOH) is a novel technique to visualize dynamic hypergraphs. Hypergraphs are a generalization of graphs where edges can connect several vertices. Hypergraphs can be used to model networks of business partners or co-authorship networks with multiple authors per article. A dynamic hypergraph evolves over discrete time slots. PAOH represents vertices as parallel horizontal bars and hyperedges as vertical lines, using dots to depict the connections to one or more vertices. We describe a prototype implementation of Parallel Aggregated Ordered Hypergraph, report on a usability study with 9 participants analyzing publication data, and summarize the improvements made. Two case studies and several examples are provided. We believe that PAOH is the first technique to provide a highly readable representation of dynamic hypergraphs. It is easy to learn and well suited for medium size dynamic hypergraphs (50-500 vertices) such as those commonly generated by digital humanities projects-our driving application domain.
- 6 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 27 (1) , 1-13
Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization
Parallel Aggregated Ordered Hypergraph (PAOH) is a novel technique to visualize dynamic hypergraphs. Hypergraphs are a generalization of graphs where edges can connect several vertices. Hypergraphs can be used to model networks of business partners or co-authorship networks with multiple authors per article. A dynamic hypergraph evolves over discrete time slots. PAOH represents vertices as parallel horizontal bars and hyperedges as vertical lines, using dots to depict the connections to one or more vertices. We describe a prototype implementation of Parallel Aggregated Ordered Hypergraph, report on a usability study with 9 participants analyzing publication data, and summarize the improvements made. Two case studies and several examples are provided. We believe that PAOH is the first technique to provide a highly readable representation of dynamic hypergraphs. It is easy to learn and well suited for medium size dynamic hypergraphs (50-500 vertices) such as those commonly generated by digital humanities projects-our driving application domain.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 345-352
Graph Spectral Filtering for Network Simplification
Visualization is an important tool in the analysis and understanding of networks and their content. However, visualization tools face major challenges when dealing with large networks, mainly due to visual clutter. In this context, network simplification has been a main alternative to handle massive networks, reducing complexity while preserving relevant patterns of the network structure and content. In this paper we propose a methodology that rely on Graph Signal Processing theory to filter multivariate data associated to network nodes, assisting and enhancing network simplification and visualization tasks. The simplification process takes into account both topological and multivariate data associated to network nodes to create a hierarchical representation of the network. The effectiveness of the proposed methodology is assessed through a comprehensive set of quantitative evaluation and comparisons, which gauge the impact of the proposed filtering process in the simplification and visualization tasks.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 345-352
Graph Spectral Filtering for Network Simplification
Visualization is an important tool in the analysis and understanding of networks and their content. However, visualization tools face major challenges when dealing with large networks, mainly due to visual clutter. In this context, network simplification has been a main alternative to handle massive networks, reducing complexity while preserving relevant patterns of the network structure and content. In this paper we propose a methodology that rely on Graph Signal Processing theory to filter multivariate data associated to network nodes, assisting and enhancing network simplification and visualization tasks. The simplification process takes into account both topological and multivariate data associated to network nodes to create a hierarchical representation of the network. The effectiveness of the proposed methodology is assessed through a comprehensive set of quantitative evaluation and comparisons, which gauge the impact of the proposed filtering process in the simplification and visualization tasks.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 19 (5) , 85-91
Wavelet-Based Visual Analysis for Data Exploration
The conventional wavelet transform is widely used in image and signal processing, where a signal is decomposed into a combination of known signals. By analyzing the individual contributions, the behavior of the original signal can be inferred. In this article, the authors present an introductory overview of the extension of this theory into graphs domains. They review the graph Fourier transform and graph wavelet transforms that are based on dictionaries of graph spectral filters, namely, spectral graph wavelet transforms. Then, the main features of the graph wavelet transforms are presented using real and synthetic data.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computing in Science & Engineering
- Vol. 19 (5) , 85-91
Wavelet-Based Visual Analysis for Data Exploration
The conventional wavelet transform is widely used in image and signal processing, where a signal is decomposed into a combination of known signals. By analyzing the individual contributions, the behavior of the original signal can be inferred. In this article, the authors present an introductory overview of the extension of this theory into graphs domains. They review the graph Fourier transform and graph wavelet transforms that are based on dictionaries of graph spectral filters, namely, spectral graph wavelet transforms. Then, the main features of the graph wavelet transforms are presented using real and synthetic data.
- 29 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 24 (8) , 2456-2469
Wavelet-Based Visual Analysis of Dynamic Networks
Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns overtime. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.
- 29 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Visualization and Computer Graphics
- Vol. 24 (8) , 2456-2469
Wavelet-Based Visual Analysis of Dynamic Networks
Dynamic networks naturally appear in a multitude of applications from different fields. Analyzing and exploring dynamic networks in order to understand and detect patterns and phenomena is challenging, fostering the development of new methodologies, particularly in the field of visual analytics. In this work, we propose a novel visual analytics methodology for dynamic networks, which relies on the spectral graph wavelet theory. We enable the automatic analysis of a signal defined on the nodes of the network, making viable the robust detection of network properties. Specifically, we use a fast approximation of a graph wavelet transform to derive a set of wavelet coefficients, which are then used to identify activity patterns on large networks, including their temporal recurrence. The coefficients naturally encode the spatial and temporal variations of the signal, leading to an efficient and meaningful representation. This methodology allows for the exploration of the structural evolution of the network and their patterns overtime. The effectiveness of our approach is demonstrated using usage scenarios and comparisons involving real dynamic networks.
- Open Access
- 12 April 2017
- Published by Springer Nature
- p. 211-221
Watersheds on Hypergraphs for Data Clustering
- 12 April 2017
- Published by Springer Nature
- p. 211-221
Open AccessWatersheds on Hypergraphs for Data Clustering
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Wavelet-based visualization of time-varying data on graphs
Visualizing time-varying data defined on the nodes of a graph is a challenging problem that has been faced with different approaches. Although techniques based on aggregation, topology, and topic modeling have proven their usefulness, the visual analysis of smooth and/or abrupt data variations as well as the evolution of such variations over time are aspects not properly tackled by existing methods. In this work we propose a novel visualization methodology that relies on graph wavelet theory and stacked graph metaphor to enable the visual analysis of time-varying data defined on the nodes of a graph. The proposed method is able to identify regions where data presents abrupt and mild spacial and/or temporal variation while still been able to show how such changes evolve over time, making the identification of events an easier task. The usefulness of our approach is shown through a set of results using synthetic as well as a real data set involving taxi trips in downtown Manhattan. The methodology was able to reveal interesting phenomena and events such as the identification of specific locations with abrupt variation in the number of taxi pickups.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Wavelet-based visualization of time-varying data on graphs
Visualizing time-varying data defined on the nodes of a graph is a challenging problem that has been faced with different approaches. Although techniques based on aggregation, topology, and topic modeling have proven their usefulness, the visual analysis of smooth and/or abrupt data variations as well as the evolution of such variations over time are aspects not properly tackled by existing methods. In this work we propose a novel visualization methodology that relies on graph wavelet theory and stacked graph metaphor to enable the visual analysis of time-varying data defined on the nodes of a graph. The proposed method is able to identify regions where data presents abrupt and mild spacial and/or temporal variation while still been able to show how such changes evolve over time, making the identification of events an easier task. The usefulness of our approach is shown through a set of results using synthetic as well as a real data set involving taxi trips in downtown Manhattan. The methodology was able to reveal interesting phenomena and events such as the identification of specific locations with abrupt variation in the number of taxi pickups.