• español
    • English
  • Login
  • English 
    • español
    • English

UniversidaddeCádiz

Área de Biblioteca, Archivo y Publicaciones
Communities and Collections
View Item 
  •   RODIN Home
  • Producción Científica
  • Artículos Científicos
  • View Item
  •   RODIN Home
  • Producción Científica
  • Artículos Científicos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Learning personalization in block-based programming languages using clustering and static code analysis

Thumbnail
Identificadores

URI: http://hdl.handle.net/10498/40143

DOI: 10.1016/j.caeo.2026.100333

ISSN: 2666-5573

Files
Versión publicada del artículo (3.827Mb)
Statistics
View statistics
Metrics and citations
 
Share
Export
Export reference to MendeleyRefworksEndNoteBibTexRIS
Metadata
Show full item record
Author/s
Person Montero, TatianaAuthority UCA; Caballero Hernández, Juan AntonioAuthority UCA; Romero, Cristóbal; Ruiz Rube, IvánAuthority UCA; Dodero Beardo, Juan ManuelAuthority UCA
Date
2026-06-13
Department
Ingeniería Informática
Source
Computers and Education Open, Volume 10, 2026, 100333
Abstract
Personalized learning in programming education aims at adapting instructional strategies to the diverse needs of students, particularly novice programmers. However, traditional approaches often fail to accommodate individual learning styles or emphasize clean coding practices. This study proposes a data-driven method to personalize programming education by analyzing large-scale datasets from block-based Visual Programming Language (VPL) projects created by novice programmers. Using static code analysis and machine learning, the approach examines the coverage of programming concepts and code quality metrics to identify patterns in student performance, enabling adaptive learning pathways. This approach is implemented in BlocklyMining, a tool that integrates static code analysis, quality assessment through SQALE, and machine-learning-based clustering. The study applies K-Means and Hierarchical Agglomerative Clustering to 215,244 MIT App Inventor projects, evaluating cluster quality using the Silhouette Coefficient (SC) and Davies–Bouldin Index (DBI). Results show that the clustering algorithms effectively group projects, thereby facilitating the generation of personalized learning recommendations tailored to novice programmers’ skill levels.
Subjects
Learning personalization; Block-based languages; Machine learning; K-Means; Hierarchical Agglomerative
Collections
  • Artículos Científicos [11973]
  • Artículos Científicos INDESS [1043]
  • Articulos Científicos Ing. Inf. [313]
Atribución-CompartirIgual 4.0 Internacional
This work is under a Creative Commons License Atribución-CompartirIgual 4.0 Internacional

Browse

All of RODINCommunities and CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

View Usage Statistics

Información adicional

AboutDeposit in RODINPoliciesGuidelinesRightsLinksStatisticsNewsFrequently Asked Questions

RODIN is available through

OpenAIREOAIsterRecolectaHispanaEuropeanaBaseDARTOATDGoogle Academic

Related links

Sherpa/RomeoDulcineaROAROpenDOARCreative CommonsORCID

RODIN está gestionado por el Área de Biblioteca, Archivo y Publicaciones de la Universidad de Cádiz

Contact informationSuggestionsUser Support