• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.11
• /
• pp.2043-2051
• /
• 2017

Lately, In addition to the increased interest in the big data field, there is also a growing interest in application fields through the processing of big data. Opinion Mining is a big data processing technique that is widely used in providing personalized service to users. Based on this, in this paper, textual review of users' places is processed by Opinion mining technique and the sentiment of users was analyzed through k-means clustering. The same numerical value is given to users who have a similar category of sentiment classified as a clustering operation. We propose a method to show recommendation contents to users by predicting preference using collaborative filtering recommendation system with assigned numerical values and marking contents with markers on the map in order of places with high predicted value.

• The Journal of Society for e-Business Studies
• /
• v.10 no.2
• /
• pp.109-132
• /
• 2005

With the flood of multimedia contents over the digital TV channels, the internet, and etc., users sometimes have a difficulty in finding their preferred contents, spend heavy surfing time to find them, and are even very likely to miss them while searching. In this paper we suggests two-step clustering technique using time schema on how the system can recommend the user's preferred contents based on the collaborative filtering that has been proved to be successful when new users appeared. This method maps and recommends users' profile according to the gender and age at the first step, and then recommends a probabilistic item clustering customers who choose the same item at the same time based on time schema at the second stage. In addition, this has improved the accuracy of predictions in recommendation and the efficiency in time calculation by reflecting feedbacks of the result of the recommender engine and dynamically update customers' preference.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.75-81
• /
• 2012

With the advance of internet technology and fast growing of data volume, it become very hard to find a demanding information from the huge amount of data. Recommender system can solve the delema by helping a user to find required information. This paper proposes a reinforcement learning based hybrid recommendation system to predict user's preference. The hybrid recommendation system combines the content based filtering and collaborate filtering, and the system was tested using 2000 images. We used mean abstract error(MAE) to compare the performance of the collaborative filtering, the content based filtering, the naive hybrid filtering, and the reinforcement learning algorithm based hybrid filtering methods. The experiment result shows that the performance of the proposed hybrid filtering performance based on reinforcement learning is superior to other methods.

• Journal of Digital Contents Society
• /
• v.18 no.4
• /
• pp.707-712
• /
• 2017

As the amount of data increases exponentially, the recommender system is attracting interest in various industries such as movies, books, and music, and is being studied. The recommendation system aims to propose an appropriate item to the user based on the user's past preference and click stream. Typical examples include Netflix's movie recommendation system and Amazon's book recommendation system. Previous studies can be categorized into three types: collaborative filtering, content-based recommendation, and hybrid recommendation. However, existing recommendation systems have disadvantages such as sparsity, cold start, and scalability problems. To improve these shortcomings and to develop a more accurate recommendation system, we have designed a recommendation system as a factorization machine using actual online product purchase data.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.431-436
• /
• 2015

As a number of TV programs broadcast today, researches about TV program recommender system have been studied and many researchers have been studying recommender system to produce recommendation with high accuracy. Recommender system recommends TV program to user by using metadata like genre, plot or calculating users' preferences about TV programs. In this paper, we propose a new TV program Collaborative Filtering Recommender System that exploits viewing time pattern like viewing ratio, relation with finish time and recently viewing history to calculate preference for high-quality of recommendation. To verify usefulness of our research, we also compare our method which utilizes viewing time patterns and baseline which simply recommends TV program of user's most frequently watched channel. Through this experiments, we show that our method very effectively works and recommendation performance increases.

• Journal of Intelligence and Information Systems
• /
• v.13 no.1
• /
• pp.91-105
• /
• 2007

This research suggests a recommendation system that enables bidirectional communications between the user and system using a utility range-based product recommendation algorithm in order to provide more dynamic and personalized recommendations. The main idea of the proposed algorithm is to find the utility ranges of products based on user specified preference information and calculate the similarity by using overlapping probability of two range values. Based on the probability, we determine what products are similar to each other among the products in the product list of collaborative companies. We have also developed a Web-based application system to recommend similar products to the customer. Using the system, we carry out the experiments for the performance evaluation of the procedure. The experimental study shows that the utility range-based approach is a viable solution to the similar product recommendation problems from the viewpoint of both accuracy and satisfaction rate.

• The Journal of Society for e-Business Studies
• /
• v.24 no.3
• /
• pp.129-142
• /
• 2019

The interest in the blockchain technology has been increasing since its inception and it has been applied to many fields and sectors. The blockchain technology creates a decentralized environment where no third party controls the data and transaction. Mobile apps recommendation has been extensively used to recommend apps to mobile users. For example, Android-based recommendation applications have been developed to recommend other mobile apps for download depending on user's preferences and mobile context. These recommendations help users discover apps by referring to the experiences of other users. Due to the collection of a large amount of data and user information, there is a problem of insecurity and user's privacy that are prone to be attacked. To address this issue the blockchain technology can be incorporated to assure cryptographic safety. In this paper, we present a survey of the on-going mobile app recommendations and e-commerce technology trend to address how the blockchain can be incorporated into the collaborative filtering recommendation systems to enable the users to set up a secured data, which implies the importance of user privacy preference on personalized app recommendations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.3-6
• /
• 2012

Due to recent rapid growth of mobile market, the modern people increasing make use of mobile contents as a means to obtain the desired information quickly by overcoming various restraints of a computer. The wide range of recommended contents, however, takes much time in selection of contents. To resolve such issues, a system that predicts the contents desired by the user and makes an accurate recommendation is necessary. In this paper, in order to provide the desired contents in line with the user demands, a method to increase select the number of recommendation using cooperative filtering is proposed. In the first step, the categories are formulated with super-classes and the similarity between the target customer and users is found, and the nearest-neighbors are constituted to find the preference predictions between super-classes, and the super-class with the highest resulting value is recommended to the target customer. In the second step, the preference predictions between sub-classes are found and the sub-class with the highest value is recommended to the target customer. In the experiment, mobile contents are recommended through super-class-based cooperative filtering, and then the mobile contents are recommended through sub-class-based cooperative filtering, and sub-class collaborative filtering method to select a high number of verification.

• Journal of Intelligence and Information Systems
• /
• v.22 no.3
• /
• pp.113-127
• /
• 2016

Among the techniques for recommendation, collaborative filtering (CF) is commonly recognized to be the most effective for implementing recommender systems. Until now, CF has been popularly studied and adopted in both academic and real-world applications. The basic idea of CF is to create recommendation results by finding correlations between users of a recommendation system. CF system compares users based on how similar they are, and recommend products to users by using other like-minded people's results of evaluation for each product. Thus, it is very important to compute evaluation similarities among users in CF because the recommendation quality depends on it. Typical CF uses user's explicit numeric ratings of items (i.e. quantitative information) when computing the similarities among users in CF. In other words, user's numeric ratings have been a sole source of user preference information in traditional CF. However, user ratings are unable to fully reflect user's actual preferences from time to time. According to several studies, users may more actively accommodate recommendation of reliable others when purchasing goods. Thus, trust relationship can be regarded as the informative source for identifying user's preference with accuracy. Under this background, we propose a new hybrid recommender system that fuses CF and social network analysis (SNA). The proposed system adopts the recommendation algorithm that additionally reflect the result analyzed by SNA. In detail, our proposed system is based on conventional memory-based CF, but it is designed to use both user's numeric ratings and trust relationship information between users when calculating user similarities. For this, our system creates and uses not only user-item rating matrix, but also user-to-user trust network. As the methods for calculating user similarity between users, we proposed two alternatives - one is algorithm calculating the degree of similarity between users by utilizing in-degree and out-degree centrality, which are the indices representing the central location in the social network. We named these approaches as 'Trust CF - All' and 'Trust CF - Conditional'. The other alternative is the algorithm reflecting a neighbor's score higher when a target user trusts the neighbor directly or indirectly. The direct or indirect trust relationship can be identified by searching trust network of users. In this study, we call this approach 'Trust CF - Search'. To validate the applicability of the proposed system, we used experimental data provided by LibRec that crawled from the entire FilmTrust website. It consists of ratings of movies and trust relationship network indicating who to trust between users. The experimental system was implemented using Microsoft Visual Basic for Applications (VBA) and UCINET 6. To examine the effectiveness of the proposed system, we compared the performance of our proposed method with one of conventional CF system. The performances of recommender system were evaluated by using average MAE (mean absolute error). The analysis results confirmed that in case of applying without conditions the in-degree centrality index of trusted network of users(i.e. Trust CF - All), the accuracy (MAE = 0.565134) was lower than conventional CF (MAE = 0.564966). And, in case of applying the in-degree centrality index only to the users with the out-degree centrality above a certain threshold value(i.e. Trust CF - Conditional), the proposed system improved the accuracy a little (MAE = 0.564909) compared to traditional CF. However, the algorithm searching based on the trusted network of users (i.e. Trust CF - Search) was found to show the best performance (MAE = 0.564846). And the result from paired samples t-test presented that Trust CF - Search outperformed conventional CF with 10% statistical significance level. Our study sheds a light on the application of user's trust relationship network information for facilitating electronic commerce by recommending proper items to users.

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.195-211
• /
• 2010

An exhibition is defined as market events for specific duration to present exhibitors' main product range to either business or private visitors, and it also plays a key role as effective marketing channels. Especially, as the effect of the opinions of the visitors after the exhibition impacts directly on sales or the image of companies, exhibition organizers must consider various needs of visitors. To meet needs of visitors, ubiquitous technologies have been applied in some exhibitions. However, despite of the development of the ubiquitous technologies, their services cannot always reflect visitors' preferences as they only generate information when visitors request. As a result, they have reached their limit to meet needs of visitors, which consequently might lead them to loss of marketing opportunity. Recommendation systems can be the right type to overcome these limitations. They can recommend the booths to coincide with visitors' preferences, so that they help visitors who are in difficulty for choices in exhibition environment. One of the most successful and widely used technologies for building recommender systems is called Collaborative Filtering. Traditional recommender systems, however, only use neighbors' evaluations or behaviors for a personalized prediction. Therefore, they can not reflect visitors' dynamic preference, and also lack of accuracy in exhibition environment. Although there is much useful information to infer visitors' preference in ubiquitous environment (e.g., visitors' current location, booth visit path, and so on), they use only limited information for recommendation. In this study, we propose a booth recommendation methodology using Sequential Association Rule which considers the sequence of visiting. Recent studies of Sequential Association Rule use the constraints to improve the performance. However, since traditional Sequential Association Rule considers the whole rules to recommendation, they have a scalability problem when they are adapted to a large exhibition scale. To solve this problem, our methodology composes the confidence database before recommendation process. To compose the confidence database, we first search preceding rules which have the frequency above threshold. Next, we compute the confidences of each preceding rules to each booth which is not contained in preceding rules. Therefore, the confidence database has two kinds of information which are preceding rules and their confidence to each booth. In recommendation process, we just generate preceding rules of the target visitors based on the records of the visits, and recommend booths according to the confidence database. Throughout these steps, we expect reduction of time spent on recommendation process. To evaluate proposed methodology, we use real booth visit records which are collected by RFID technology in IT exhibition. Booth visit records also contain the visit sequence of each visitor. We compare the performance of proposed methodology with traditional Collaborative Filtering system. As a result, our proposed methodology generally shows higher performance than traditional Collaborative Filtering. We can also see some features of it in experimental results. First, it shows the highest performance at one booth recommendation. It detects preceding rules with some portions of visitors. Therefore, if there is a visitor who moved with very a different pattern compared to the whole visitors, it cannot give a correct recommendation for him/her even though we increase the number of recommendation. Trained by the whole visitors, it cannot correctly give recommendation to visitors who have a unique path. Second, the performance of general recommendation systems increase as time expands. However, our methodology shows higher performance with limited information like one or two time periods. Therefore, not only can it recommend even if there is not much information of the target visitors' booth visit records, but also it uses only small amount of information in recommendation process. We expect that it can give real?time recommendations in exhibition environment. Overall, our methodology shows higher performance ability than traditional Collaborative Filtering systems, we expect it could be applied in booth recommendation system to satisfy visitors in exhibition environment.