June 2018
·
3 Reads
·
2 Citations
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
June 2018
·
3 Reads
·
2 Citations
August 2017
·
103 Reads
·
14 Citations
October 2014
·
157 Reads
·
36 Citations
June 2014
·
9,739 Reads
·
2,790 Citations
Gephi is a network visualization software used in various disciplines (social network analysis, biology, genomics…). One of its key features is the ability to display the spatialization process, aiming at transforming the network into a map, and ForceAtlas2 is its default layout algorithm. The latter is developed by the Gephi team as an all-around solution to Gephi users' typical networks (scale-free, 10 to 10,000 nodes). We present here for the first time its functioning and settings. ForceAtlas2 is a force-directed layout close to other algorithms used for network spatialization. We do not claim a theoretical advance but an attempt to integrate different techniques such as the Barnes Hut simulation, degree-dependent repulsive force, and local and global adaptive temperatures. It is designed for the Gephi user experience (it is a continuous algorithm), and we explain which constraints it implies. The algorithm benefits from much feedback and is developed in order to provide many possibilities through its settings. We lay out its complete functioning for the users who need a precise understanding of its behaviour, from the formulas to graphic illustration of the result. We propose a benchmark for our compromise between performance and quality. We also explain why we integrated its various features and discuss our design choices.
January 2014
·
18 Reads
·
2 Citations
Complex networks may be studied in various ways, e.g., by analyzing the evolutions of their topologies over time, and in particular of their community structures. In this paper, we focus on another type of dynamics, related to diffusion processes on these networks. Indeed, our work aims at characterizing network dynamics from the diffusion point of view, and reciprocally, it evaluates the impact of graph dynamics on diffusion. We propose in this paper an innovative approach based on the notion of intrinsic time, where the time unit corresponds to the appearance of a new link in the graph. This original notion of time allows us to somehow isolate the diffusion phenomenon from the evolution of the network. The objective is to compare the diffusion features observed with this intrinsic time concept from those obtained with traditional (extrinsic) time, based on seconds. The comparison of these time concepts is easily understandable yet completely new in the study of diffusion phenomena. We experiment our approach on three real datasets and show the promising results of intrinsic time-based diffusion analysis.
September 2013
·
148 Reads
Lecture Notes in Computer Science
Social bookmarking systems have recently received an increasing attention in both academic and industrial communities. This success is owed to their ease of use that relies on a simple intuitive process, allowing their users to label diverse resources with freely chosen keywords aka tags. The obtained collections are known under the nickname of Folksonomy. In this paper, we introduce a new approach dedicated to the visualization of large folksonomies, based on the ”intersecting” minimal transversals. The main thrust of such an approach is the proposal of a reduced set of ”key” nodes of the folksonomy from which the remaining nodes would be faithfully retrieved. Thus, the user could navigate in the folksonomy through a folding/unfolding process.
September 2013
·
1,244 Reads
·
8 Citations
This paper describes the design of Knot, a digital tool for exploring historical social networks, developed within a multidisciplinary research context involving designers, humanities scholars and computer scientists. The goal of the tool is to provide scholars and researchers with an environment for exploring multi-dimensional and heterogeneous data, allowing them to discover and create explicit and implicit relationships between people, places and events. What distinguishes our approach to traditional network exploration and analysis is an emphasis on the construction of the network graph through the visual interface, rather than on its static observation. Knot aims to explore new opportunities for interface design and information visualization within the definition of novel research practices in the humanities, bringing together scholars, HCI, design, and computer science communities.
August 2013
·
43 Reads
·
12 Citations
Diffusion phenomena occur in many kinds of real-world complex networks, e.g., biological, information or social networks. Because of this diversity, several types of diffusion models have been proposed in the literature: epidemiological models, threshold models, innovation adoption models, among others. Many studies aim at investigating diffusion as an evolving phenomenon but mostly occurring on static networks, and much remains to be done to understand diffusion on evolving networks. In order to study the impact of graph dynamics on diffusion, we propose in this paper an innovative approach based on a notion of intrinsic time, where the time unit corresponds to the appearance of a new link in the graph. This original notion of time allows us to isolate somehow the diffusion phenomenon from the evolution of the network. The objective is to compare the diffusion features observed with this intrinsic time concept from those obtained with traditional (extrinsic) time, based on seconds. The comparison of these time concepts is easily understandable yet completely new in the study of diffusion phenomena. We experiment our approach on synthetic graphs, as well as on a dataset extracted from the Github sofware sharing platform.
July 2013
·
289 Reads
·
59 Citations
Platforms which combine data mining algorithms and interactive visualizations play a key role in the discovery process from complex networks data, e.g. Web and Online Social Networks data. Here we illustrate the use of Gephi, an open source software for networks visual exploration, for the visual analysis of Business Intelligence data modeled as complex networks.
May 2013
·
18 Reads
... We used R version 4.0.5 (R Core Team, 2021), R package stringr (Wickham and RStudio, 2019), OpenRefine (Ham, 2013), and Gephi 0.9.2 (Bastian et al., 2009;Heymann, 2018) for text processing, data management, and analyses. ...
June 2018
... Statistical analyses were performed in XLSTAT [42] and PAST version 4.13 [36]. Network analysis was carried out using Gephi 0.9 with AxisForce 2 algorithm based on an "n-standardized" data matrix [43]. The statistical approach presented here was used in a previous study [3]. ...
March 2009
Proceedings of the International AAAI Conference on Web and Social Media
... We will observe how the different communities we measure may reflect this division. Communities of this episode are illustrated in Figs. 8 and 9 and with Gephi (Heymann 2014) for SW3 only, all other episodes are also illustrated in the Additional file 1. ...
August 2017
... 'grafos'), such as 'Gephi' (www.gephi.org)-data visualization and exploration software (Heymann, 2014). Graph-of-word was utilized, as it is a type of visualization that generates a graph representation of texts by considering the order and distance of the words (Skianis, Rousseau, & Vazirgiannis, 2016). ...
October 2014
... De plus, ces di érences nous permettent d'évaluer la pertinence de notre dé nition du temps intrinsèque au regard de la dynamique du graphe. Ces travaux ont été publiés dans [Albano, 2011], [Albano et al., 2012], [Albano et al., 2013] et [Albano et al., 2014a]. ...
January 2014
... Websites such as Sourceforge or Github have provided a privileged field for such studies. In this field, bipartite graphs are used to study technology adoption [18], information diffusion between different projects [41], to predict future engagement of developers to new projects [42] or to identify patterns of interaction between users and Web sites [43]. ...
May 2013
... VNA is an established method based on employing an algorithm through which strongly connected nodes are situated closer together, and weakly connected nodes further apart (Decuypere 2019). We here employ the force-directed algorithm ForceAtlas2 (Jacomy et al. 2014) for generating the network visualization, which simulates a physical system of centripetal and centrifugal forces to spatialize the network. This allows us to use the visualizations as powerful and flexible ways to analyse the structure of relations. ...
June 2014
... Lastly, although not pertaining explicitly to IM, we briefly discuss Albano et al. (2013). This work studies the relationship between graph topological evolution and diffusion processes by analyzing which part of the diffusion is owed to the diffusion mechanism, and which to graph dynamics. ...
August 2013
... Many data-based detection mechanisms are using artificial intelligence approaches, e.g., support vector data description [11], neural autoencoders [12], k-nearest-neighbors, decision trees, support vector machines, naive Bayes and random forest methods [13], deep neural network models [14,15], genetic or evolutionary algorithms [16], Bayesian networks [17], or machine learning [18]. One can also use classifiers based on statistical properties [19][20][21]. The method described in [22] uses a fusion, adaptive, cubature Kalman filter. ...
May 2012
... In Aldrich (2015) the course prerequisite network at Benedictine University is encoded as a DAG visualized in Gephi (Heymann and Le Grand 2013), and some well known network science statistics are presented in relation to corresponding curricular questions. For example, node centralities express the roles of courses acting as hubs (degree centrality) or bridges (betweenness centrality) in the overall curriculum structure, while path lengths of prerequisite chains within a program yield lower bounds for completion time. ...
July 2013