Cheick Tidiane Ba

dblp:247/1543 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
8since 2021 · last 2025
0000-0002-4035-7464ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Mining a Decade of Event Impacts on Contributor Dynamics in Ethereum: A Longitudinal Study
abstract
We analyze developer activity across 10 major Ethereum repositories (totaling 129884 commits, 40550 issues) spanning 10 years to examine how events such as technical upgrades, market events, and community decisions impact development. Through statistical, survival, and network analyses, we find that technical events prompt increased activity before the event, followed by reduced commit rates afterwards, whereas market events lead to more reactive development. Core infrastructure repositories like Go-Ethereum exhibit faster issue resolution compared to developer tools, and technical events enhance core team collaboration. Our findings show how different types of events shape development dynamics, offering insights for project managers and developers in maintaining development momentum through major transitions. This work contributes to understanding the resilience of development communities and their adaptation to ecosystem changes.
Matteo Vaccargiu, Sabrina Aufiero, Cheick Tidiane Ba, Silvia Bartolucci, Richard G. Clegg, Daniel Graziotin, Rumyana Neykova, Roberto Tonelli, Giuseppe Destefanis
MSR3
2025 Analyzing User Migration in Blockchain Online Social Networks through Network Structure and Discussion Topics of Communities on Multilayer Networks
abstract
User migration (i.e., the movement of large sets of users from one online social platform to another one) is one of the main phenomena occurring in modern online social networks and even involves the most recent alternative paradigms of online social networks, such as blockchain-based online social networks. In these platforms, user migration mainly occurs through hard forks of the supporting blockchain (i.e., a split of the original blockchain and the creation of an alternative blockchain), to which users may decide to migrate. However, our understanding of user migration and its mechanisms is still limited, particularly regarding the role of densely connected user groups (communities) during migration and fork events. Are there differences between users who stay and those who decide to leave, in terms of network structure and discussion topics? In this work, we show, through network-based analysis centered on the identification of communities on multilayer networks and text mining that (a) the “position” of a group within the network of social and economic interactions is connected to the likelihood of a group to migrate (i.e., marginal groups are more likely to leave); (b) group network structure is also important, as users in densely connected groups interacting through monetary transactions are more likely to stay; (c) users who leave are characterized by different discussion topics; and (d) user groups interacting through monetary transactions show interest in migration-related content if they are going to leave. These findings highlight the importance of social and economic relationships between users during a user migration caused by fork events In general, in the larger context of online social media, it motivates the need to investigate user migration through a network-inspired approach based on groups and specific subgraphs while leveraging user-generated content, at the same time.
Cheick Tidiane Ba, Manuel Dileo, Alessia Galdeman, Matteo Zignani, Sabrina Gaito
Distributed Ledger Technol. Res. Pract.1
2025 MARA: A deep learning based framework for multilayer graph simplification
abstract
In many scientific fields, complex systems are characterized by a multitude of heterogeneous interactions/relationships that are challenging to model. Multilayer graphs constitute valuable tools that can represent such complex systems, thus making possible their analysis for downstream decision-making processes. Nevertheless, modeling such complex information still remains challenging in real-world scenarios. On the one hand, holistically including all relationships may lead to noisy or computationally intensive graphs. On the other hand, limiting the amount of information to model through the selection of a portion of the available relationships can introduce boundary specification biases. However, the current research studies are demonstrating that it is more beneficial to retain as much information as possible and at a later stage perform graph simplification i.e., removing uninformative or redundant parts of the graph to facilitate the final analysis. While simplification strategies, based on deep learning methods, have been already extensively explored in the context of single-layer graphs, only a limited amount of efforts have been devoted to simplification strategies for multilayer graphs. In this work, we propose the MultilAyer gRaph simplificAtion ( MARA ) framework, a GNN-based approach designed to simplify multilayer graphs based on the downstream task. MARA generates node embeddings for a specific task by training jointly two main components: (i) an edge simplification module and (ii) a (multilayer) graph neural network. We tested MARA on different real-world multilayer graphs for node classification tasks. Experimental results show the effectiveness of the proposed approach: MARA reduces the dimension of the input graph while keeping and even improving the performance of node classification tasks in different domains and across graphs characterized by different structures. Moreover, deep learning-based simplification allows MARA to preserve and enhance important graph properties for the downstream task. To our knowledge, MARA represents the first simplification framework especially tailored for multilayer graphs analysis.
Cheick Tidiane Ba, Roberto Interdonato, Dino Ienco, Sabrina Gaito
Neurocomputing1
2025 Investigating the Luna-Terra Collapse through the Temporal Multilayer Graph Structure of the Ethereum Stablecoin Ecosystem
abstract
Blockchain technology and cryptocurrencies have garnered considerable attention over the past 15 years. The term Web3 (sometimes Web 3.0) has been coined to define a possible direction for the web based on the use of decentralisation via blockchain. Cryptocurrencies are characterised by high market volatility and susceptibility to substantial crashes, issues that require temporal analysis methodologies able to tackle the high temporal resolution, heterogeneity, and scale of blockchain data. While existing research attempts to analyse crash events, fundamental questions persist regarding the optimal timescale for analysis, differentiation between long-term and short-term trends, and the identification and characterisation of shock events within these decentralised systems. This article addresses these issues by examining cryptocurrencies traded on the Ethereum blockchain, with a spotlight on the crash of the stablecoin TerraUSD (UST) and the currency LUNA designed to stabilise it. Utilising complex network analysis and a multi-layer temporal graph allows the study of the correlations between the layers representing the currencies and system evolution across diverse timescales. The investigation sheds light on the strong interconnections among stablecoins pre-crash and the significant post-crash transformations. We identify anomalous signals before, during, and after the collapse, emphasising their impact on graph structure metrics and user movement across layers. This article is novel in its use of temporal, cross-chain graph analysis to explore a cryptocurrency collapse. It emphasises the importance of temporal analysis for studies on web-derived data. In addition, the methodology shows how graph-based analysis can enhance traditional econometric results. Overall, this research carries implications beyond its field, for example, for regulatory agencies aiming to safeguard users could use multi-layer temporal graphs as part of their suite of analysis tools.
Cheick Tidiane Ba, Benjamin A. Steer, Matteo Zignani, Richard G. Clegg
ACM Trans. Web1
2025 Exploring Time-Ordered Triadic Closure in Online Social Networks
abstract
Online social platforms for digital communication necessitate an in-depth understanding of their evolving dynamics, especially after the renewal requests brought about by new paradigms, such as Web3. The dynamics within online social networks (OSNs) are influenced by numerous factors, encompassing user behavior, content generation, platform features, and technological advancements, with triadic closure standing out as a prominent and influential element. In this study, we focus on the temporal aspects of triadic closure and its role in the evolution of OSNs, especially after the advent of the Web3 paradigm. By analyzing networks with timestamped links from diverse platforms based on different architectures, including communication, Web3-based, and trade networks, we developed a comprehensive analytical pipeline to support the study of triadic closure patterns. This pipeline includes an algorithm for the census of time-ordered triads, a vector-based model for representing growing networks (growth triadic profile), the identification of triadic closure rules (TERs), and the evaluation of the speed of the formation of closed triads. Our findings reveal significant variations in the impact of triadic closure across different OSNs, marked by diverse growth triadic profiles and varying formation speeds of closed triads as well as diversity in the predictability of evolutionary patterns based on triads. This study not only enhances the comprehension of triadic closure in the temporal evolution of OSNs but also provides valuable insights to be taken into account for the design and administration of online social platforms.
Alessia Galdeman, Cheick Tidiane Ba, Matteo Zignani, Sabrina Gaito
ACM Trans. Web2
2023 Cooperative behavior in blockchain-based complementary currency networks through time: The Sarafu case study
abstract
The effort to reach the 17 Sustainable Development Goals by the United Nations has incentivized the adoption of IT solutions in many fields. Many systems for sustainable economic development are now relying on a digital form making them more accessible and provides the access to new functionalities. A very interesting example of such systems are complementary currencies i.e. cooperative currency systems that support national economies to provide humanitarian aid and promote sustainable development. While there are many studies on the principles and case studies of successful complementary currencies, many aspects are still unexplored, especially regarding cooperative behavior. Cooperative behavior in these systems is a key aspect, as complementary currencies are often born out of cooperation among members that face a period of crisis or they usually have the objective of creating bonds of reciprocity and integrating social networks between people, which should lead to increased cooperation. However, there is a lack of studies on many aspects of cooperative behavior in complementary currencies, such as how such behavior changes over time, especially in times of a crisis like the COVID-19 pandemic. Moreover how cooperation behavior is affected by time and different geographical locations is still unclear. In this work, we analyze Sarafu, a complementary currency that went digital and now relies on blockchain technology. Sarafu is a successful case of a complementary currency that was used for humanitarian aid during the COVID-19 pandemic. Moreover, Sarafu is a perfect case study for the study of cooperative behavior, as it implements a special type of account, the group account, to support cooperation groups. This feature supports the study of group dynamics and behavior. What we find is that Sarafu users exhibit strong reliance on cooperation groups; we also observe that the interaction of users and cooperation groups is influenced by both time and geographical location. The study of group accounts and in general mechanisms that promote cooperation can be useful for other humanitarian or community development projects. Moreover, similar cooperation enhancers could have an important role in other social development projects, and in general, in any setting where there is a strong need to foster cooperation for reaching social good.
Cheick Tidiane Ba, Matteo Zignani, Sabrina Gaito
Future Gener. Comput. Syst.1
2022 Link Prediction with Text in Online Social Networks: The Role of Textual Content on High-Resolution Temporal Data
Manuel Dileo, Cheick Tidiane Ba, Matteo Zignani, Sabrina Gaito
DS2
2021 A Multilayer Network Perspective on Customer Segmentation Through Cashless Payment Data
abstract
Customer segmentation is a central problem in different business processes. In the last few years, it is also becoming important for banking and financial institutions given the ever-growing volume of cashless payments. When dealing with customer segmentation with transactional data, the clustering approach is widely used. In this work, we propose a different modeling approach for customer segmentation based on a graph-based representation. Specifically, we reformulate customer segmentation as a community detection problem on a similarity multi-layer network, where each layer depends on a specific cashless payment method. We introduce a vector-based representation of the cardholders' spending patterns, namely the purchase profile, to build the similarity multi-layer network. The profiles capture how customers allocate their spending capacity among merchant categories through different payment systems. From purchase profiles, we evaluate the similarity of the cardholders in terms of consumption allocation and we infer different similarity graphs based on credit and debit card payments. Different segmentation strategies based on multi-layer community detection methods have been evaluated on a large-scale dataset of credit and debit card transactions of a banking group. Since one of the main goals is verifying the feasibility of graph-based approaches for customer segmentation, we discuss the outcomes of the methods in terms of explainability of the resulting segments. Specifically, methods based on random walks, such as Infomap, return more stable and insightful results than modularity-based ones, in different settings. To sum up, we experiment with community detection algorithms to cope with the customer segmentation problem starting from a large set of credit and debit card transactions. The outcome of the solutions may support recently developed methods for bank risk assessment based on clients' behavior or targeted applications for cashless payment management.
Alessia Galdeman, Cheick Tidiane Ba, Matteo Zignani, Sabrina Gaito
DSAA2
2019 UNIPred-Web: a web tool for the integration and visualization of biomolecular networks for protein function prediction
abstract
BACKGROUND: One of the main issues in the automated protein function prediction (AFP) problem is the integration of multiple networked data sources. The UNIPred algorithm was thereby proposed to efficiently integrate -in a function-specific fashion- the protein networks by taking into account the imbalance that characterizes protein annotations, and to subsequently predict novel hypotheses about unannotated proteins. UNIPred is publicly available as R code, which might result of limited usage for non-expert users. Moreover, its application requires efforts in the acquisition and preparation of the networks to be integrated. Finally, the UNIPred source code does not handle the visualization of the resulting consensus network, whereas suitable views of the network topology are necessary to explore and interpret existing protein relationships. RESULTS: We address the aforementioned issues by proposing UNIPred-Web, a user-friendly Web tool for the application of the UNIPred algorithm to a variety of biomolecular networks, already supplied by the system, and for the visualization and exploration of protein networks. We support different organisms and different types of networks -e.g., co-expression, shared domains and physical interaction networks. Users are supported in the different phases of the process, ranging from the selection of the networks and the protein function to be predicted, to the navigation of the integrated network. The system also supports the upload of user-defined protein networks. The vertex-centric and the highly interactive approach of UNIPred-Web allow a narrow exploration of specific proteins, and an interactive analysis of large sub-networks with only a few mouse clicks. CONCLUSIONS: UNIPred-Web offers a practical and intuitive (visual) guidance to biologists interested in gaining insights into protein biomolecular functions. UNIPred-Web provides facilities for the integration of networks, and supplies a framework for the imbalance-aware protein network integration of nine organisms, the prediction of thousands of GO protein functions, and a easy-to-use graphical interface for the visual analysis, navigation and interpretation of the integrated networks and of the functional predictions.
Paolo Perlasca, Marco Frasca 0001, Cheick Tidiane Ba, Marco Notaro, Alessandro Petrini, Elena Casiraghi, Giuliano Grossi, Jessica Gliozzo, Giorgio Valentini, Marco Mesiti
BMC Bioinform.3