Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
2 results
Search Results
Conference Object Citation - WoS: 1Artist Recommendation Based on Association Rule Mining and Community Detection(SCITEPRESS, 2021) Çiftçi, Okan; Tenekeci, Samet; Ülgentürk, CerenRecent advances in the web have greatly increased the accessibility of music streaming platforms and the amount of consumable audio content. This has made automated recommendation systems a necessity for listeners and streaming platforms alike. Therefore, a wide variety of predictive models have been designed to identify related artists and music collections. In this paper, we proposed a graph-based approach that utilizes association rules extracted from Spotify playlists. We constructed several artist networks and identified related artist clusters using Louvain and Label Propagation community detection algorithms. We analyzed internal and external cluster agreements based on different validation criteria. As a result, we achieved up to 99.38% internal and 90.53% external agreements between our models and Spotify's related artist lists. These results show that integrating association rule mining concepts with graph databases can be a novel and effective way to design an artist recommendation system.Conference Object Citation - WoS: 2Citation - Scopus: 2Dynamic Itemset Mining Under Multiple Support Thresholds(IOS Press, 2016) Abuzayed, Nourhan; Ergenç Bostanoğlu, Belgin; Ergenç, BelginHandling dynamic aspect of databases and multiple support threshold requirements of items are two important challenges of frequent itemset mining algorithms. Existing dynamic itemset mining algorithms are devised for single support threshold whereas multiple support threshold algorithms assume that the databases are static. This paper focuses on dynamic update problem of frequent itemsets under MIS (Multiple Item Support) thresholds and introduces Dynamic MIS algorithm. It is i) tree based and scans the database once, ii) considers multiple support thresholds, and iii) handles increments of additions, additions with new items and deletions. Proposed algorithm is compared to CFP-Growth++ and findings are; in dynamic database 1) Dynamic MIS performs better than CFP-Growth++ since it runs only on increments and 2) Dynamic MIS can achieve speed-up up to 56 times against CFP-Growth++.