• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.385-386
• /
• 2020

In this paper, we propose a collaborative filtering recommendation algorithm based on the LDA2Vec topic model. By extracting and analyzing the article's content, calculate their semantic similarity then combine the traditional collaborative filtering algorithm to recommend. This approach may promote the system's recommend accuracy.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.40-51
• /
• 2011

The key issues of recommendation systems provide the contents satisfying the interests of users for the huge amounts of contents over internet. The existing recommendation system use the algorithms considering the users' profiles and context information to enhance the exactness of a recommendation. However, the existing recommendation system can't satisfy the requirements of service providers because the business models of service providers is not considered. In this paper, we propose the mobile recommendation system using the composite contexts and the recommendation weights applying the business model of service providers. The proposed system retrieves the contents of the contents providers using composite context information and apply the recommendation weights to recommend the suitable contents for the business models of service providers. Therefore, we provide the contents satisfying the consumption value of users and the business models of service providers to mobile users.

• The KIPS Transactions:PartD
• /
• v.16D no.2
• /
• pp.273-280
• /
• 2009

Today, many services and products that used to be only provided on offline have been being provided on the web according to the improvement of computing environment and the activation of web usage. These web-based services and products tend to be provided to customer by customer's preferences. This paradigm that considers customer's opinions and features in selecting is called personalization. The related research field is a recommendation. And this recommendation is performed by recommender system. Generally the recommendation is made from the preferences and tastes of customers. And recommender system provides this recommendation to user. However, the recommendation techniques have a couple of problems; they do not provide suitable recommendation to new users and also are limited to computing space that they generate recommendations which is dependent on ratings of products by users. Those problems has gathered some continuous interest from the recommendation field. In the case of new users, so similar users can't be classified because in the case of new users there is no rating created by new users. The problem of the limitation of the recommendation space is not easy to access because it is related to moneywise that the cost will be increasing rapidly when there is an addition to the dimension of recommendation. Therefore, I propose the solution of the recommendation problem of new user and the usage of item quality as weight to improve the accuracy of recommendation in this paper.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.459-468
• /
• 2013

This paper is 1) to find out how they recognize medicinal foods, 2) to analyze what make it select for functional restaurants, then which attributes affect on satisfaction and recommendation, 3) and to suggest distinguished guidelines for attracting core customers continuously. The questionnaires are distributed 200 who had only visited in medicinal restaurants and used for data analysis 181 except 19. The findings are summed up as follows; 1. All three factors which are showed 'health managing & prevention', 'functional foods', and 'cuisine presentation' had significant on satisfaction, recommendation, and revisited intention in medicinal restaurant. Among them, 'health managing & prevention' factor had significant highly. 2. Satisfaction variable had affected strongly on recommendation, and also, recommendation had affected on revisited intention.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.111-117
• /
• 2020

Dessert Ateliers (DA) are small shops that sell high-end homemade desserts such as macaroons, cakes, and cookies, and their popularity is increasing according to the emergence of small luxury trends. Even though each DA sells the same kinds of desserts, they are differentiated by the personality of their pastry chef; thus, there is a need to purchase desserts online that customers cannot see and purchase offline, and thus dessert e-commerce has emerged. However, it is impossible for customers to identify all the information of each DA and clearly understand customers' preferences when buying desserts through the dessert e-commerce. When a dessert e-commerce service provides a DA recommendation service, customers can reduce the time they hesitate before making a decision. Therefore, this paper proposes two kinds of DA recommendation method: a clustering-based recommendation method that calculates the similarity between customers' content and DAs and a dynamic weighting-based recommendation method that trains the importance of decision factors considering customer preferences. Various experiments were conducted using a real-world dataset to evaluate the performance of the proposed methods and it showed satisfactory results.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.119-126
• /
• 2009

In recent years, many recommendation service systems that search or recommend information automatically considering user's taste or property are developed. However, there is a weak point that correct recommendation is hard without considering the preference of user's context. This paper proposes a filtering method that gives correct recommendation considering the preference of user's context. To support this method, we get UCOP(User-Context Object Preference) using the preference of user's context and Pearson correlation coefficient. The results of the experiment show the improvement of 11%, 2% of precision and 8%, 4% of recall comparing with the existing service systems. Our recommendation service systems show 77% of precision and 53% of recall overall.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.440-443
• /
• 2005

The wide spread of internet business recently necessitates recommendation systems which can recommend the most suitable product fur customer demands. Currently the recommendation systems use content-based filtering and/or collaborative filtering methods, which are unable both to explain the reason for the recommendation and to reflect constantly changing requirements of the users. These methods guarantee good efficiency only if there is a lot of information about users. This paper proposes an algorithm called 'demand articulate & integration' which can perceive user's continuously varying intents and recommend proper contents. A method of knowledge classification which can be applicable to this algorithm is also developed in order to disassemble knowledge into basic units and articulate indices. The algorithm provides recommendation outputs that are close to expert's opinion through the tracing of articulate index. As a case study, a knowledge base for heritage information is constructed with the expert guide's knowledge. An intelligent recommendation system that can guide heritage tour as good as the expert guider is developed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2399-2413
• /
• 2021

A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

• 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.

• 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.