22 research outputs found
Predicting Your Next Stop-over from Location-based Social Network Data with Recurrent Neural Networks
In the past years, Location-based Social Network (LBSN) data have
strongly fostered a data-driven approach to the recommendation
of Points of Interest (POIs) in the tourism domain. However, an
important aspect that is often not taken into account by current
approaches is the temporal correlations among POI categories in
tourist paths. In this work, we collect data from Foursquare, we
extract timed paths of POI categories from sequences of temporally
neighboring check-ins and we use a Recurrent Neural Network
(RNN) to learn to generate new paths by training it to predict
observed paths. As a further step, we cluster the data considering
users’ demographics and learn separate models for each category
of users. The evaluation shows the eectiveness of the proposed
approach in predicting paths in terms of model perplexity on the
test se
An empirical comparison of knowledge graph embeddings for item recommendation
In the past years, knowledge graphs have proven to be beneficial
for recommender systems, efficiently addressing paramount issues
such as new items and data sparsity. At the same time, several works have
recently tackled the problem of knowledge graph completion through machine
learning algorithms able to learn knowledge graph embeddings. In
this paper, we show that the item recommendation problem can be seen
as a specific case of knowledge graph completion problem, where the
“feedback” property, which connects users to items that they like, has to
be predicted. We empirically compare a set of state-of-the-art knowledge
graph embeddings algorithms on the task of item recommendation on
the Movielens 1M dataset. The results show that knowledge graph embeddings
models outperform traditional collaborative filtering baselines
and that TransH obtains the best performance
Knowledge Graph Embeddings with node2vec for Item Recommendation
In the past years, knowledge graphs have proven to be beneficial
for recommender systems, efficiently addressing paramount issues
such as new items and data sparsity. Graph embeddings algorithms have
shown to be able to automatically learn high quality feature vectors
from graph structures, enabling vector-based measures of node relatedness.
In this paper, we show how node2vec can be used to generate item
recommendations by learning knowledge graph embeddings. We apply
node2vec on a knowledge graph built from the MovieLens 1M dataset
and DBpedia and use the node relatedness to generate item recommendations.
The results show that node2vec consistently outperforms a set
of collaborative filtering baselines on an array of relevant metric
Enhancing manufacturing intelligence through an unsupervised data-driven methodology for cyclic industrial processes
MAGMA network behavior classifier for malware traffic
Malware is a major threat to security and privacy of network users. A large variety of malware is typically spread over the Internet, hiding in benign traffic. New types of malware appear every day, challenging both the research community and security companies to improve malware identification techniques. In this paper we present MAGMA, MultilAyer Graphs for MAlware detection, a novel malware behavioral classifier. Our system is based on a Big Data methodology, driven by real-world data obtained from traffic traces collected in an operational network. The methodology we propose automatically extracts patterns related to a specific input event, i.e., a seed, from the enormous amount of events the network carries. By correlating such activities over (i) time, (ii) space, and (iii) network protocols, we build a Network Connectivity Graph that captures the overall “network behavior” of the seed. We next extract features from the Connectivity Graph and design a supervised classifier. We run MAGMA on a large dataset collected from a commercial Internet Provider where 20,000 Internet users generated more than 330 million events. Only 42,000 are flagged as malicious by a commercial IDS, which we consider as an oracle. Using this dataset, we experimentally evaluate MAGMA accuracy and robustness to parameter settings. Results indicate that MAGMA reaches 95% accuracy, with limited false positives. Furthermore, MAGMA proves able to identify suspicious network events that the IDS ignored
Preface of the 31st Italian Symposium on Advanced Database Systems
This volume contains the proceedings of the 31st Italian Symposium on Advanced Database Systems (SEBD - Sistemi Evoluti per Basi di Dati), held in Galzinagno Terme (Padua, Italy) from 2 to 5 July 2023.</p
Preface of the 31st Italian Symposium on Advanced Database Systems
This volume contains the proceedings of the 31st Italian Symposium on Advanced Database Systems (SEBD - Sistemi Evoluti per Basi di Dati), held in Galzinagno Terme (Padua, Italy) from 2 to 5 July 2023.</p
Predicting Student Academic Performance by Means of Associative Classification
The Learning Analytics community has recently paid particular attention to early predict learners’ performance. An established approach entails training classification models from past learner-related data in order to predict the exam success rate of a student well before the end of the course. Early predictions allow teachers to put in place targeted actions, e.g., supporting at-risk students to avoid exam failures or course dropouts. Although several machine learning and data mining solutions have been proposed to learn accurate predictors from past data, the interpretability and explainability of the best performing models is often limited. Therefore, in most cases, the reasons behind classifiers’ decisions remain unclear. This paper proposes an Explainable Learning Analytics solution to analyze learner-generated data acquired by our technical university, which relies on a blended learning model. It adopts classification techniques to early predict the success rate of about 5000 students who were enrolled in the first year courses of our university. It proposes to apply associative classifiers at different time points and to explore the characteristics of the models that led to assign pass or fail success rates. Thanks to their inherent interpretability, associative models can be manually explored by domain experts with the twofold aim at validating classifier outcomes through local rule-based explanations and identifying at-risk/successful student profiles by interpreting the global rule-based model. The results of an in-depth empirical evaluation demonstrate that associative models (i) perform as good as the best performing classification models, and (ii) give relevant insights into the per-student success rate assignments
Educational video services in universities: a systematic effectiveness analysis
Our university has offered a massive educational video service since 2010, as part of a blended learning model that allows students to balance active participation in the classroom with remote access to video-recorded lectures. In these years, we have collected a huge amount of very detailed data about the students' access to the service. Together with additional information that characterize a university system (e.g. students' performance or course population), these data represent a precious ground set to assess the educational model. The paper describes an experimental set to profile the use of the educational video service, whose results will contribute to improve the model. Specifically the paper analyzes the students' service use relatively to different transversal course characteristics, such as level, main topic, population, success rate. As a result, it outlines the profile of the "ideal" courses for which students highly appreciate the service. This information will help educational designers to select the future courses to be included in the service, but it will also give directions on the sectors where improvements are necessary. Finally, the paper experimentally demonstrates a positive impact of the educational video service on students' performance, and specifically on the exam success rate