• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.10
• /
• pp.399-406
• /
• 2021

With the steady growth of the content industry, the need for research that automatically recommending content suitable for individual tastes is increasing. In order to improve the accuracy of automatic content recommendation, it is needed to fuse existing recommendation techniques using users' preference history for contents along with recommendation techniques using content metadata or features extracted from the content itself. In this work, we propose a new graph-based music recommendation method which learns an LSTM-based classification model to automatically extract appropriate tagging words from sound data and apply the extracted tagging words together with the users' preferred music lists and music metadata to graph-based music recommendation. Experimental results show that the proposed method outperforms existing recommendation methods in terms of the recommendation accuracy.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.3
• /
• pp.221-232
• /
• 2023

In this paper, we propose a recommendation system based on the latent factor model using matrix factorization, which is one of the most commonly used collaborative filtering algorithms for recommendation systems. In particular, by introducing the concept of creating a list of recommended content and a list of non-preferred recommended content, and removing the non-preferred recommended content from the list of recommended content, we propose a method to ultimately increase the satisfaction. The experiment confirmed that using a separate list of non-preferred content to find non-preferred content increased precision by 135%, accuracy by 149%, and F1 score by 72% compared to using the existing recommendation list. In addition, assuming that users do not view non-preferred content through the proposed algorithm, the average evaluation score of a specific user used in the experiment increased by about 35%, from 2.55 to 3.44, thereby increasing user satisfaction. It has been confirmed that this algorithm is more effective than the algorithms used in existing recommendation systems.

• Management Science and Financial Engineering
• /
• v.16 no.2
• /
• pp.29-38
• /
• 2010

As the Internet is more embedded in people's lives, Internet users draw on new Internet applications to express themselves through "user-created content (UCC)." In addition, there is a noticeable shift from text-centered contents mainly posted on bulletin boards to multimedia contents such as images and videos on UCC web sites. The changes require different way of recommendations comparing to traditional products or contents recommendation on the Internet. This paper aims to design UCC recommendation methods with user behavior data and contents metadata such as tags and titles, and compare performances of the suggested methods. Real web logs data of a major Korean video UCC site was used to empirical experiments. The results of the experiments show that collaborative filtering technique based on similarity of UCC customers' preferences performs better than other content-based recommendation methods based on tag information and content metadata.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1013-1023
• /
• 2019

In content consumption environment with various live TV channels, VoD contents and web contents, recommendation service is now a necessity, not an option. Currently, various kinds of recommendation services are provided in the OTT service or the IPTV service, such as recommending popular contents or recommending related contents which similar to the content watched by the user. However, in the case of a content viewing environment through TV or IPTV which shares one TV and a TV set-top box, it is difficult to recommend proper content to a specific user because one or more usage histories are accumulated in one subscription information. To solve this problem, this paper interprets the concept of family as {user, time}, extends the existing recommendation relationship defined as {user, content} to {user, time, content} and proposes a method based on deep learning algorithm. Through the proposed method, we evaluate the recommendation performance qualitatively and quantitatively, and verify that our proposed model is improved in recommendation accuracy compared with the conventional method.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.602-609
• /
• 2007

Combining collaborative filtering with some other technique is most common in hybrid recommender systems. As many recommended items from collaborative filtering seem to be similar with respect to content, the collaborative-content hybrid system suffers in terms of quality recommendation and recommending new items as well. To alleviate such problem, we have developed a novel method that uses a diversity metric to select the dissimilar items among the recommended items from collaborative filtering, which together with the input when fed into content space let us improve and include new items in the recommendation. We present experimental results on movielens dataset that shows how our approach performs better than simple content-based system and naive hybrid system

• International Journal of Advanced Culture Technology
• /
• v.8 no.4
• /
• pp.167-176
• /
• 2020

Recommendation Systems is the top requirements for many people and researchers for the need required by them with the proper suggestion with their personal indeed, sorting and suggesting doctor to the patient. Most of the rating prediction in recommendation systems are based on patient's feedback with their information regarding their treatment. Patient's preferences will be based on the historical behaviour of similar patients. The similarity between the patients is generally measured by the patient's feedback with the information about the doctor with the treatment methods with their success rate. This paper presents a new method of predicting Top Ranked Doctor's in recommendation systems. The proposed Recommendation system starts by identifying the similar doctor based on the patients' health requirements and cluster them using K-Means Efficient Clustering. Our proposed K-Means Clustering with Content Based Doctor Recommendation for Cancer (KMC-CBD) helps users to find an optimal solution. The core component of KMC-CBD Recommended system suggests patients with top recommended doctors similar to the other patients who already treated with that doctor and supports the choice of the doctor and the hospital for the patient requirements and their health condition. The recommendation System first computes K-Means Clustering is an unsupervised learning among Doctors according to their profile and list the Doctors according to their Medical profile. Then the Content based doctor recommendation System generates a Top rated list of doctors for the given patient profile by exploiting health data shared by the crowd internet community. Patients can find the most similar patients, so that they can analyze how they are treated for the similar diseases, and they can send and receive suggestions to solve their health issues. In order to the improve Recommendation system efficiency, the patient can express their health information by a natural-language sentence. The Recommendation system analyze and identifies the most relevant medical area for that specific case and uses this information for the recommendation task. Provided by users as well as the recommended system to suggest the right doctors for a specific health problem. Our proposed system is implemented in Python with necessary functions and dataset.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.183-191
• /
• 2017

In order to secure the convenience of information retrieval by users of scientific information service platforms and to reduce the time required to acquire the proper information, this study proposes an optimized content recommendation algorithm among the algorithms that currently provide service menus and content information for each service, and conducts comparative evaluation on the results. To enhance the recommendation accuracy, users' major items were added to the original algorithm, and performance evaluations on the recommendation results from the original and optimized algorithms were performed. As a result of this evaluation, we found that the relevance of the content provided to the users through the optimized algorithm was increased by 21.2%. This study proposes a method to shorten the information acquisition time and extend the life cycle of the results as valuable information by automatically computing and providing content suitable for users in the system for each service menu.

• Journal of Convergence for Information Technology
• /
• v.9 no.5
• /
• pp.1-6
• /
• 2019

As the mobile market expands, a variety of platforms are available to provide multimodal media content. Multimodal media content contains heterogeneous data, accordingly, user requires much time and effort to select preferred content. Therefore, in this paper we propose multimodal media content classification using keyword weighting for recommendation. The proposed method extracts keyword that best represent contents through keyword weighting in text data of multimodal media contents. Based on the extracted data, genre class with subclass are generated and classify appropriate multimodal media contents. In addition, the user's preference evaluation is performed for personalized recommendation, and multimodal content is recommended based on the result of the user's content preference analysis. The performance evaluation verifies that it is superiority of recommendation results through the accuracy and satisfaction. The recommendation accuracy is 74.62% and the satisfaction rate is 69.1%, because it is recommended considering the user's favorite the keyword as well as the genre.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.1
• /
• pp.25-40
• /
• 2023

Recommendation systems are frequently used by users to generate intelligent automatic decisions. In the study of movie recommendation system, the existing approach uses largely collaboration and content-based filtering techniques. Collaborative filtering considers user similarity, while content-based filtering focuses on the activity of a single user. Also, mixed filtering approaches that combine collaborative filtering and content-based filtering are being used to compensate for each other's limitations. Recently, several AI-based similarity techniques have been used to find similarities between users to provide better recommendation services. This paper aims to provide the prospective expansion by deriving possible solutions through the analysis of various existing movie recommendation systems and their challenges.

• ETRI Journal
• /
• v.29 no.2
• /
• pp.169-178
• /
• 2007

With the advent of ubiquitous computing environments, it has become increasingly important for applications to take full advantage of contextual information, such as the user's location, to offer greater services to the user without any explicit requests. In this paper, we propose context-aware active services based on context-aware middleware for URC systems (CAMUS). The CAMUS is a middleware that provides context-aware applications with a development and execution methodology. Accordingly, the applications based on CAMUS respond in a timely fashion to contextual information. This paper presents the system architecture of CAMUS and illustrates the content recommendation and control service agents with the properties, operations, and tasks for context-aware active services. To evaluate CAMUS, we apply the proposed active services to a TV application domain. We implement and experiment with a TV content recommendation service agent, a control service agent, and TV tasks based on CAMUS. The implemented content recommendation service agent divides the user's preferences into common and specific models to apply other recommendations and applications easily, including the TV content recommendations.