• Journal of the Korean Society for information Management
• /
• v.39 no.3
• /
• pp.1-22
• /
• 2022

The purpose of this study is to propose a book recommendation system that can be used in school libraries. The book recommendation system applies an algorithm based on association rules using DLS lending data and is designed to provide personalized book recommendation services to school library users. For this purpose, association rules based on the Apriori algorithm and betweenness centrality analysis were applied and detailed functions such as descriptive statistics, generation of association rules, student-centered recommendation, and book-centered recommendation were materialized. Subsequently, opinions on the use of the book recommendation system were investigated through in-depth interviews with teacher librarians. As a result of the investigation, opinions on the necessity and difficulty of book recommendation, student responses, differences from existing recommendation methods, utilization methods, and improvements were confirmed and based on this, the following discussions were proposed. First, it is necessary to provide long-term lending data to understand the characteristics of each school. Second, it is necessary to discuss the data integration plan by region or school characteristics. Third, It is necessary to establish a book recommendation system provided by the Comprehensive Support System for Reading Education. Based on the contents proposed in this study, it is expected that various discussions will be made on the application of a personalization recommendation system that can be used in the school library in the future.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.11
• /
• pp.1719-1724
• /
• 2013

Big data which requires a different approach from existing data processing methods, is unstructured data with a variety of features. The features mean the volume of data, the rate of change of the data, the data with a variety of features. Tweets of twitter in only Korea are more than 5 millions per day. So much cheaper data storage and analysis system due to the increasing demand for information, the value of research is increasing. In this paper, the technology required by the deformation characteristics of the data elements as a technology priority-based word-based recommendation algorithm is proposed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.300-301
• /
• 2016

This paper proposes customized recommendation algorithm to improve the QoS(quality of service) of sport for all sports content uses to user profile and team grade. The proposed recommendation module is based on user profile information, and it recommends suitable team contents to user with Euclidean distance algorithm and preference weights between teams.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4684-4705
• /
• 2019

Collaborative filtering recommender systems are vulnerable to shilling attacks in which malicious users may inject biased profiles to promote or demote a particular item being recommended. To tackle this problem, many robust collaborative recommendation methods have been presented. Unfortunately, the robustness of most methods is improved at the expense of prediction accuracy. In this paper, we construct a robust Bayesian probabilistic matrix factorization model for collaborative filtering recommender systems by incorporating the detection of user anomaly rating behaviors. We first detect the anomaly rating behaviors of users by the modified K-means algorithm and target item identification method to generate an indicator matrix of attack users. Then we incorporate the indicator matrix of attack users to construct a robust Bayesian probabilistic matrix factorization model and based on which a robust collaborative recommendation algorithm is devised. The experimental results on the MovieLens and Netflix datasets show that our model can significantly improve the robustness and recommendation accuracy compared with three baseline methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.655-656
• /
• 2022

Among the analysis methods for a recommendation system, collaborative filtering is a major representative method in a recommendation system based on data analysis. A general usage method is a technique of finding a common pattern by using evaluation data of users for various items, and recommending a preferred item for a specific user. Therefore, in this paper, various algorithms were used to measure the index, and an algorithm suitable for prediction of user preference was found and presented.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.141-148
• /
• 2010

In mobile terminal recommend service system has general information restrictive recommend that individuality considering to user's information find and recommend. Also it has difficult of accurate information recommend bad points user's not offer individuality information preference recommend service. Therefore this paper is propose user's information individuality preference considering by user's individuality preference recommendation system using improved k-means algorithm. Propose method is correlation coefficients using user's information individuality preference when user's individuality preference recommendation using improved k-means algorithm. Restrictive information recommend to fix a problem, information of restrictive general recommend that user's information individuality preference offer to accurate information recommend. Performance experiment is existing service system as compared to evaluating the effectiveness of precision and recall, performance experiment result is appear to precision 85%, recall 68%.

• Journal of Information Technology Applications and Management
• /
• v.26 no.5
• /
• pp.57-65
• /
• 2019

Recommendation Systems are information technologies that E-commerce merchants have adopted so that online shoppers can receive suggestions on items that might be interesting or complementing to their purchased items. These systems stipulate valuable assistance to the user's purchasing decisions, and provide quality of push service. Traditionally, Recommendation Systems have been designed using a centralized system, but information service is growing vast with a rapid and strong scalability. The next generation of information technology such as Cloud Computing and Big Data Environment has handled massive data and is able to support enormous processing power. Nevertheless, analytic technologies are lacking the different capabilities when processing big data. Accordingly, we are trying to design a conceptual service model with a proposed new algorithm and user adaptation on dynamic recommendation service for big data environment.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.343-350
• /
• 2020

In the era of the Fourth Industrial Revolution in the digital revolution is taking place, various attempts have been made to provide various contents in a digital environment. In this paper, agent-recruitment service system based on collaborative deep learning is proposed for the intelligent head hunting service. The service system is improved from previous research [7] using collaborative deep learning for more reliable recommendation results. The Collaborative deep learning is a hybrid recommendation algorithm using "Recurrent Neural Network(RNN)" specialized for exponential calculation, "collaborative filtering" which is traditional recommendation filtering methods, and "KNN-Clustering" for similar user analysis. The proposed service system can expect more reliable recommendation results than previous research and showed high satisfaction in user survey for verification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5826-5841
• /
• 2019

In our previous research, we proposed a tag emotion-based item recommendation scheme. The ternary associations among users, items, and tags are described as a three-order tensor in order to capture the emotions in tags. The candidates for recommendation are created based on the latent semantics derived by a high-order singular value decomposition technique (HOSVD). However, the tensor is very sparse because the number of tagged items is smaller than the amount of all items. The previous research do not consider the previous behaviors of users and items. To mitigate the problems, in this paper, the item-based collaborative filtering scheme is used to build an extended data. We also apply the probabilistic ranking algorithm considering the user and item profiles to improve the recommendation performance. The proposed method is evaluated based on Movielens dataset, and the results show that our approach improves the performance compared to other methods.

• Journal of Information Processing Systems
• /
• v.15 no.3
• /
• pp.616-631
• /
• 2019

With the rapid increase of information on the World Wide Web, finding useful information on the internet has become a major problem. The recommendation system helps users make decisions in complex data areas where the amount of data available is large. There are many methods that have been proposed in the recommender system. Collaborative filtering is a popular method widely used in the recommendation system. However, collaborative filtering methods still have some problems, namely cold-start problem. In this paper, we propose a movie recommendation system by using social network analysis and collaborative filtering to solve this problem associated with collaborative filtering methods. We applied personal propensity of users such as age, gender, and occupation to make relationship matrix between users, and the relationship matrix is applied to cluster user by using community detection based on edge betweenness centrality. Then the recommended system will suggest movies which were previously interested by users in the group to new users. We show shown that the proposed method is a very efficient method using mean absolute error.