%0 Conference Paper %B Formal Methods. FM 2019 International Workshops %D 2020 %T Analysis and Visualization of Performance Indicators in University Admission Tests %A Michela Natilli %A Daniele Fadda %A S Rinzivillo %A Dino Pedreschi %A Licari, Federica %E Sekerinski, Emil %E Moreira, Nelma %E Oliveira, José N. %E Ratiu, Daniel %E Riccardo Guidotti %E Farrell, Marie %E Luckcuck, Matt %E Marmsoler, Diego %E Campos, José %E Astarte, Troy %E Gonnord, Laure %E Cerone, Antonio %E Couto, Luis %E Dongol, Brijesh %E Kutrib, Martin %E Monteiro, Pedro %E Delmas, David %X This paper presents an analytical platform for evaluation of the performance and anomaly detection of tests for admission to public universities in Italy. Each test is personalized for each student and is composed of a series of questions, classified on different domains (e.g. maths, science, logic, etc.). Since each test is unique for composition, it is crucial to guarantee a similar level of difficulty for all the tests in a session. For this reason, to each question, it is assigned a level of difficulty from a domain expert. Thus, the general difficultness of a test depends on the correct classification of each item. We propose two approaches to detect outliers. A visualization-based approach using dynamic filter and responsive visual widgets. A data mining approach to evaluate the performance of the different questions for five years. We used clustering to group the questions according to a set of performance indicators to provide labeling of the data-driven level of difficulty. The measured level is compared with the a priori assigned by experts. The misclassifications are then highlighted to the expert, who will be able to refine the question or the classification. Sequential pattern mining is used to check if biases are present in the composition of the tests and their performance. This analysis is meant to exclude overlaps or direct dependencies among questions. Analyzing co-occurrences we are able to state that the composition of each test is fair and uniform for all the students, even on several sessions. The analytical results are presented to the expert through a visual web application that loads the analytical data and indicators and composes an interactive dashboard. The user may explore the patterns and models extracted by filtering and changing thresholds and analytical parameters. %B Formal Methods. FM 2019 International Workshops %I Springer International Publishing %C Cham %8 2020// %@ 978-3-030-54994-7 %G eng %U https://link.springer.com/chapter/10.1007/978-3-030-54994-7_14 %R https://doi.org/10.1007/978-3-030-54994-7_14 %0 Conference Paper %B Formal Methods. FM 2019 International Workshops %D 2020 %T “Know Thyself” How Personal Music Tastes Shape the Last.Fm Online Social Network %A Riccardo Guidotti %A Giulio Rossetti %E Sekerinski, Emil %E Moreira, Nelma %E Oliveira, José N. %E Ratiu, Daniel %E Riccardo Guidotti %E Farrell, Marie %E Luckcuck, Matt %E Marmsoler, Diego %E Campos, José %E Astarte, Troy %E Gonnord, Laure %E Cerone, Antonio %E Couto, Luis %E Dongol, Brijesh %E Kutrib, Martin %E Monteiro, Pedro %E Delmas, David %X As Nietzsche once wrote “Without music, life would be a mistake” (Twilight of the Idols, 1889.). The music we listen to reflects our personality, our way to approach life. In order to enforce self-awareness, we devised a Personal Listening Data Model that allows for capturing individual music preferences and patterns of music consumption. We applied our model to 30k users of Last.Fm for which we collected both friendship ties and multiple listening. Starting from such rich data we performed an analysis whose final aim was twofold: (i) capture, and characterize, the individual dimension of music consumption in order to identify clusters of like-minded Last.Fm users; (ii) analyze if, and how, such clusters relate to the social structure expressed by the users in the service. Do there exist individuals having similar Personal Listening Data Models? If so, are they directly connected in the social graph or belong to the same community?. %B Formal Methods. FM 2019 International Workshops %I Springer International Publishing %C Cham %8 2020// %@ 978-3-030-54994-7 %G eng %U https://link.springer.com/chapter/10.1007/978-3-030-54994-7_11 %R https://doi.org/10.1007/978-3-030-54994-7_11 %0 Journal Article %J Education and Information Technologies %D 2017 %T An empirical verification of a-priori learning models on mailing archives in the context of online learning activities of participants in free\libre open source software (FLOSS) communities %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Free\Libre Open Source Software (FLOSS) environments are increasingly dubbed as learning environments where practical software engineering skills can be acquired. Numerous studies have extensively investigated how knowledge is acquired in these environments through a collaborative learning model that define a learning process. Such a learning process, identified either as a result of surveys or by means of questionnaires, can be depicted through a series of graphical representations indicating the steps FLOSS community members go through as they acquire and exchange skills. These representations are referred to as a-priori learning models. They are Petri net-like workflow nets (WF-net) that provide a visual representation of the learning process as it is expected to occur. These models are representations of a learning framework or paradigm in FLOSS communities. As such, the credibility of any models is estimated through a process of model verification and validation. Therefore in this paper, we analyze these models in comparison with the real behavior captured in FLOSS repositories by means of conformance verification in process mining. The purpose of our study is twofold. Firstly, the results of our analysis provide insights on the possible discrepancies that are observed between the initial theoretical representations of learning processes and the real behavior captured in FLOSS event logs, constructed from mailing archives. Secondly, this comparison helps foster the understanding on how learning actually takes place in FLOSS environments based on empirical evidence directly from the data. %B Education and Information Technologies %V 22 %P 3207–3229 %G eng %U https://link.springer.com/article/10.1007/s10639-017-9573-6 %R 10.1007/s10639-017-9573-6 %0 Generic %D 2015 %T An exploration of learning processes as process maps in FLOSS repositories %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Evidence suggests that Free/Libre Open Source Software (FLOSS) environ-ments provide unlimited learning opportunities. Community members engage in a number of activities both during their interaction with their peers and while mak-ing use of the tools available in these environments. A number of studies docu-ment the existence of learning processes in FLOSS through the analysis of sur-veys and questionnaires filled by FLOSS project participants. At the same time, the interest in understanding the dynamics of the FLOSS phenomenon, its popu-larity and success resulted in the development of tools and techniques for extract-ing and analyzing data from different FLOSS data sources. This new field is called Mining Software Repositories (MSR). In spite of these efforts, there is limited work aiming to provide empirical evidence of learning processes directly from FLOSS repositories. In this paper, we seek to trigger such an initiative by proposing an approach based on Process Mining to trace learning behaviors from FLOSS participants’ trails of activities, as recorded in FLOSS repositories, and visualize them as pro-cess maps. Process maps provide a pictorial representation of real behavior as it is recorded in FLOSS data. Our aim is to provide critical evidence that boosts the understanding of learning behavior in FLOSS communities by analyzing the rel-evant repositories. In order to accomplish this, we propose an effective approach that comprises first the mining of FLOSS repositories in order to generate Event logs, and then the generation of process maps, equipped with relevant statistical data interpreting and indicating the value of process discovery from these reposi-tories. %G eng %U http://eprints.adm.unipi.it/id/eprint/2344 %0 Conference Paper %B Conference on e-Business, e-Services and e-Society %D 2015 %T Mining learning processes from FLOSS mailing archives %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Evidence suggests that Free/Libre Open Source Software (FLOSS) environments provide unlimited learning opportunities. Community members engage in a number of activities both during their interaction with their peers and while making use of these environments. As FLOSS repositories store data about participants’ interaction and activities, we analyze participants’ interaction and knowledge exchange in emails to trace learning activities that occur in distinct phases of the learning process. We make use of semantic search in SQL to retrieve data and build corresponding event logs which are then fed to a process mining tool in order to produce visual workflow nets. We view these nets as representative of the traces of learning activities in FLOSS as well as their relevant flow of occurrence. Additional statistical details are provided to contextualize and describe these models. %B Conference on e-Business, e-Services and e-Society %I Springer, Cham %G eng %R 10.1007/978-3-319-25013-7_23 %0 Conference Paper %B International Conference on Software Engineering and Formal Methods %D 2014 %T An abstract state machine (ASM) representation of learning process in FLOSS communities %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Free/Libre Open Source Software (FLOSS) communities as collaborative environments enable the occurrence of learning between participants in these groups. With the increasing interest research on understanding the mechanisms and processes through which learning occurs in FLOSS, there is an imperative to describe these processes. One successful way of doing this is through specification methods. In this paper, we describe the adoption of Abstract States Machines (ASMs) as a specification methodology for the description of learning processes in FLOSS. The goal of this endeavor is to represent the many possible steps and/or activities FLOSS participants go through during interactions that can be categorized as learning processes. Through ASMs, we express learning phases as states while activities that take place before moving from one state to another are expressed as transitions. %B International Conference on Software Engineering and Formal Methods %I Springer, Cham %G eng %R 10.1007/978-3-319-15201-1_15 %0 Conference Paper %B International Conference on Software Engineering and Formal Methods %D 2014 %T Ontolifloss: Ontology for learning processes in FLOSS communities %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Free/Libre Open Source Software (FLOSS) communities are considered an example of commons-based peer-production models where groups of participants work together to achieve projects of common purpose. In these settings, many occurring activities can be documented and have established them as learning environments. As knowledge exchange is proved to occur in FLOSS, the dynamic and free nature of participation poses a great challenge in understanding activities pertaining to Learning Processes. In this paper we raise this question and propose an ontology (called OntoLiFLOSS) in order to define terms and concepts that can explain learning activities taking place in these communities. The objective of this endeavor is to define in the simplest possible way a common definition of concepts and activities that can guide the identification of learning processes taking place among FLOSS members in any of the standard repositories such as mailing list, SVN, bug trackers and even discussion forums. %B International Conference on Software Engineering and Formal Methods %I Springer, Cham %G eng %R 10.1007/978-3-319-15201-1_11 %0 Conference Paper %B International Conference on Software Engineering and Formal Methods %D 2014 %T Process mining event logs from FLOSS data: state of the art and perspectives %A Mukala, Patrick %A Cerone, Antonio %A Franco Turini %X Free/Libre Open Source Software (FLOSS) is a phenomenon that has undoubtedly triggered extensive research endeavors. At the heart of these initiatives is the ability to mine data from FLOSS repositories with the hope of revealing empirical evidence to answer existing questions on the FLOSS development process. In spite of the success produced with existing mining techniques, emerging questions about FLOSS data require alternative and more appropriate ways to explore and analyse such data. In this paper, we explore a different perspective called process mining. Process mining has been proved to be successful in terms of tracing and reconstructing process models from data logs (event logs). The chief objective of our analysis is threefold. We aim to achieve: (1) conformance to predefined models; (2) discovery of new model patterns; and, finally, (3) extension to predefined models. %B International Conference on Software Engineering and Formal Methods %I Springer, Cham %G eng %R 10.1007/978-3-319-15201-1_12