Here’s a list of my publications in reversed chronological order. For a complete and updated list visit my Scholar or DBLP profile.
2025
Personality Disorders
Mapping personality traits: A network approach to uncovering Personality Inventory for Diagnostic and Statistical Manual of Mental Disorders, fifth edition, Brief Form’s factorial structure.
L. Oppici,Â
A. Antelmi,Â
C. Mazza,Â
M. Monaro,Â
F. Bosco,Â
and P. Roma
Personality Disorders: Theory, Research, and Treatment.
This study explores the structural properties of the Personality Inventory for the Diagnostic and Statistical Manual of Mental Disorders, fifth edition, Brief Form (PID-5-BF) by applying network analysis and com- munity detection as a data-driven alternative to traditional factor models. Traditionally, the PID-5-BF assesses personality traits across five domains—Negative Affectivity, Detachment, Antagonism, Disinhibition, and Psychoticism—but has shown notable inconsistencies in item alignment and factorial coherence. To examine these issues, data were collected from 2,766 Italian participants (71.7% female, 28.3% male, Mage = 32.94 years, SD = 13.2). The estimated network revealed a stable structure, supported by robust centrality measures (closeness = 0.59, expected influence = 0.75, strength = 0.75). Community detection identified five empirically coherent clusters—Disinhibition, Demoralization, Detachment and Irritability, Psychosocial Alienation, and Pathological Egocentrism—suggesting an alternative organization of maladaptive traits in this population. To assess generalizability, a second analysis was conducted on a Hungarian sample (N = 355), yielding a five-structure solution with different item compositions. While the network approach emphasizes item-level associations, the specific configurations varied across samples in ways that reflect contextual influences. Nonetheless, this method offers complementary insights to tradi- tional factorial models, highlighting how personality traits may organize differently across populations and supporting the use of network-based approaches in refining dimensional models of personality pathology.
@article{Oppici_APA_2025,author={Oppici, L. and Antelmi, A. and Mazza, C. and Monaro, M. and Bosco, F. and Roma, P.},title={Mapping personality traits: A network approach to uncovering Personality Inventory for Diagnostic and Statistical Manual of Mental Disorders, fifth edition, Brief Form's factorial structure.},journal={Personality Disorders: Theory, Research, and Treatment},year={2025},publisher={Educational Publishing Foundation},address={US},pages={},doi={10.1037/per0000745},abbr={Personality Disorders},bibtex_show={true},url={https://awspntest.apa.org/doiLanding?doi=10.1037%2Fper0000745},pdf={https://iris.unito.it/retrieve/6bec7013-9c4a-4992-97d9-5f8c470ff7b6/Oppici_PD_2025_OA.pdf}}
SNAM
Characterizing swing voters in online social media: the case of the 2022 Italian elections
The global proliferation of social media platforms has transformed political communication, making the study of online interactions between politicians and voters crucial for understanding contemporary political discourse. In this work, we present a methodological framework for modeling and examining the dynamics of political messaging and voter behavior in online social media. We propose a nuanced categorization of voters who changed their political preferences over time (i.e., swing voters) based on their shifting patterns, as well as a characterization of their susceptibility to propaganda messages. Drawing on the case of the 2022 Italian elections on Twitter, our analysis reveals that during election periods, politicians’ popularity increases, accompanied by notable variations in the use of persuasive language techniques, including doubt, loaded language, appeals to values, and slogans. Swing voters demonstrate higher vulnerability to these propaganda techniques compared to non-swing voters, with distinct vulnerability patterns across various types of political shifts. These findings highlight the nuanced impact of social media on political opinion formation, contributing to a deeper understanding of the interplay between digital political communication and online voter behavior in contemporary democracies.
@article{Antelmi_SNAM_2025,author={Antelmi, A. and La Cava, Lucio and Pera, Arianna},title={Characterizing swing voters in online social media: the case of the 2022 Italian elections},journal={Social Network Analysis and Mining},year={2025},volume={15},number={1},pages={77},issn={1869-5469},doi={10.1007/s13278-025-01457-4},abbr={SNAM},bibtex_show={true},url={https://link.springer.com/article/10.1007/s13278-025-01457-4},pdf={https://link.springer.com/content/pdf/10.1007/s13278-025-01457-4.pdf},code={https://github.com/ariannap13/hidden-swing-voters}}
KDD
Hypergraph Motif Representation Learning
A. Antelmi,Â
G. Cordasco,Â
D. De Vinco,Â
V. Di Pasquale,Â
M. Polato,Â
and C. Spagnuolo
In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1.
Hypergraphs have emerged as a powerful tool for representing high-order connections in real-world complex systems. Similar to graphs, local structural patterns in hypergraphs, known as high-order motifs (h-motifs), play a crucial role in network dynamics and serve as fundamental building blocks across various domains. For this reason, predicting h-motifs can be highly beneficial in different fields. In this paper, we aim to advance our understanding of such complex high-order dynamics by introducing and formalizing the problem of h-motifs prediction. To address this task, we propose a novel solution that leverages both high-order and pairwise information by combining hypergraph and graph convolutions to capture hyperedges correlation within h-motifs, along with an innovative negative sampling approach designed to generate close-to-positive negative samples. To evaluate the effectiveness of our approach, we defined several baselines inspired by existing literature on hyperedge prediction methods. Our extensive experimental assessments demonstrate that our approach consistently outperforms all the considered baselines, showcasing its superior performance and robustness in predicting h-motifs.
@inproceedings{Antelmi_KDD_2025,author={Antelmi, A. and Cordasco, G. and De Vinco, D. and Di Pasquale, V. and Polato, M. and Spagnuolo, C.},title={Hypergraph Motif Representation Learning},year={2025},isbn={9798400712456},publisher={Association for Computing Machinery},address={New York, NY, USA},doi={10.1145/3690624.3709274},booktitle={Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1},pages={13–24},numpages={12},series={KDD '25},abbr={KDD},bibtex_show={true},url={https://dl.acm.org/doi/10.1145/3690624.3709274},pdf={https://dl.acm.org/doi/epdf/10.1145/3690624.3709274},code={https://github.com/hypernetwork-research-group/motif_representation_learning}}
TEL4FC @ MIS4TEL
Empowering Data Literacy Among High School Learners
A. Antelmi,Â
and P. Esposito
In Methodologies and Intelligent Systems for Technology Enhanced Learning, Workshops - 14th International Conference.
Abstract. The growing accessibility of (linked) open data offers a rich opportunity for stakeholders to harness their potential value. Nonetheless, significant obstacles like inadequate technical skills and a lack of awareness hinder their effective utilization. As a result, there is a pressing need for learners to cultivate competencies in data and information literacy, which are integral components of 21st-century skill sets. To foster discussion on initiatives to raise awareness of linked open data and enhance users’ capabilities to work with them, we proposed a workshop to introduce Italian high school learners to retrieve information from encyclopedic sources modeled as knowledge graphs. Specifically, the workshop guided the learners through the process of querying the Wikidata endpoint via KGSnap!, a block-based programming interface that allows lay users to build and run queries over a SPARQL endpoint. This article describes the activities of the workshop, delineating its protocol, participants, and outcomes. The results indicate that participants were highly engaged and achieved accurate results in the assigned tasks within a short timeframe, suggesting promising expectations for further initiatives in this domain.
@inproceedings{Antelmi_TEL4FC_2024,address={Cham},author={Antelmi, A. and Esposito, P.},booktitle={Methodologies and Intelligent Systems for Technology Enhanced Learning, Workshops - 14th International Conference},isbn={978-3-031-85561-0},doi={10.1007/978-3-031-85561-0_17},pages={204--215},publisher={Springer Nature Switzerland},title={Empowering Data Literacy Among High School Learners},year={2025},abbr={TEL4FC @ MIS4TEL},bibtex_show={true},url={https://link.springer.com/chapter/10.1007/978-3-031-85561-0_17},pdf={https://iris.unito.it/retrieve/018c3414-f684-486d-81db-279e7c97735b/2024_TEL4FC_KGSnap_and_BIMED.pdf}}
2024
Voila @ ISWC
KGSnap! in Practice: a Block-based Programming Environment for Enabling Knowledge Graph Literacy
A. Antelmi,Â
V. Offertuucci,Â
and M.A. Pellegrino
In Proceedings of the 9th International Workshop on the Visualization and Interaction for Ontologies, Linked Data and Knowledge Graphs, co-located with the 23rd International Semantic Web Conference (ISWC 2024).
The growing availability of (linked) open data requires lay users to master how to deal with data effectively, yet SPARQL presents a barrier to leveraging data represented as knowledge graphs. As the block programming paradigm has been successfully used to teach programming skills, we demonstrate how to use KGSnap!, an extension of the block-based programming environment Snap!, to foster knowledge graph literacy among individuals lacking expertise in query languages. This work mainly focuses on the visualization and interaction aspects of KGSnap!, a visual SPARQL query builder, when experienced by users without expertise in the Semantic Web technologies. The reported experience is discussed as a learning-by-doing protocol aimed at facilitating the reproducibility and transparency of the performed evaluation. KGSnap! ease of use has been verified by 14 Snap! experts and 24 high-school learners. The findings indicate that lay users perceived it as a promising approach to acquaint themselves with knowledge graphs.
@inproceedings{Antelmi_Voila_2024,author={Antelmi, A. and Offertuucci, V. and Pellegrino, M.A.},title={{KGSnap! in Practice: a Block-based Programming Environment for Enabling Knowledge Graph Literacy}},year={2024},booktitle={Proceedings of the 9th International Workshop on the Visualization and Interaction for Ontologies, Linked Data and Knowledge Graphs, co-located with the 23rd International Semantic Web Conference (ISWC 2024)},publisher={CEUR Workshop Proceedings},volume={3773},pages={1-8},abbr={Voila @ ISWC},bibtex_show={true},url={https://ceur-ws.org/Vol-3773/paper6.pdf},pdf={https://ceur-ws.org/Vol-3773/paper6.pdf},code={https://isislab-unisa.github.io/Snap/snap.html}}
BigHPC
High-Performance Computation on a Rust-based distributed ABM engine
D. De Vinco,Â
A. Tranquillo,Â
A. Antelmi,Â
C. Spagnuolo,Â
and V. Scarano.
In BigHPC2024: Special Track on Big Data and High-Performance Computing, co-located with the 3rd Italian Conference on Big Data and Data Science (ITADATA2024).
An agent-based model (ABM) is a computational model for simulating autonomous agents’ actions and interactions to understand a system’s behavior and what governs its outcomes. When the data or number of agents grow or multiple runs are necessary, agent-based simulations are generally computationally costly. Therefore, adopting different computing paradigms, such as the distributed one, is essential to manage long-running simulations. The main problem with this approach is finding a way to distribute and balance the simulation field so that the agents can move from one machine to another with the least amount of synchronization overhead. Based on our experiences, we present a Rust-based ABM engine capable of distributing models on high-performance computing resources, gaining remarkable speedup against the sequential version.
@inproceedings{DeVinco_BigHPC_2024,author={Vinco, D. De and Tranquillo, A. and Antelmi, A. and Spagnuolo, C. and Scarano., V.},title={{High-Performance Computation on a Rust-based distributed ABM engine}},year={2024},booktitle={BigHPC2024: Special Track on Big Data and High-Performance Computing, co-located with the 3rd Italian Conference on Big Data and Data Science (ITADATA2024)},publisher={CEUR Workshop Proceedings},volume={3785},pages={1-8},abbr={BigHPC},bibtex_show={true},url={https://ceur-ws.org/Vol-3785/paper124.pdf},pdf={https://ceur-ws.org/Vol-3785/paper124.pdf},code={https://github.com/krabmaga/krabmaga/}}
KDD
A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guide
S. Kim,Â
S. Y. Lee,Â
Y. Gao,Â
A. Antelmi,Â
M. Polato,Â
and K. Shin
In Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
Higher-order interactions (HOIs) are ubiquitous in real-world complex systems and applications. Investigation of deep learning for HOIs, thus, has become a valuable agenda for the data mining and machine learning communities. As networks of HOIs are expressed mathematically as hypergraphs, hypergraph neural networks (HNNs) have emerged as a powerful tool for representation learning on hypergraphs. Given the emerging trend, we present the first survey dedicated to HNNs, with an in-depth and step-by-step guide. Broadly, the present survey overviews HNN architectures, training strategies, and applications. First, we break existing HNNs down into four design components: (i) input features, (ii) input structures, (iii) message-passing schemes, and (iv) training strategies. Second, we examine how HNNs address and learn HOIs with each of their components. Third, we overview the recent applications of HNNs in recommendation, bioinformatics and medical science, time series analysis, and computer vision. Lastly, we conclude with a discussion on limitations and future directions.
@inproceedings{Kim_KDD_2024,author={Kim, S. and Lee, S. Y. and Gao, Y. and Antelmi, A. and Polato, M. and Shin, K.},title={A Survey on Hypergraph Neural Networks: An In-Depth and Step-By-Step Guide},year={2024},publisher={Association for Computing Machinery},address={New York, NY, USA},doi={10.1145/3637528.3671457},booktitle={Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining},pages={6534–6544},numpages={11},series={KDD '24},abbr={KDD},bibtex_show={true},url={https://dl.acm.org/doi/10.1145/3637528.3671457},pdf={https://dl.acm.org/doi/epdf/10.1145/3637528.3671457}}
WAW
HypergraphRepository: A Community-driven and Interactive Hypernetwork Data Collection
Hypergraph research has been thriving over the past few years, with a growing interest in a plethora of domains. Despite this remarkable surge, the lack of a comprehensive platform for searching and downloading diverse and well-curated datasets poses a significant obstacle to the continued advancement of the field. This absence hinders the ability of researchers and practitioners to validate and benchmark their hypergraph algorithms and models effectively. To bridge this gap, we present HypergraphRepository, a web-based data collection aiming to serve as a centralized hub for hypergraph datasets, fostering collaboration and knowledge exchange within the hypergraph research community. In this paper, we detail the platform’s architecture, features, and the collaborative framework it offers. HypergraphRepository is a GitHub-based open-source project.
@inproceedings{Antelmi_WAW_2024,author={Antelmi, A. and De Vinco, D. and Spagnuolo, C.},title={HypergraphRepository: A Community-driven and Interactive Hypernetwork Data Collection},booktitle={Modelling and Mining Networks},year={2024},publisher={Springer Nature Switzerland},address={Cham},pages={159--173},doi={10.1007/978-3-031-59205-8_11},isbn={978-3-031-59205-8},abbr={WAW},bibtex_show={true},url={https://link.springer.com/chapter/10.1007/978-3-031-59205-8_11},pdf={https://iris.unito.it/retrieve/027477af-7bf1-46aa-8299-50e1923c1581/Antelmi_WAW2024.pdf},code={https://hypergraphrepository.di.unisa.it/}}
JSUPE
Analyzing FOSS license usage in publicly available software at scale via the SWH-analytics framework
Alessia Antelmi,Â
Massimo Torquati,Â
Giacomo Corridori,Â
Daniele Gregori,Â
Francesco Polzella,Â
Gianmarco Spinatelli,Â
and Marco Aldinucci
The Software Heritage (SWH) dataset represents an invaluable source of open-source code as it aims to collect, preserve, and share all publicly available software in source code form ever produced by humankind. Although designed to archive deduplicated small files thanks to the use of a Merkle tree as the underlying data structure, querying the SWH dataset presents challenges due to the nature of these structures, which organize content based on hash values rather than any locality principle. The magnitude of the repository, coupled with the resource-intensive nature of the download process, highlights the need for specialized infrastructure and computational resources to effectively handle and study the extensive dataset housed within SWH. Currently, there is a lack of infrastructures specifically tailored for running analytics on the SWH dataset, leaving users to handle these issues manually. To address these challenges, we implemented the SWH-Analytics (SWHA) framework, a development environment that transparently runs custom analytic applications on publicly available software data preserved over time by SWH. Specifically, this work shows how SWHA can be effectively exploited to study usage patterns of free and open-source software licenses, highlighting the need to improve license literacy among developers.
@article{Antelmi2024,author={Antelmi, Alessia and Torquati, Massimo and Corridori, Giacomo and Gregori, Daniele and Polzella, Francesco and Spinatelli, Gianmarco and Aldinucci, Marco},title={Analyzing FOSS license usage in publicly available software at scale via the SWH-analytics framework},journal={The Journal of Supercomputing},year={2024},month=apr,day={06},issn={1573-0484},abbr={JSUPE},bibtex_show={true},doi={10.1007/s11227-024-06069-x},url={https://doi.org/10.1007/s11227-024-06069-x},pdf={https://link.springer.com/epdf/10.1007/s11227-024-06069-x?sharing_token=zItbOjvK5h_769TobtzkVPe4RwlQNchNByi7wbcMAY7XKwSKwIoas8xd0No4nEdMQV_q1p5AR7I_8PJSz4wdp9B6ERF9ZTG5vNMRreQ0o1PeCo_OpTJJu_sZ6HX3rWGiI-c_uFlCRGX9DRhU6WDKu6-71FmoMcY5yb6RyLLYNQM%3D},code={https://github.com/alpha-unito/Software-Heritage-Analytics}}
JASSS
Reliable and Efficient Agent-Based Modeling and Simulation
Alessia Antelmi,Â
Pasquale Caramante,Â
Gennaro Cordasco,Â
Giuseppe D’Ambrosio,Â
Daniele De Vinco,Â
Francesco Foglia,Â
Luca Postiglione,Â
and Carmine Spagnuolo
Journal of Artificial Societies and Social Simulation.
Agent-based models represent a primary methodology to untangle and study complex systems. Over the last decade, the need for more elaborate computing-demanding models gave rise to many frameworks and tools to run ABM simulations. Current state-of-the-art ABM tools either focus on ease of use, performance, or a trade-off between these two elements. Still, efficiency-oriented solutions (required for both large and small-scale simulations) are vulnerable to memory flaws which could invalidate the experiment results. This work aims to merge efficiency, reliability, and safeness under an innovative ABM software framework based on the Rust programming language. Our framework, krABMaga, is an open-source library that offers a high-level environment by exploiting metaprogramming and expandable visualization features. We equipped our library with a dynamic simulation monitoring system and model exploration and optimization capabilities over parallel, distributed, and cloud architectures. After having presented the overall architecture and functionalities of krABMaga, we discuss a performance comparison of our framework against the mostly adopted ABM software and the scalability potential of our simulation engine on a model calibration experiment running over an AWS EC2 virtual cluster machine. All code and examples models are available on GitHub.
@article{Spagnuolo_JASSS_2024,title={Reliable and Efficient Agent-Based Modeling and Simulation},author={Antelmi, Alessia and Caramante, Pasquale and Cordasco, Gennaro and D'Ambrosio, Giuseppe and De Vinco, Daniele and Foglia, Francesco and Postiglione, Luca and Spagnuolo, Carmine},journal={Journal of Artificial Societies and Social Simulation},issn={1460-7425},volume={27},number={2},pages={4},year={2024},url={http://jasss.soc.surrey.ac.uk/27/2/4.html},doi={10.18564/jasss.5300},abbr={JASSS},bibtex_show={true},pdf={https://jasss.soc.surrey.ac.uk/admin/get_pdf.php?source=https://www.jasss.org/27/2/4.html},code={https://github.com/krABMaga/krABMaga},keywords={Agent-Based Model, Agent-Based Simulation Engine, Model Exploration and Optimization, Reliability and Efficiency, Open-Source}}
2023
TheWebConf
The Age of Snippet Programming: Toward Understanding Developer Communities in Stack Overflow and Reddit
Alessia Antelmi,Â
Gennaro Cordasco,Â
Daniele De Vinco,Â
and Carmine Spagnuolo
In Companion Proceedings of the ACM Web Conference 2023.
Today, coding skills are among the most required competencies worldwide, often also for non-computer scientists. Because of this trend, community contribution-based, question-and-answer (Q&A) platforms became prominent for finding the proper solution to all programming issues. Stack Overflow has been the most popular platform for technical-related questions for years. Still, recently, some programming-related subreddits of Reddit have become a standing stone for questions and discussions. This work investigates the developers’ behavior and community formation around the twenty most popular programming languages. We examined two consecutive years of programming-related questions from Stack Overflow and Reddit, performing a longitudinal study on users’ posting activity and their high-order interaction patterns abstracted via hypergraphs. Our analysis highlighted crucial differences in how these Q&A platforms are utilized by their users. In line with previous literature, it emphasized the constant decline of Stack Overflow in favor of more community-friendly platforms, such as Reddit, which has been growing rapidly lately.
@inproceedings{Antelmi_TheWebConf_2023,author={Antelmi, Alessia and Cordasco, Gennaro and Vinco, Daniele De and Spagnuolo, Carmine},title={The Age of Snippet Programming: Toward Understanding Developer Communities in Stack Overflow and Reddit},year={2023},isbn={9781450394192},publisher={Association for Computing Machinery},address={New York, NY, USA},doi={10.1145/3543873.3587673},html={https://doi.org/10.1145/3543873.3587673},booktitle={Companion Proceedings of the ACM Web Conference 2023},pages={1218–1224},numpages={7},keywords={Developer communities, Hypergraphs, Network Analysis, Q&A social platforms, Reddit, Stack Overflow, User behavior},series={WWW '23 Companion},abbr={TheWebConf},bibtex_show={true},pdf={publications/Antelmi_TheWebConf_2023.pdf},code={https://github.com/ddevin96/DevCommunities}}
ITADATA
The SWH-Analytics Framework
Alessia Antelmi,Â
Massimo Torquati,Â
Daniele Gregori,Â
Francesco Polzella,Â
Gianmarco Spinatelli,Â
and Marco Aldinucci
In Companion Proceedings of the ACM Web Conference 2023.
@conference{Antelmi_ITADATA_2023,author={Antelmi, Alessia and Torquati, Massimo and Gregori, Daniele and Polzella, Francesco and Spinatelli, Gianmarco and Aldinucci, Marco},title={The SWH-Analytics Framework},year={2023},journal={CEUR Workshop Proceedings},volume={3606},html={https://ceur-ws.org/Vol-3606/},pdf={publications/Antelmi_ITADATA_2023.pdf},abbr={ITADATA},month=sep,bibtex_show={true},code={https://github.com/alpha-unito/Software-Heritage-Analytics}}
MIS4TEL
Engagement in Open Data Workshops
Alessia Antelmi
In Methodologies and Intelligent Systems for Technology Enhanced Learning, Workshops - 13th International Conference.
The increasing availability of Open Data gives birth to a fertile field for interested stakeholders to create value out of them; however, limited technical expertise and poor awareness are crucial barriers to their exploitation. Because of these reasons, there is an urge for learners to acquire data and information literacy competencies, which are essential for 21st-century skills, and become familiar with available Open Data sources and their potential uses. To promote the dialogue around activities to boost recognition of Open Data and improve users’ skills to work with them, we proposed a series of workshops to introduce Italian high school learners to searching for, authoring, and building effective communication based on Open Data. This article describes an ongoing activity and details its organization, reports preliminary results on learners’ engagement, and discusses both challenges of the remote setting as well as promising learning outcomes.
@inproceedings{Antelmi_TEL4FC_2023,author={Antelmi, Alessia},title={Engagement in Open Data Workshops},booktitle={Methodologies and Intelligent Systems for Technology Enhanced Learning, Workshops - 13th International Conference},year={2023},publisher={Springer Nature Switzerland},address={Cham},pages={332--342},isbn={978-3-031-42134-1},doi={10.1007/978-3-031-42134-1_33},pdf={publications/Antelmi_TEL4FC_2023.pdf},abbr={MIS4TEL},month=jun,bibtex_show={true},html={https://link.springer.com/chapter/10.1007/978-3-031-42134-1_33}}
CSUR
A Survey on Hypergraph Representation Learning
Alessia Antelmi,Â
Gennaro Cordasco,Â
Mirko Polato,Â
Vittorio Scarano,Â
Carmine Spagnuolo,Â
and Dingqi Yang
Hypergraphs have attracted increasing attention in recent years thanks to their flexibility in naturally modeling a broad range of systems where high-order relationships exist among their interacting parts. This survey reviews the newly born hypergraph representation learning problem, whose goal is to learn a function to project objects—most commonly nodes—of an input hyper-network into a latent space such that both the structural and relational properties of the network can be encoded and preserved. We provide a thorough overview of existing literature and offer a new taxonomy of hypergraph embedding methods by identifying three main families of techniques, i.e., spectral, proximity-preserving, and (deep) neural networks. For each family, we describe its characteristics and our insights in a single yet flexible framework and then discuss the peculiarities of individual methods, as well as their pros and cons. We then review the main tasks, datasets, and settings in which hypergraph embeddings are typically used. We finally identify and discuss open challenges that would inspire further research in this field.
@article{Antelmi_CSUR_2023,author={Antelmi, Alessia and Cordasco, Gennaro and Polato, Mirko and Scarano, Vittorio and Spagnuolo, Carmine and Yang, Dingqi},title={A Survey on Hypergraph Representation Learning},year={2023},issue_date={January 2024},publisher={Association for Computing Machinery},address={New York, NY, USA},volume={56},number={1},issn={0360-0300},html={https://doi.org/10.1145/3605776},doi={10.1145/3605776},journal={ACM Computing Surveys},month=aug,articleno={24},numpages={38},abbr={CSUR},bibtex_show={true},code={https://github.com/alessant/HEE},pdf={publications/Antelmi_CSUR_2023.pdf},supp={publications/Antelmi_CSUR_2023_supp.pdf}}
Open Data are published to let interested stakeholders exploit data and create value out of them, but limited technical skills are a crucial barrier. Learners are invited to develop data and information literacy according to 21st-century skills and become aware of open data sources and what they can do with the data. They are encouraged to learn how to analyse and exploit data, transform data into information by visualisation, and effectively communicate data insights. This paper presents a systematic literature review of initiatives to let K-12 learners familiarise themselves with Open Data. This review encompasses a total of 21 papers that met the inclusion criteria organising them in taxonomies according to the used data format, the adopted approach, and the expected learning outcome. The discussion compares the included initiative and points out challenges that should be overcome to advance the dialogue around Open Data at school.
@conference{Pellegrino_CSEDU_2023,author={Pellegrino, Maria Angela and Antelmi, Alessia},title={At School of Open Data: A Literature Review},booktitle={Proceedings of the 15th International Conference on Computer Supported Education - Volume 2: CSEDU,},year={2023},pages={172-183},publisher={SciTePress},organization={INSTICC},doi={10.5220/0011747500003470},isbn={978-989-758-641-5},bibtex_show={true},abbr={CSEDU},html={https://www.scitepress.org/Papers/2023/117475/117475.pdf},pdf={publications/Pellegrino_CSEDU_2023.pdf}}
APS
Experimenting with Agent-Based Model Simulation Tools
Alessia Antelmi,Â
Gennaro Cordasco,Â
Giuseppe D’Ambrosio,Â
Daniele De Vinco,Â
and Carmine Spagnuolo
Agent-based models (ABMs) are one of the most effective and successful methods for analyzing real-world complex systems by investigating how modeling interactions on the individual level (i.e., micro-level) leads to the understanding of emergent phenomena on the system level (i.e., macro-level). ABMs represent an interdisciplinary approach to examining complex systems, and the heterogeneous background of ABM users demands comprehensive, easy-to-use, and efficient environments to develop ABM simulations. Currently, many tools, frameworks, and libraries exist, each with its characteristics and objectives. This article aims to guide newcomers in the jungle of ABM tools toward choosing the right tool for their skills and needs. This work proposes a thorough overview of open-source general-purpose ABM tools and offers a comparison from a two-fold perspective. We first describe an off-the-shelf evaluation by considering each ABM tool’s features, ease of use, and efficiency according to its authors. Then, we provide a hands-on evaluation of some ABM tools by judging the effort required in developing and running four ABM models and the obtained performance.
@article{Dambrosio_APS_2022,author={Antelmi, Alessia and Cordasco, Gennaro and D'Ambrosio, Giuseppe and De Vinco, Daniele and Spagnuolo, Carmine},title={Experimenting with Agent-Based Model Simulation Tools},journal={Applied Sciences},volume={13},year={2023},number={1},article-number={13},url={https://www.mdpi.com/2076-3417/13/1/13},issn={2076-3417},doi={10.3390/app13010013},bibtex_show={true},abbr={APS},html={https://www.mdpi.com/2076-3417/13/1/13},month=jan,pdf={publications/Dambrosio_APS_2022.pdf},code={https://github.com/isislab-unisa/ABM_Comparison}}
2022
IEEE Access
A Volunteer Computing Architecture for Computational Workflows on Decentralized Web
Alessia Antelmi,Â
Giuseppe D’Ambrosio,Â
Andrea Petta,Â
Luigi Serra,Â
and Carmine Spagnuolo
The amount of accessible computational devices over the Internet offers an enormous but latent computational power. Nonetheless, the complexity of orchestrating and managing such devices requires dedicated architectures and tools and hinders the exploitation of this vast processing capacity. Over the last years, the paradigm of (Browser-based) Volunteer Computing emerged as a unique approach to harnessing such computational capabilities, leveraging the idea of voluntarily offering resources. This article proposes VFuse, a groundbreaking architecture to exploit the Browser-based Volunteer Computing paradigm via a ready-to-access volunteer network. VFuse offers a modern multi-language programming environment for developing scientific workflows using WebAssembly technology without requiring the user any local installation or configuration. We equipped our architecture with a secure and transparent rewarding mechanism based on blockchain technology (Ethereum) and distributed P2P file system (IPFS). Further, the use of Non-Fungible Tokens provides a unique, secure, and transparent methodology for recognizing the users’ participation in the network. We developed a prototype of the proposed architecture and four example applications implemented with our system. All code and examples are publicly available on GitHub.
@article{Serra_IEEEAccess_2022,author={Antelmi, Alessia and D'Ambrosio, Giuseppe and Petta, Andrea and Serra, Luigi and Spagnuolo, Carmine},journal={IEEE Access},title={A Volunteer Computing Architecture for Computational Workflows on Decentralized Web},year={2022},volume={10},number={},pages={98993-99010},doi={10.1109/ACCESS.2022.3207167},bibtex_show={true},abbr={IEEE Access},html={https://ieeexplore.ieee.org/abstract/document/9893800},month=sep,pdf={publications/Serra_IEEEAccess_2022.pdf},code={https://github.com/luigser/js-vfuse}}
ODAK
Open Data Literacy by Remote: Hiccups and Lessons
Alessia Antelmi,Â
and Maria Angela Pellegrino
In Proceedings of the Symposium on Open Data and Knowledge for a Post-Pandemic Era ODAK22, UK (ODAK 2022).
Open Data are published to ensure the creation of value and data exploitation, but limited technical skills are a critical barrier. Most users lack the skills required to assess data quality and its fitness to use, awareness of open data sources, and what they can do with the data. To advance the dialogue around methods to increase awareness of Open Data, improve users’ skills to work with them, and deal with the requirement of letting future citizens develop data and information literacy according to 21st-century skills, this article proposes a series of workshops to let Italian high school learners familiarise themselves with effective communication based on Open Data. The article describes an ongoing activity, reporting preliminary results on engagement and learning. We discuss challenges in engaging learners remotely and the promising learning outcomes achieved by overcoming cultural and technical barriers to visualise Open Data.
@inproceedings{Antelmi_ODAK_2022,author={Antelmi, Alessia and Pellegrino, Maria Angela},booktitle={Proceedings of the Symposium on Open Data and Knowledge for a Post-Pandemic Era ODAK22, UK (ODAK 2022)},title={Open Data Literacy by Remote: Hiccups and Lessons},year={2022},volume={},number={},pages={1-5},doi={10.14236/ewic/ODAK22.7},abbr={ODAK},bibtex_show={true},html={https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/ODAK22.7},month=jul,pdf={publications/Antelmi_ODAK_2022.pdf}}
2021
IEEE Access
Modeling and Evaluating Epidemic Control Strategies With High-Order Temporal Networks
Alessia Antelmi,Â
Gennaro Cordasco,Â
Vittorio Scarano,Â
and Carmine Spagnuolo
Non-Pharmaceutical Interventions (NPIs) are essential measures that reduce and control a severe outbreak or a pandemic, especially in the absence of drug treatments. However, estimating and evaluating their impact on society remains challenging, considering the numerous and closely tied aspects to examine. This article proposes a fine-grain modeling methodology for NPIs, based on high-order relationships between people and environments, mimicking direct and indirect contagion pathways over time. After assessing the ability of each intervention in controlling an epidemic propagation, we devise a multi-objective optimization framework, which, based on the epidemiological data, calculates the NPI combination that should be implemented to minimize the spread of an epidemic as well as the damage due to the intervention. Each intervention is thus evaluated through an agent-based simulation, considering not only the reduction in the fraction of infected but also to what extent its application damages the daily life of the population. We run experiments on three data sets, and the results illustrate how the application of NPIs should be tailored to the specific epidemic situation. They further highlight the critical importance of correctly implementing personal protective (e.g., using face masks) and sanitization measures to slow down a pathogen spreading, especially in crowded places.
@article{Antelmi_IEEEAccess_2021,author={Antelmi, Alessia and Cordasco, Gennaro and Scarano, Vittorio and Spagnuolo, Carmine},journal={IEEE Access},title={Modeling and Evaluating Epidemic Control Strategies With High-Order Temporal Networks},year={2021},volume={9},number={},pages={140938-140964},doi={10.1109/ACCESS.2021.3119459},abbr={IEEE Access},bibtex_show={true},html={https://ieeexplore.ieee.org/document/9567682},month=sep,code={https://github.com/alessant/HGEpidemics},pdf={publications/Antelmi_IEEEAccess_2021.pdf}}
IEEE CoG
Comparing the Structures and Characteristics of Different Game Social Networks - The Steam Case
Enrica Loria,Â
Alessia Antelmi,Â
and Johanna Pirker
In most games, social connections are an essential part of the gaming experience. Players connect in communities inside or around games and form friendships, which can be translated into other games or even in the real world. Recent research has investigated social phenomena within the player social network of several multiplayer games, yet we still know very little about how these networks are shaped and formed. Specifically, we are unaware of how the game type and its mechanics are related to its community structure and how those structures vary in different games. This paper presents an initial analysis of Steam users and how friendships on Steam are formed around 200 games. We examine the friendship graphs of these 200 games by dividing them into clusters to compare their network properties and their specific characteristics (e.g., genre, game elements, and mechanics). We found how the Steam user-defined tags better characterized the clusters than the game genre, suggesting that how players perceive and use the game also reflects how they connect in the community. Moreover, team-based games are associated with more cohesive and clustered networks than games with a stronger single-player focus, supporting the idea that playing together in teams more likely produces social capital (i.e., Steam friendships).
@inproceedings{Loria_Cog_2021,author={Loria, Enrica and Antelmi, Alessia and Pirker, Johanna},booktitle={2021 IEEE Conference on Games (CoG)},title={Comparing the Structures and Characteristics of Different Game Social Networks - The Steam Case},year={2021},volume={},number={},pages={1-8},doi={10.1109/CoG52621.2021.9619130},abbr={IEEE CoG},bibtex_show={true},html={https://ieeexplore.ieee.org/abstract/document/9619130},month=aug,pdf={publications/Loria_CoG_2021.pdf}}
Entropy
Social Influence Maximization in Hypergraphs
Alessia Antelmi,Â
Gennaro Cordasco,Â
Carmine Spagnuolo,Â
and Przemyslaw Szufel
This work deals with a generalization of the minimum Target Set Selection (TSS) problem, a key algorithmic question in information diffusion research due to its potential commercial value. Firstly proposed by Kempe et al., the TSS problem is based on a linear threshold diffusion model defined on an input graph with node thresholds, quantifying the hardness to influence each node. The goal is to find the smaller set of items that can influence the whole network according to the diffusion model defined. This study generalizes the TSS problem on networks characterized by many-to-many relationships modeled via hypergraphs. Specifically, we introduce a linear threshold diffusion process on such structures, which evolves as follows. Let H=(V,E) be a hypergraph. At the beginning of the process, the nodes in a given set S⊆V are influenced. Then, at each iteration, (i) the influenced hyperedges set is augmented by all edges having a sufficiently large number of influenced nodes; (ii) consequently, the set of influenced nodes is enlarged by all the nodes having a sufficiently large number of already influenced hyperedges. The process ends when no new nodes can be influenced. Exploiting this diffusion model, we define the minimum Target Set Selection problem on hypergraphs (TSSH). Being the problem NP-hard (as it generalizes the TSS problem), we introduce four heuristics and provide an extensive evaluation on real-world networks.
@article{Antelmi_Entropy_2021,author={Antelmi, Alessia and Cordasco, Gennaro and Spagnuolo, Carmine and Szufel, Przemyslaw},title={Social Influence Maximization in Hypergraphs},journal={Entropy},volume={23},year={2021},number={7},article-number={796},doi={10.3390/e23070796},abbr={Entropy},bibtex_show={true},html={https://www.mdpi.com/1099-4300/23/7/796?type=check_update&version=1},month=mar,code={https://github.com/pszufe/LTMSim.jl},pdf={publications/Antelmi_Entropy_2021.pdf}}
2020
WAW
Information Diffusion in Complex Networks: A Model Based on Hypergraphs and Its Analysis
Alessia Antelmi,Â
Gennaro Cordasco,Â
Carmine Spagnuolo,Â
and Przemyslaw Szufel
In Algorithms and Models for the Web Graph, WAW’20.
This work introduces the problem of social influence diffusion in complex networks, where vertices are linked not only through simple pairwise relationships to other nodes but with groups of nodes of arbitrary size. A challenging problem that arises in this domain is to determine a small subset of nodes S (a target-set) able to spread their influence in the whole network. This problem has been formalized and studied in different ways, and many viable solutions have been found for graphs. These have been applied to study several phenomena in research fields such as social, economic, biological, and physical sciences.
@inproceedings{Antelmi_WAW_2020,author={Antelmi, Alessia and Cordasco, Gennaro and Spagnuolo, Carmine and Szufel, Przemyslaw},title={Information Diffusion in Complex Networks: A Model Based on Hypergraphs and Its Analysis},booktitle={Algorithms and Models for the Web Graph, WAW'20},year={2020},publisher={Springer International Publishing},address={Cham},series={Lecture Notes in Computer Science},pages={36--51},abbr={WAW},bibtex_show={true},html={https://link.springer.com/chapter/10.1007/978-3-030-48478-1_3},month=jul,code={https://github.com/pszufe/LTMSim.jl},pdf={publications/Antelmi_WAW_2020.pdf}}
AAMAS
A Design-Methodology for Epidemic Dynamics via Time-Varying Hypergraphs
Alessia Antelmi,Â
Gennaro Cordasco,Â
C. Spagnuolo,Â
and V. Scarano
In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems.
In epidemiology science, the importance to explore innovative modeling tools for acutely analyzing epidemic diffusion is turning into a big challenge considering the myriad of real-world aspects to capture. Typically, equation-based models, such as SIS and SIR, are used to study the propagation of diseases over a population. Improved approaches also include human-mobility patterns as network information to describe contacts among individuals. However, there still is the need to incorporate in these models information about different types of contagion, geographical information, humans habits, and environmental properties. In this paper, we propose a novel approach that takes into account: 1. direct and indirect epidemic contagion pathways to explore the dynamics of the epidemic, 2. the times of possible contagions, and 3. human-mobility patterns. We combine these three features exploiting time-varying hypergraphs, and we embed this model into a design-methodology for agent-based models (ABMs), able to improve the correctness in the epidemic estimations of classical contact-network approaches. We further describe a diffusion algorithm suitable for our design-methodology and adaptable to the peculiarities of any disease spreading policies and/or models. Finally, we tested our methodology by developing an ABM, realizing the SIS epidemic compartmental model, for simulating an epidemic propagation over a population of individuals. We experimented the model using real user-mobility data from the location-based social networkFoursquare, and we demonstrated the high-impact of temporal direct and indirect contagion pathways.
@inproceedings{Antelmi_AAMAS_2020,author={Antelmi, Alessia and Cordasco, Gennaro and Spagnuolo, C. and Scarano, V.},title={A Design-Methodology for Epidemic Dynamics via Time-Varying Hypergraphs},year={2020},publisher={International Foundation for Autonomous Agents and Multiagent Systems},booktitle={Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems},pages={61–69},numpages={9},series={AAMAS '20},doi={10.5555/3398761.3398774},abbr={AAMAS},bibtex_show={true},html={https://dl.acm.org/doi/10.5555/3398761.3398774},month=may,code={https://github.com/alessant/HGEpidemics},pdf={publications/Antelmi_AAMAS_2020.pdf}}
Internet Math.
Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl
Real-world complex networks are usually being modeled as graphs. The concept of graphs assumes that the relations within the network are binary (for instance, between pairs of nodes); however, this is not always true for many real-life scenarios, such as peer-to-peer communication schemes, paper co-authorship, or social network interactions. For such scenarios, it is often the case that the underlying network is better and more naturally modeled by hypergraphs. A hypergraph is a generalization of a graph in which a single (hyper)edge can connect any number of vertices. Hypergraphs allow modelers to have a complete representation of multi-relational (many-to-many) networks; hence, they are extremely suitable for analyzing and discovering more subtle dependencies in such data structures. Working with hypergraphs requires new software libraries that make it possible to perform operations on them, from basic algorithms (such as searching or traversing the network) to computing significant hypergraph measures, to including more challenging algorithms (such as community detection). In this paper, we present a new software library, SimpleHypergraphs.jl, written in the Julia language and designed for high-performance computing on hypergraphs and propose two new algorithms for analyzing their properties: s-betweenness and modified label propagation. We also present various approaches for hypergraph visualization integrated into our tool. In order to demonstrate how to exploit the library in practice, we discuss two case studies based on the 2019 Yelp Challenge dataset and the collaboration network built upon the Game of Thrones TV series. The results are promising and they confirm the ability of hypergraphs to provide more insight than standard graph-based approaches.
@article{Antelmi_InternetMathematics_2020,title={Analyzing, Exploring, and Visualizing Complex Networks via Hypergraphs using SimpleHypergraphs.jl},issn={1944-9488},doi={10.24166/im.01.2020},journal={Internet Mathematics},publisher={Internet Mathematics},author={Antelmi, Alessia and Cordasco, Gennaro and Kami{\'{n}}ski, Bogumi{\l} and Pra{\l}at, Pawe{\l} and Scarano, Vittorio and Spagnuolo, Carmine and Szufel, Przemyslaw},year={2020},abbr={Internet Math.},bibtex_show={true},html={https://www.internetmathematicsjournal.com/article/12464-analyzing-exploring-and-visualizing-complex-networks-via-hypergraphs-using-simplehypergraphs-jl},month=mar,code={https://github.com/pszufe/SimpleHypergraphs.jl},pdf={publications/Antelmi_InternetMathematics_2020.pdf}}
2019
AsiaSim
On Evaluating Rust as a Programming Language for the Future of Massive Agent-Based Simulations
Alessia Antelmi,Â
Gennaro Cordasco,Â
Matteo D’Auria,Â
Daniele De Vinco,Â
Alberto Negro,Â
and Carmine Spagnuolo
In Methods and Applications for Modeling and Simulation of Complex Systems.
The analysis of real systems and the development of predictive models to describe the evolution of real phenomena are challenging tasks that can improve the design of methodologies in many research fields. In this context, Agent-Based Model (ABM) can be seen as an innovative tool for modelling real-world complex simulations. This paper presents Rust-AB, an open-source library for developing ABM simulation on sequential and/or parallel computing platforms, exploiting Rust as programming language. The Rust-AB architecture as well as an investigation on the ability of Rust to develop ABM simulations are discussed. An ABM simulation written in Rust-AB, and a performance comparison against the well-adopted Java ABM toolkit MASON is also presented.
@inproceedings{Spagnuolo_AsiaSim_2019,author={Antelmi, Alessia and Cordasco, Gennaro and D'Auria, Matteo and De Vinco, Daniele and Negro, Alberto and Spagnuolo, Carmine},title={On Evaluating Rust as a Programming Language for the Future of Massive Agent-Based Simulations},booktitle={Methods and Applications for Modeling and Simulation of Complex Systems},year={2019},publisher={Springer Singapore},address={Singapore},pages={15--28},isbn={978-981-15-1078-6},doi={10.1007/978-981-15-1078-6_2},pdf={publications/Spagnuolo_AsiaSim_2019.pdf},bibtex_show={true},html={https://link.springer.com/chapter/10.1007/978-981-15-1078-6_2},code={https://github.com/krABMaga/krABMaga},abbr={AsiaSim},note={Best Paper Nominee}}
WAW
SimpleHypergraphs.jl—Novel Software Framework for Modelling and Analysis of Hypergraphs
Hypergraphs are natural generalization of graphs in which a single (hyper)edge can connect any number of vertices. As a result, hypergraphs are suitable and useful to model many important networks and processes. Typical applications are related to social data analysis and include situations such as exchanging emails with several recipients, reviewing products on social platforms, or analyzing security vulnerabilities of information networks. In many situations, using hypergraphs instead of classical graphs allows us to better capture and analyze dependencies within the network. In this paper, we propose a new library, named SimpleHypergraphs.jl, designed for efficient hypegraph analysis. The library exploits the Julia language flexibility and direct support for distributed computing in order to bring a new quality for simulating and analyzing processes represented as hypergraphs. In order to show how the library can be used we study two case studies based on the Yelp dataset. Results are promising and confirm the ability of hypergraphs to provide more insight than standard graph-based approaches.
@inproceedings{Antelmi_WAW_2019,author={Antelmi, Alessia and Cordasco, Gennaro and Kami{\'{n}}ski, Bogumi{\l} and Pra{\l}at, Pawe{\l} and Scarano, Vittorio and Spagnuolo, Carmine and Szufel, Przemyslaw},title={SimpleHypergraphs.jl---Novel Software Framework for Modelling and Analysis of Hypergraphs},booktitle={Algorithms and Models for the Web Graph, WAW'19},year={2019},publisher={Springer International Publishing},address={Cham},pages={115--129},isbn={978-3-030-25070-6},series={WAW'19},abbr={WAW},bibtex_show={true},html={https://link.springer.com/chapter/10.1007/978-3-030-25070-6_9},month=jul,code={https://github.com/pszufe/SimpleHypergraphs.jl},pdf={publications/Antelmi_WAW_2019.pdf}}
UMAP
Towards an Exhaustive Framework for Online Social Networks User Behaviour Modelling
Alessia Antelmi
In Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization.
Since the advent of Web 2.0, Online Social Networks (OSNs) represent a rich opportunity for researchers to collect real user data and to explore OSNs user behaviour. Based on the current challenges and future directions proposed in literature, we aim to investigate how to comprehensively model OSNs user behaviours, by exploiting and combining user data of different nature. We propose to use hypergraphs as a model to easily analyse and combine structural, semantic, and activity-related user information, and to study their evolution over time. This novel user behaviour modelling technique will converge in open, efficient, and scalable libraries, which will be integrated into a modular framework able to handle the data crawling process from several OSNs.
@inproceedings{Antelmi_UMAP_2019,author={Antelmi, Alessia},title={Towards an Exhaustive Framework for Online Social Networks User Behaviour Modelling},year={2019},isbn={9781450360210},publisher={Association for Computing Machinery},address={New York, NY, USA},url={https://doi.org/10.1145/3320435.3323466},booktitle={Proceedings of the 27th ACM Conference on User Modeling, Adaptation and Personalization},pages={349–352},numpages={4},abbr={UMAP},bibtex_show={true},html={https://dl.acm.org/doi/10.1145/3320435.3323466},month=jun,pdf={publications/Antelmi_UMAP_2019.pdf}}
TheWebConf
Characterizing the Behavioral Evolution of Twitter Users and The Truth Behind the 90-9-1 Rule
Alessia Antelmi,Â
Delfina Malandrino,Â
and Vittorio Scarano
In Companion Proceedings of The 2019 World Wide Web Conference.
Online Social Networks (OSNs) represent a fertile field to collect real user data and to explore OSNs user behavior. Recently, two topics are drawing the attention of researchers: the evolution of online social roles and the question of participation inequality. In this work, we bring these two fields together to study and characterize the behavioral evolution of OSNs users according to the quantity and the typology of their social interactions. We found that online participation on the microblogging platform can be categorized into four different activity levels. Furthermore, we empirically verified that the 90-9-1 rule of thumb about participation inequality is not an accurate representation of reality. Findings from our analysis reveal that lurkers are less than expected: they are not 9 out of 10 as suggested by Nielsen, but 3 out of 4. This represents a significant result that can give new insights on how users relate with social media and how their use is evolving towards a more active interaction with the new generation of consumers.
@inproceedings{Antelmi_WWW_2019,author={Antelmi, Alessia and Malandrino, Delfina and Scarano, Vittorio},title={Characterizing the Behavioral Evolution of Twitter Users and The Truth Behind the 90-9-1 Rule},year={2019},isbn={9781450366755},publisher={Association for Computing Machinery},address={New York, NY, USA},url={https://doi.org/10.1145/3308560.3316705},doi={10.1145/3308560.3316705},booktitle={Companion Proceedings of The 2019 World Wide Web Conference},pages={1035–1038},numpages={4},location={San Francisco, USA},series={WWW ’19},abbr={TheWebConf},bibtex_show={true},html={https://dl.acm.org/doi/10.1145/3308560.3316705},month=may,pdf={publications/Antelmi_TheWebConf_2019.pdf}}
2018
IEEE BigData
Characterizing Twitter Users: What do Samantha Cristoforetti, Barack Obama and Britney Spears Have in Common?
Alessia Antelmi,Â
Delfina Malandrino,Â
and Vittorio Scarano
In 2018 IEEE International Conference on Big Data (Big Data).
The exponential growth in the use of digital devices and the ubiquitous online access produce a huge amount of structured and unstructured data that can be mined and analyzed to gather insights into several domains. In particular, since the advent of Web 2.0, Online Social Networks (OSNs) represent a rich opportunity for researchers to collect real user data and to explore OSNs users behavior. This study represents a first attempt to characterize and classify OSNs users according to their level of activity through the use of user profile attributes. We analyzed four case studies from the Twitter platform for a final total of around 721 thousand users, divided into four sub-datasets and examined over a period of at least six months in 2017. Following a data-driven methodology, we found that static, profile-based information - based on the entire lifetime of the users - can help to recognize users influence in Twitter online communities. On the other hand, these profile attributes are not enough to characterize user activity on the microblogging platform.
@inproceedings{Antelmi_BigData_2018,author={{Antelmi}, Alessia and {Malandrino}, Delfina and {Scarano}, Vittorio},booktitle={2018 IEEE International Conference on Big Data (Big Data)},title={{Characterizing Twitter Users: What do Samantha Cristoforetti, Barack Obama and Britney Spears Have in Common?}},year={2018},volume={},number={},pages={3622-3627},month=dec,doi={10.1109/BigData.2018.8622045},bibtex_show={true},html={https://ieeexplore.ieee.org/document/8622045},abbr={IEEE BigData},pdf={publications/Antelmi_IEEEBigData_2018.pdf}}
AICS
Towards a more systematic analysis of twitter data: A framework for the analysis of twitter communities
Alessia Antelmi,Â
Josephine Griffith,Â
and Karen Young
@inproceedings{Antelmi_AICS_2018,author={Antelmi, Alessia and Griffith, Josephine and Young, Karen},title={Towards a more systematic analysis of twitter data: A framework for the analysis of twitter communities},year={2018},month=dec,booktitle={CEUR Workshop Proceedings},volume={2259},pages={303 – 314},html={https://ceur-ws.org/Vol-2259/aics_28.pdf},publisher={CEUR-WS},abbr={AICS},bibtex_show={true},pdf={publications/Antelmi_AICS_2018.pdf}}
IEEE GEM
Understanding User Engagement with Entertainment Media: A Case Study of the Twitter Behaviour of Game of Thrones (GoT) Fans
Alessia Antelmi,Â
Joh Breslin,Â
and Karen Young
In 2018 IEEE Games, Entertainment, Media Conference.
User Engagement in digital experiences is a fundamental concern for technology developers, educators, businesses, TV networks and marketing agencies. However, engagement remains a confusing concept with cognitive, emotional and behavioural dimensions, that depends on a large number of technical and human interrelated factors. This study contributes to our understanding of User Engagement at a behavioural level, through an analysis of a HBO Game of Thrones (GoT) fans’ Twitter dataset, collected over a six-month period. This analysis across the GoT universe: literary, screen, and media extensions, found users are most engaged in discussions around the TV show, and predictably most particularly the season premiere and finale, on the day after it is aired using mobile devices to post their status updates. Additionally, an initial hash tag analysis reveals users are engaged in both user generated conversations and in corporate TV network campaigns, while initial semantic analysis of tweets reveals TV locations and GOT characters to be the most tweeted about topics. This characterisation of user behaviours presents opportunities to content developers to maximise and capitalise on this active social interaction in a timely manner, keeping the brand alive and also to mine this user feedback in real time to inform the development of forthcomina content.
@inproceedings{Antelmi_IEEEGEM_2018,author={{Antelmi}, Alessia and {Breslin}, Joh and {Young}, Karen},booktitle={2018 IEEE Games, Entertainment, Media Conference},series={GEM'18},title={Understanding User Engagement with Entertainment Media: A Case Study of the Twitter Behaviour of Game of Thrones (GoT) Fans},year={2018},doi={10.1109/GEM.2018.8516505},volume={},number={},pages={1-9},bibtex_show={true},html={https://ieeexplore.ieee.org/document/8516505},abbr={IEEE GEM},month=aug,pdf={/publications/Antelmi_GEM_2018.pdf}}
2015
Euro-Par
On Evaluating Graph Partitioning Algorithms for Distributed Agent Based Models on Networks
Alessia Antelmi,Â
Gennaro Cordasco,Â
Carmine Spagnuolo,Â
and Luca Vicidomini
Graph Partitioning is a key challenge problem with application in many scientific and technological fields. The problem is very well studied with a rich literature and is known to be NP-hard. Several heuristic solutions, which follow diverse approaches, have been proposed, they are based on different initial assumptions that make them difficult to compare. An analytical comparison was performed based on an Implementation Challenge [3], however being a multi-objective problem (two opposing goals are for instance load balancing and edge-cut size), the results are difficult to compare and it is hard to foresee what can be the impact of one solution, instead of another, in a real scenario. In this paper we analyze the problem in a real context: the development of a distributed agent-based simulation model on a network field (which for instance can model social interactions).
@inproceedings{Spagnuolo_EuroPar_2015,author={Antelmi, Alessia and Cordasco, Gennaro and Spagnuolo, Carmine and Vicidomini, Luca},title={On Evaluating Graph Partitioning Algorithms for Distributed Agent Based Models on Networks},booktitle={Euro-Par 2015: Parallel Processing Workshops},year={2015},publisher={Springer International Publishing},address={Cham},pages={367--378},isbn={978-3-319-27308-2},bibtex_show={true},html={https://link.springer.com/chapter/10.1007/978-3-319-27308-2_30},abbr={Euro-Par},month=aug,pdf={publications/Spagnuolo_EuroPar_2015.pdf}}