• Title/Summary/Keyword: Database for Popular Music

Search Result 4, Processing Time 0.017 seconds

Application and Need of Korean Popular songs as the Educational Contents (교육적 콘텐츠로의 한국 대중가요의 활용과 필요)

  • Jung, Ji-Young
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.174-185
    • /
    • 2012
  • The social and cultural influence about the popular music in Korea has been increased and the industry of popular culture has been also growing compared with other fields. In addition to this, many universities in Korea tends to establish departments of popular music for undergraduate and graduate program. Firstly, this paper suggest that the analysis of popular songs can be raised the academic value by the modern music theory. Secondly, the database of Korean popular songs should be built up so that popular songs can be classified to various aspects such as composers, musical style etc. As a result, Korean popular music deserves special consideration not just for the industrial value but for the contents of music education. Furthermore, these research can contribute that popular songs should be regarded and applied as a educational contents for the academic development and social improvement.

Music Genre Classification System Using Decorrelated Filter Bank (Decorrelated Filter Bank를 이용한 음악 장르 분류 시스템)

  • Lim, Shin-Cheol;Jang, Sei-Jin;Lee, Seok-Pil;Kim, Moo-Young
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.2
    • /
    • pp.100-106
    • /
    • 2011
  • Music recordings have been digitalized such that huge size of music database is available to the public. Thus, the automatic classification system of music genres is required to effectively manage the growing music database. Mel-Frequency Cepstral Coefficient (MFCC) is a popular feature vector for genre classification. In this paper, the combined super-vector with Decorrelated Filter Bank (DFB) and Octave-based Spectral Contrast (OSC) using texture windows is processed by Support Vector Machine (SVM) for genre classification. Even with the lower order of the feature vector, the proposed super-vector produces 4.2 % improved classification accuracy compared with the conventional Marsyas system.

A Case Study on Mobile Web and Social Network Service in Digital Music Market : The New Management of NeowizBugs (디지털 음악시장에서 모바일 웹과 소셜네트워크서비스 사례연구 : 네오위즈벅스의 신경영)

  • Yoo, Byung-Joon;Kim, Kwan-Soo
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.1
    • /
    • pp.1-15
    • /
    • 2011
  • The new environment of music service has brought changes in digital music industry. Today, various forms of music contents are presented in ubiquitous environments. Thus, securing various contents becomes very important in monopolistic competition of music market. Under the circumstance, web 2.0 provides a networking environment to form diverse relations. Social Network Service (SNS) is a service to emphasize people relation and is different from information-centered Internet service. And mobile SNS becomes popular as Smartphone rapidly increases. NeowizBugs merged with NeowizInternet managing Sayclub of a music-specified SNS site. And the firm confirms comprehensive contents by making ties with SM entertainment. Thus, the integration corporation secures and manages a new business model by linking digital contents with SNS. Generally, music-specified SNS has advertisement business model and uses a recommend system utilizing the database of users. By introducing the case of NeowizBugs, this study tries to identify the success strategy of music distributors fitting ubiquitous environment including web 2.0, mobile SNS, Smartphone, etc.

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.