• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.4
• /
• pp.953-960
• /
• 2016

Due to the prevalent use of online systems and the increasing amount of accessible information, the influence of recommender systems is growing bigger than ever. However, there are several attempts by malicious users who try to compromise or manipulate the reliability of recommender systems with cyber-attacks. By analyzing the ratio of 'sympathy' against 'apathy' responses about a concerned review and reflecting the results in a recommendation system, we could present a way to improve the performance of a recommender system and maintain a robust system. After collecting and applying actual movie review data, we found that our proposed recommender system showed an improved performance compared to the existing recommendation systems.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.111-121
• /
• 2009

In this paper, we propose a multimedia recommender system using user's playback time. Proposed system collects multimedia content which is requested by user and its user‘s playback time, as web log data. The system predicts playback time.based preference level and related contents from collected transaction database by fuzzy association rule mining. Proposed method has a merit which sorts recommendation list according to preference without user’s custom preference data, and prevents a false preference. As an experimental result, we confirm that proposed system discovers useful rules and applies them to recommender system from a transaction which doesn‘t include custom preferences.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1333-1337
• /
• 2017

Recommender systems (RS) that predict a set of items a target user is likely to prefer have been extensively studied in academia and have been aggressively implemented by many companies such as Google, Netflix, eBay, and Amazon. Data imputation alleviates the data sparsity problem occurring in recommender systems by inferring missing ratings and adding them to the original data. In this paper, we point out the drawbacks of existing approaches and make suggestions for data imputation techniques. We also justify our suggestions through extensive experiments.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.71-85
• /
• 2008

The rapid growth of blog has caused information overload where bloggers in the virtual community space are no longer able to effectively choose the blogs they are exposed to. Recommender systems have been widely advocated as a way of coping with the problem of information overload in e-business environment. Collaborative Filtering (CF) is the most successful recommendation method to date and used in many of the recommender systems. In this research, we propose a CF-based recommender system for bloggers to find their similar bloggers or preferable virtual community without burdensome search effort. For such a purpose, we apply the "Interest Value" to CF recommender systems. The Interest Value is the quantity value about users' transaction data in virtual community, and can measure the opinion of users accurately. Based on the Interest Value, the neighborhood group is generated, and virtual community list is recommended using the Community Likeness Score (ClS). Our experimental results upon real data of Korean Blog site show that the methodology is capable of dealing with the information overload issue in virtual community space. And Interest Value is proved to have the potential to meet the challenge of recommendation methodologies in virtual community space.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1380-1385
• /
• 2015

Collaborative filtering is one of the most successfully used methods for recommender systems and has been utilized in various areas such as books and music. The key point of this method is selecting the most proper recommenders, for which various similarity measures have been studied. To improve recommendation performance, this study analyzes problems of existing recommender selection methods based on similarity and presents a method of dynamically determining recommenders based on the rate of co-rated items as well as similarity. Examination of performance with varying thresholds through experiments revealed that the proposed method yielded greatly improved results in both prediction and recommendation qualities, and that in particular, this method showed performance improvements with only a few recommenders satisfying the given thresholds.

• Journal of Information Processing Systems
• /
• v.9 no.3
• /
• pp.435-460
• /
• 2013

Recommender systems are popular applications that help users to identify items that they could be interested in. A recent research area on recommender systems focuses on detecting several kinds of inconsistencies associated with the user preferences. However, the majority of previous works in this direction just process anomalies that are intentionally introduced by users. In contrast, this paper is centered on finding the way to remove non-malicious anomalies, specifically in collaborative filtering systems. A review of the state-of-the-art in this field shows that no previous work has been carried out for recommendation systems and general data mining scenarios, to exactly perform this preprocessing task. More specifically, in this paper we propose a method that is based on the extraction of knowledge from the dataset in the form of rating regularities (similar to frequent patterns), and their use in order to remove anomalous preferences provided by users. Experiments show that the application of the procedure as a preprocessing step improves the performance of a data-mining task associated with the recommendation and also effectively detects the anomalous preferences.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.293-300
• /
• 2006

The Recommender systems help users to find and evaluate items of interest. Such systems have become powerful tools in the domains from electronic commerce to digital libraries and knowledge management. Sellers can recommend products to customers with the prediction of future buying behavior on the basis of the consumer's population statistics and past selling behavior. In this paper, we are describing the design and the development of personalization recommender system which increases satisfaction level of customers by searching products to reflect the pattern and propensity of customers properly. The suggested system supplies the real-time analysis service to predict the customers purchase situation by applying the association rule of the data mining.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.3
• /
• pp.139-147
• /
• 2009

This paper proposed the context awareness reasoning system to provide the personalized services dynamically in a ubiquitous mobile environments. The proposed system is designed to provide the personalized services to mobile users and consists of the context aggregator and the knowledge manager. The context aggregator can collect information from networks through Open API Gateway as well as sensors in a various ubiquitous environment. And it can also extract the place types through the geocoding and the social address domain ontology. The knowledge manager is the core component to provide the personalized services, and consists of activity reasoner, user pattern learner and service recommender to provide the services predict by extracting the optimized service from user situations. Activity reasoner uses the ontology reasoning and user pattern learner learns with previous service usage history and contexts. And to design service recommender easy to flexibly apply in dynamic environments, service recommender recommends service in the only use of current accessible contexts. Finally, we evaluate the learner and recommender of proposed system by simulation.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.1
• /
• pp.241-248
• /
• 2018

A Recommender System (RS) is a system that provides optimized information to users in an over-supply situation. The key to RS is to accurately predict the behavior of the user. The Matrix Factorization (MF) method was used for this prediction in the early stage, and according to the recent SNS development, social information is additionally utilized to improve prediction accuracy. In this paper, we use RS internal trust cluster, which was overlooked in previous studies, to further improve performance and analyze the characteristics of trust clusters.

• Journal of KIISE:Software and Applications
• /
• v.31 no.2
• /
• pp.153-163
• /
• 2004

Many recommender systems are based on Content-based Filtering and Social Filtering Both methods have their own advantages and disadvantages, and they complement each other rather than compete. So incorporating of both methods can make the better system and combination technique controls the quality of the entire recommender system. In this paper, we presented each user has his own tendency to decide which is the better recommendation for himself among the various recommendation results, and suggested the Personalized combination technique. To represent user tendency, we defined and used loyalty, diversity and pioneerity and showed by experiments that our combination technique is useful. This combination technique improved the average coverage 23% and for the ceiling 40%.