<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Tensor Decomposition for Student Success Prediction Models in Hands-on Cybersecurity Exercises</dc:title><dc:creator>Scott, Julia; Mache, Jens; Weiss, Richard</dc:creator><dc:corporate_author/><dc:editor/><dc:description>Cybersecurity is an ever-evolving field that demands more workers and a wider array of knowledge every year. As such, cybersecurity education remains essential - not just for professionals, but for developers and non-technical roles as well. Due to this, hands-on cybersecurity exercises, such as the ones in the eduRange platform, are increasingly important. EduRange aims to be a flexible, intuitive cybersecurity platform that allows instructors to tailor pre-existing scenarios to their classes' needs. However, when students become stuck or frustrated, learning grinds to a halt. To combat this discouragement, we want to create a semi-automated hint system that can consistently identify struggling students. Such a hint system, however, requires a large quantity of data, which can be difficult to obtain through classroom testing alone.
As such, we explored creating synthetic data. We used a sample dataset and stored attempt accuracy in a three dimensional tensor with dimensions students, questions, and attempts. We then used tensor decomposition to fill in gaps in the dataset, a process called densification. Our primary objective was to optimize the tensor decomposition to obtain the most accurate possible densification. The results showed that to obtain the greatest accuracy, we should use rank-1 tensors and fill in logical extra data points. Additionally, we found that generic tensor decomposition may not be sufficient for Boolean data. In future work, we plan to use Boolean tensor decomposition to improve our results.</dc:description><dc:publisher>ACM</dc:publisher><dc:date>2025-02-18</dc:date><dc:nsf_par_id>10595456</dc:nsf_par_id><dc:journal_name/><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation>1762 to 1762</dc:page_range_or_elocation><dc:issn/><dc:isbn>9798400705328</dc:isbn><dc:doi>https://doi.org/10.1145/3641555.3705052</dc:doi><dcq:identifierAwardId>2216492; 2216485</dcq:identifierAwardId><dc:subject>machine learning</dc:subject><dc:subject>security and privacy</dc:subject><dc:version_number/><dc:location>Pittsburgh PA USA</dc:location><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>