Alessio Arleo

Alessio Arleo
TU Wien | TU Wien · Centre for Visual Analytics Science & Technology

PhD in Computer and Industrial Engineering
Post-Doctoral Researcher at Centre of Visual Analytics Science and Technology - TU Wien

About

29
Publications
5,178
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
140
Citations

Publications

Publications (29)
Preprint
Full-text available
Dynamic networks reflect temporal changes occurring to the graph's structure and are used to model a wide variety of problems in many application fields. We investigate the design space of dynamic graph visualization along two major dimensions: the network structural and temporal representation. Significant research has been conducted evaluating th...
Article
Full-text available
In social networks, individuals’ decisions are strongly influenced by recommendations from their friends, acquaintances, and favorite renowned personalities. The popularity of online social networking platforms makes them the prime venues to advertise products and promote opinions. The Influence Maximization (IM) problem entails selecting a seed se...
Preprint
Full-text available
Temporal networks can naturally model real‐world complex phenomena such as contact networks, information dissemination and physical proximity. However, nodes and edges bear real‐time coordinates, making it difficult to organize them into discrete timeslices, without a loss of temporal information due to projection. Event‐based dynamic graph drawing...
Article
Full-text available
To exploit the potential of immersive network analytics for engaging and effective exploration, we promote the metaphor of "egocentrism", where data depiction and interaction are adapted to the perspective of the user within a 3D network. Egocentrism has the potential to overcome some of the inherent downsides of virtual environments, e.g., visual...
Preprint
Full-text available
To exploit the potential of immersive network analytics for engaging and effective exploration, we promote the metaphor of "egocentrism", where data depiction and interaction are adapted to the perspective of the user within a 3D network. Egocentrism has the potential to overcome some of the inherent downsides of virtual environments, e.g., visual...
Preprint
Full-text available
Providing guidance during a Visual Analytics session can support analysts in pursuing their goals more efficiently. However, the effectiveness of guidance depends on many factors: Determining the right timing to provide it is one of them. Although in complex analysis scenarios choosing the right timing could make the difference between a dependable...
Conference Paper
Full-text available
The timeslice is the predominant method for drawing and visualizing dynamic graphs. However, when nodes and edges have real coordinates along the time axis, it becomes difficult to organize them into discrete timeslices, without a loss of temporal information due to projection. Event-based dynamic graph drawing rejects the notion of a timeslice and...
Article
Full-text available
The economy of a country can be modeled as a complex system in which several players buy and sell goods from each other. By analyzing the investment flows, it is possible to reconstruct the supply chain for the production of most goods, whose understanding is important to analysts and public officials interested in creating and evaluating strategie...
Preprint
Full-text available
In social networks, individuals' decisions are strongly influenced by recommendations from their friends and acquaintances. The influence maximization (IM) problem asks to select a seed set of users that maximizes the influence spread, i.e., the expected number of users influenced through a stochastic diffusion process triggered by the seeds. In th...
Chapter
In social networks, individuals’ decisions are strongly influenced by recommendations from their friends and acquaintances. The influence maximization (IM) problem asks to select a seed set of users that maximizes the influence spread, i.e., the expected number of users influenced through a stochastic diffusion process triggered by the seeds. In th...
Preprint
Full-text available
Analysis of large dynamic networks is a thriving research field, typically relying on 2D graph representations. The advent of affordable head mounted displays however, sparked new interest in the potential of 3D visualization for immersive network analytics. Nevertheless, most solutions do not scale well with the number of nodes and edges and rely...
Preprint
Full-text available
Investment planning requires knowledge of the financial landscape on a large scale, both in terms of geo-spatial and industry sector distribution. There is plenty of data available, but it is scattered across heterogeneous sources (newspapers, open data, etc.), which makes it difficult for financial analysts to understand the big picture. In this p...
Conference Paper
Knowledge of monetary flow between firms can give a significant advantage both from a profit or research point of view. So-called firm-to-firm transaction networks are valuable in analyzing a market or an economy. However, such detailed and complete data is seldom available. In this work, we aim at supporting economists by reusing available financi...
Article
Full-text available
The Curriculum Vitae (CV, also referred to as “résumé”) is an established representation of a person's academic and professional history. A typical CV is comprised of multiple sections associated with spatio‐temporal, nominal, hierarchical, and ordinal data. The main task of a recruiter is, given a job application with specific requirements, to com...
Article
The use of graph visualization approaches to present and analyze complex data is taking a leading role in conveying information and knowledge to users in many application domains. This creates the need of developing efficient and effective algorithms that automatically compute graph layouts. In this respect, force-directed algorithms are arguably a...
Article
Analyzing large-scale graphs provides valuable insights in different application scenarios, including social networking, crime detection, content ranking, and recommendations. While many graph processing systems working on top of distributed infrastructures have been proposed to deal with big graphs, the task of profiling their massive computations...
Article
Full-text available
Analyzing large-scale graphs provides valuable insights in different application scenarios. While many graph processing systems working on top of distributed infrastructures have been proposed to deal with big graphs, the tasks of profiling and debugging their massive computations remain time consuming and error-prone. This paper presents GiViP, a...
Article
Big Data analytics is recognized as one of the major issues in our current information society, and raises several challenges and opportunities in many fields, including economy and finance, e-commerce, public health and administration, national security, and scientific research. The use of visualization techniques to make sense of large volumes of...
Conference Paper
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane \(z=0\) and edges are unobstructed lines of sight parallel to the x- or y-axis. We prove that: (i) Every complete bipartite graph admits a 2.5D-BR; (ii) The complete graph \(K_n\) admits a 2.5D-BR if and o...
Conference Paper
The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS infrastructures rather than buying and maintaining complex and expensive hardware. So far, only...
Article
Full-text available
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane $z=0$ and edges are unobstructed lines of sight parallel to the $x$- or $y$-axis. We prove that: $(i)$ Every complete bipartite graph admits a 2.5D-BR; $(ii)$ The complete graph $K_n$ admits a 2.5D-BR if a...
Article
Full-text available
The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS infrastructures rather than buying and maintaining complex and expensive hardware. So far, only...
Article
Full-text available
In this paper we study the problem of designing a distributed graph visualization algorithm for large graphs. The algorithm must be simple to implement and the computing infrastructure must not require major hardware or software investments. We design, implement, and experiment a force-directed algorithm in Giraph, a popular open source framework f...
Conference Paper
In this paper we study the problem of designing a graph drawing algorithm for large graphs. The algorithm must be simple to implement and the computing infrastructure must not require major hardware or software investments. We report about the experimental analysis of a simple implementation of a spring embedder in Giraph, a vertex-centric open sou...

Network

Cited By

Projects

Projects (3)
Project
Visualization of Diffusion Processes over Networks
Project
Continuous-time Dynamic Network Visualization