• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.89-104
• /
• 2007

This research attempts to give a personalized recommendation framework in large-sized music contents environment. Despite of existing studios and commercial contents for recommendation systems, large online shopping malls are still looking for a recommendation system that can serve personalized recommendation and handle large data in real-time. This research utilizes data mining technologies and new pattern matching algorithm. A clustering technique is used to get dynamic user segmentations using user preference to contents categories. Then a sequential pattern mining technique is used to extract contents access patterns in the user segmentations. And the recommendation is given by our recommendation algorithm using user contents preference history and contents access patterns of the segment. In the framework, preprocessing and data transformation and transition are implemented on DBMS. The proposed system is implemented to show that the framework is feasible. In the experiment using real-world large data, personalized recommendation is given in almost real-time and shows acceptable correctness.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.43-52
• /
• 2013

Pervasive computing and social network are good resources in recommendation method. Collaborative filtering is one of the most popular recommendation methods, but it has some limitations such as rating sparsity. Moreover, it does not consider social network in pervasive computing environment. We propose an effective proactive friend recommendation method using social network and contexts in pervasive computing environment. In collaborative filtering method, users need to rate sufficient number of items. However, many users don't rate items sufficiently, because the rating information must be manually input into system. We solve the rating sparsity problem in the collaboration filtering method by using contexts. Our method considers both a static and a dynamic friendship using contexts and social network. It makes more effective recommendation. This paper describes a new friend recommendation method and then presents a music friend scenario. Our work will help e-commerce recommendation system using collaborative filtering and friend recommendation applications in social network services.

• Proceedings of the Korean Society for Information Management Conference
• /
• 2017.08a
• /
• pp.23-32
• /
• 2017

Music therapy has been proved to be effective in treatment of diseases such as Alzheimer's disease. Many studies have investigated the effect of music therapy techniques on symptoms of a given disease but there has been no efforts in classifying those studies by specific symptoms of diseases, although patients, caregivers and music therapists have difficulty in discovering documents that they need to treat certain diseases. Thus, in the study, we propose a method to group music therapy-related publications by the music therapy techniques mainly used for a given disease. We expect that it will help music therapists and patients to find papers to help them to cure a specific disorder.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.32-55
• /
• 2018

The digitization of music has seen a considerable increase in audience size from a few localized listeners to a wider range of global listeners. At the same time, the digitization brings the challenge of smoothly retrieving music from large databases. To deal with this challenge, many systems which support the smooth retrieval of musical data have been developed. At the computational level, a query music piece is compared with the rest of the music pieces in the database. These systems, music information retrieval (MIR systems), work for various applications such as general music retrieval, plagiarism detection, music recommendation, and musicology. This paper mainly addresses two parts of the MIR research area. First, it presents a general overview of MIR, which will examine the history of MIR, the functionality of MIR, application areas of MIR, and the components of MIR. Second, we will investigate music similarity measurement methods, where we provide a comparative analysis of state of the art methods. The scope of this paper focuses on comparative analysis of the accuracy and efficiency of a few key MIR systems. These analyses help in understanding the current and future challenges associated with the field of MIR systems and music similarity measures.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.7
• /
• pp.1083-1091
• /
• 2017

As big data technologies have been developed and massive data have exploded from users through various channels, CEO of global IT enterprise mentioned core importance of data in next generation business. Therefore various machine learning technologies have been necessary to apply data driven services but especially recommendation has been core technique in viewpoint of directly providing summarized information or exact choice of items to users in information flooding environment. Recently evolved recommendation techniques have been proposed by many researchers and most of service companies with big data tried to apply refined recommendation method on their online business. For example, Amazon used item to item collaborative filtering method on its sales distribution platform. In this paper, we develop a commercial web service for suggesting music contents and implement three representative collaborative filtering methods on the service. We also produce recommendation lists with three methods based on real world sample data and evaluate the usefulness of them by comparison among the produced result. This study is meaningful in terms of suggesting the right direction and practicality when companies and developers want to develop web services by applying big data based recommendation techniques in practical environment.

• The Journal of the Korea Contents Association
• /
• v.20 no.4
• /
• pp.1-13
• /
• 2020

In order to understand the recommendation algorithm applied to the online video platform, this study examines the relationship between the content characteristics of K-pop music videos and related videos recommended for playback on YouTube, and analyses which videos are recommended as related videos through network analysis. As a result, the more liked videos, the higher recommendation ranking and most of the videos belonging to the same channel or produced by the same agency were recommended as related videos. As a result of the network analysis of the related video, the network of K-pop music video is strongly formed, and the BTS music video is highly centralized in the network analysis of the related video. These results suggest that the network between K-pops is strong, so when you enter K-pop as a search query and watch videos, you can enjoy K-pop continuously. But when watching other genres of video, K-pop may not be recommended as a related video.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.725-732
• /
• 2009

Thanks to the development of the Internet, people can easily access a vast amount of music. This brings attention to application systems such as a melody-based music search service or music recommendation service. Extracting melodies from music is a crucial process to provide such services. This paper introduces a novel algorithm that can extract melodies from piano music. Since piano can produce polyphonic music, we expect that by studying melody extraction from piano music, we can help extract melodies from general polyphonic music.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.923-927
• /
• 2009

The recent growth of a digital music market induces increasing demands for music searching and recommendation services. In order to improve the performance of music-based application services, the process of extracting melodies from polyphonic music is essential. In this paper, we propose a method to extract melodies from piano solo music which is highly polyphonic and has a wide pitch range. We categorize piano music into three classes taking into account the characteristics of music, and extract melodies according to each class. The performance evaluation for the implemented system showed that our method works successfully on a variety of piano solo music.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.45-52
• /
• 2022

With the development of artificial intelligence analysis methods, especially machine learning, various fields are widely expanding their application ranges. However, in the case of classical music, there still remain some difficulties in applying machine learning techniques. Genre classification or music recommendation systems generated by deep learning algorithms are actively used in general music, but not in classical music. In this paper, we attempted to classify opera among classical music. To this end, an experiment was conducted to determine which criteria are most suitable among, composer, period of composition, and emotional atmosphere, which are the basic features of music. To generate emotional labels, we adopted zero-shot classification with four basic emotions, 'happiness', 'sadness', 'anger', and 'fear.' After embedding the opera libretto with the doc2vec processing model, the optimal number of clusters is computed based on the result of the elbow method. Decided four centroids are then adopted in k-means clustering to classify unsupervised libretto datasets. We were able to get optimized clustering based on the result of adjusted rand index scores. With these results, we compared them with notated variables of music. As a result, it was confirmed that the four clusterings calculated by machine after training were most similar to the grouping result by period. Additionally, we were able to verify that the emotional similarity between composer and period did not appear significantly. At the end of the study, by knowing the period is the right criteria, we hope that it makes easier for music listeners to find music that suits their tastes.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.218-225
• /
• 2007

Recommendation system is one way of implementing personalized service. The collaborative filtering is one of the major techniques that have been employed for recommendation systems. It has proven its effectiveness in the recommendation systems for such domain as motion picture or music. However, it has some limitations, i.e., sparsity and scalability. In this research, as one way of overcoming such limitations, we proposed the stepwise collaborative filtering method. To show the practicality of our proposed method, we designed and implemented a movie recommendation system which we shall call Step_CF, and its performance was evaluated using MovieLens data. The performance of Step_CF was better than that of Basic_CF that was implemented using the original collaborative filtering method.