Claim Missing Document
Check
Articles

Found 2 Documents
Search

A Preference Model on Adaptive Affinity Propagation Rina Refianti; Achmad Benny Mutiara; Asep Juarna; Adang Suhendra
International Journal of Electrical and Computer Engineering (IJECE) Vol 8, No 3: June 2018
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1767.959 KB) | DOI: 10.11591/ijece.v8i3.pp1805-1813

Abstract

In recent years, two new data clustering algorithms have been proposed. One of them isAffinity Propagation (AP). AP is a new data clustering technique that use iterative message passing and consider all data points as potential exemplars. Two important inputs of AP are a similarity matrix (SM) of the data and the parameter ”preference” p. Although the original AP algorithm has shown much success in data clustering, it still suffer from one limitation: it is not easy to determine the value of the parameter ”preference” p which can result an optimal clustering solution. To resolve this limitation, we propose a new model of the parameter ”preference” p, i.e. it is modeled based on the similarity distribution. Having the SM and p, Modified Adaptive AP (MAAP) procedure is running. MAAP procedure means that we omit the adaptive p-scanning algorithm as in original Adaptive-AP (AAP) procedure. Experimental results on random non-partition and partition data sets show that (i) the proposed algorithm, MAAP-DDP, is slower than original AP for random non-partition dataset, (ii) for random 4-partition dataset and real datasets the proposed algorithm has succeeded to identify clusters according to the number of dataset’s true labels with the execution times that are comparable with those original AP. Beside that the MAAP-DDP algorithm demonstrates more feasible and effective than original AAP procedure.
Comparison of Music Genre Classification Results Using Multilayer Perceptron With Chroma Feature and Mel Frequency Cepstral Coefficients Extraction Features Rina Refianti; Faradilla Mahardi
International Journal of Engineering, Science and Information Technology Vol 3, No 2 (2023)
Publisher : Department of Information Technology, Universitas Malikussaleh, Aceh Utara, Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52088/ijesty.v3i2.444

Abstract

The development of digital music, especially in genre classification has helped in the ease of studying and searching for a song. There are many ways that can be used to classify the songs/music into genres. Deep Learning is one of the Machine Learning implementation methods that can be used to classify the genre of music. The author managed to create a deep learning-based program using the MLP model with two extraction features, Chroma Feature and MFCC which can classify song/ music genres. Pre-processing of the song is done to take the features of the existing value then the value will be incorporated into the model to be trained and tested. The model was trained and tested with data of 3000 songs which were divided into 10 genres. The model was also tested using the Confusion Matrix with 600 songs of the total available data. The models with Chroma Features as extraction features have an accuracy rate of 53 %, while the MFCC extraction features have an accuracy rate of 80.2 %.