• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.61-75
• /
• 2007

In ubiquitous computing, shared environments are required to adapt to people intelligently. Based on information about user preferences, the shared environments should be adjusted so that all users in a group are satisfied as possible. Although many group recommender systems have been proposed to obtain this purpose, they only consider average and misery. However, a broad range of philosophical approaches suggest that high inequality reduces social agreeability, and consequently causes users' dissatisfactions. In this paper, we propose social welfare functions, which consider inequalities in users' preferences, as alternative aggregation functions to achieve a social agreeability. Using an example in a previous work[7], we demonstrate the effectiveness of proposed welfare functions as socially agreeable aggregate functions in group recommender systems.

• International Journal of Contents
• /
• v.13 no.1
• /
• pp.53-61
• /
• 2017

Recently, the Social Internet of Things (IoT), the follow-up of the IoT, has been studied to expand the existing IoT services, by integrating devices into the social network of people. In the Social IoT environment, humans, devices and digital contents are connected with social relationships, to guarantee the network navigability and establish levels of trustworthiness. However, this environment handles massive data, including social data of humans (e.g., profile, interest and relationship), profiles of IoT devices, and digital contents. Hence, users and service providers in the Social IoT are exposed to arbitrary data when searching for specific information. A study about the recommender system for the Social IoT environment is therefore needed, to provide the required information only. In this paper, we propose the Social correlation group based Recommender System (SRS). The SRS generates a target group, depending on the social correlation of the service requirement. To generate the target group, we have designed an architecture, and proposed a procedure of the SRS based on features of social interest similarity and principles of the Collaborative Filtering and the Content-based Recommender System. With simulation results of the target scenario, we present the possibility of the SRS to be adapted to various Social IoT services.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.344-353
• /
• 2006

Nowadays many people participate in online communities for information sharing. But most recommender systems are designed for personalization of individual user, so it is necessary to develop a recommendation procedure for group users, such as participants in online communities. This paper proposes a group recommender system to recommend books for group users in online communities. For such a purpose, we suggest a group recommendation procedure consisting of two phases. The first phase is to generate recommendation list for 'big user' using collaborative filtering, and the second phase is to remove irrelevant books among previous list reflecting the preference of each individual user. The procedure is explained step by step with an illustrative example. And this procedure can potentially be applied to other domains, such as music, movies and etc.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2005.11a
• /
• pp.415-424
• /
• 2005

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. Therefore, we propose a CF-based recommender system for bloggers in the virtual community space. Our proposed methodology consists of three main phases: In the first phase, we apply the "Interest Value" to a recommender system. The Interest Value is a quantity value about user preference in virtual community, and can measure the opinion of users accurately. Next phase, we generate the neighborhood group based on the Interest Value. In the final phase, we use the Community Likeness Score (CLS) to generate the top-n recommendation list. The methodology is explained step by step with an illustrative example and is verified with real data of a blog service provider.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.19-42
• /
• 2012

Consumer consumption patterns are shifting rapidly as buyers migrate from offline markets to e-commerce routes, such as shopping channels on TV and internet shopping malls. In the offline markets consumers go shopping, see the shopping items, and choose from them. Recently consumers tend towards buying at shopping sites free from time and place. However, as e-commerce markets continue to expand, customers are complaining that it is becoming a bigger hassle to shop online. In the online shopping, shoppers have very limited information on the products. The delivered products can be different from what they have wanted. This case results to purchase cancellation. Because these things happen frequently, they are likely to refer to the consumer reviews and companies should be concerned about consumer's voice. E-commerce is a very important marketing tool for suppliers. It can recommend products to customers and connect them directly with suppliers with just a click of a button. The recommender system is being studied in various ways. Some of the more prominent ones include recommendation based on best-seller and demographics, contents filtering, and collaborative filtering. However, these systems all share two weaknesses : they cannot recommend products to consumers on a personal level, and they cannot recommend products to new consumers with no buying history. To fix these problems, we can use the information which has been collected from the questionnaires about their demographics and preference ratings. But, consumers feel these questionnaires are a burden and are unlikely to provide correct information. This study investigates combining collaborative filtering with the centrality of social network analysis. This centrality measure provides the information to infer the preference of new consumers from the shopping history of existing and previous ones. While the past researches had focused on the existing consumers with similar shopping patterns, this study tried to improve the accuracy of recommendation with all shopping information, which included not only similar shopping patterns but also dissimilar ones. Data used in this study, Movie Lens' data, was made by Group Lens research Project Team at University of Minnesota to recommend movies with a collaborative filtering technique. This data was built from the questionnaires of 943 respondents which gave the information on the preference ratings on 1,684 movies. Total data of 100,000 was organized by time, with initial data of 50,000 being existing customers and the latter 50,000 being new customers. The proposed recommender system consists of three systems : [+] group recommender system, [-] group recommender system, and integrated recommender system. [+] group recommender system looks at customers with similar buying patterns as 'neighbors', whereas [-] group recommender system looks at customers with opposite buying patterns as 'contraries'. Integrated recommender system uses both of the aforementioned recommender systems to recommend movies that both recommender systems pick. The study of three systems allows us to find the most suitable recommender system that will optimize accuracy and customer satisfaction. Our analysis showed that integrated recommender system is the best solution among the three systems studied, followed by [-] group recommended system and [+] group recommender system. This result conforms to the intuition that the accuracy of recommendation can be improved using all the relevant information. We provided contour maps and graphs to easily compare the accuracy of each recommender system. Although we saw improvement on accuracy with the integrated recommender system, we must remember that this research is based on static data with no live customers. In other words, consumers did not see the movies actually recommended from the system. Also, this recommendation system may not work well with products other than movies. Thus, it is important to note that recommendation systems need particular calibration for specific product/customer types.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.298-305
• /
• 2009

In contrast to content_based filtering systems, collaborative filtering systems not only don't contain information of items, they can not recommend items when users don't provide the information of their interests. In this paper, we propose the recommender agent using association item tree to solve the shortcomings of collaborative filtering systems. Firstly, the proposed method clusters users into groups using vector space model and K-means algorithm and selects group typical rating values. Secondly, the degree of associations between items is extracted from computing mutual information between items and an associative item tree is generated by group. Finally, the method recommends items to an active user by using a group typical rating value and an association item tree. The recommender agent recommends items by combining user information with item information. In addition, it can accurately recommend items to an active user, whose information is insufficient at first rate, by using an association item tree based on mutual information for the similarity between items. The proposed method is compared with previous methods on the data set of MovieLens recommender system.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.717-726
• /
• 2006

This study is to investigate the MAE of prediction value by collaborative filtering algorithm originated by GroupLens and improved algorithm. To decrease the MAE on the collaborative recommender system on user based, this research proposes the improved algorithm, which reduces the possibility of over estimation of active user's preference mean collaboratively using other user’s preference mean. The result shows the MAE of prediction by improved algorithm is better than original algorithm, so the active user's preference mean used in prediction formula is possibly over estimated.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.50-56
• /
• 2009

This paper proposes a new algorithm of clustering similar nodes defined as nodes having similar characteristic values in pure P2P environment. To compare similarity between nodes, we introduce a fitness function whose return value depends only on the two nodes' characteristic values. The higher the return value is, the more similar the two nodes are. We propose a GORGFM algorithm newly in conjunction with the fitness function to recommend and exchange nodes' characteristic values for an interest group formation and maintenance. With the GORGFM algorithm, the interest groups are formed dynamically based on the similarity of users, and all nodes will highly satisfy with the information recommended and received from nodes of the interest group. To evaluate of performance of the GORGFM algorithm, we simulated a matching rate by the total number of nodes of network and the number of iterations of the algorithm to find similar nodes accurately. The result shows that the matching rate is highly accurate. The GORGFM algorithm proposed in this paper is highly flexible to be applied for any searching system on the web.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.803-811
• /
• 2010

This study analyzes the characteristics of preference ratings by dividing estimated values into four groups according to rank correlation coefficient after obtaining preference estimated value to user's ratings by using collaborative filtering algorithm. It is known that the value of standard error of skewness and standard error of kurtosis lower in the group of higher rank correlation coefficient This explains that the preference of higher rank correlation coefficient has lower extreme values and the differences of preference rating values. In addition, top n recommendation lists are made after obtaining rank fitting by using the result ranks of prediction value and the ranks of real rated values, and this top n is applied to the four groups. The value of top n recommendation is calculated higher in the group of higher rank correlation coefficient, and the recommendation accuracy in the group of higher rank correlation coefficient is higher than that in the group of lower rank correlation coefficient Thus, when using standard error of skewness and standard error of kurtosis in recommender system, rank correlation coefficient can be higher, and so the accuracy of recommendation prediction can be increased.

• Journal of Intelligence and Information Systems
• /
• v.19 no.2
• /
• pp.39-54
• /
• 2013

Recent explosive increase of electronic commerce provides many advantageous purchase opportunities to customers. In this situation, customers who do not have enough knowledge about their purchases, may accept product recommendations. Product recommender systems automatically reflect user's preference and provide recommendation list to the users. Thus, product recommender system in online shopping store has been known as one of the most popular tools for one-to-one marketing. However, recommender systems which do not properly reflect user's preference cause user's disappointment and waste of time. In this study, we propose a novel recommender system which uses data mining and multi-model ensemble techniques to enhance the recommendation performance through reflecting the precise user's preference. The research data is collected from the real-world online shopping store, which deals products from famous art galleries and museums in Korea. The data initially contain 5759 transaction data, but finally remain 3167 transaction data after deletion of null data. In this study, we transform the categorical variables into dummy variables and exclude outlier data. The proposed model consists of two steps. The first step predicts customers who have high likelihood to purchase products in the online shopping store. In this step, we first use logistic regression, decision trees, and artificial neural networks to predict customers who have high likelihood to purchase products in each product group. We perform above data mining techniques using SAS E-Miner software. In this study, we partition datasets into two sets as modeling and validation sets for the logistic regression and decision trees. We also partition datasets into three sets as training, test, and validation sets for the artificial neural network model. The validation dataset is equal for the all experiments. Then we composite the results of each predictor using the multi-model ensemble techniques such as bagging and bumping. Bagging is the abbreviation of "Bootstrap Aggregation" and it composite outputs from several machine learning techniques for raising the performance and stability of prediction or classification. This technique is special form of the averaging method. Bumping is the abbreviation of "Bootstrap Umbrella of Model Parameter," and it only considers the model which has the lowest error value. The results show that bumping outperforms bagging and the other predictors except for "Poster" product group. For the "Poster" product group, artificial neural network model performs better than the other models. In the second step, we use the market basket analysis to extract association rules for co-purchased products. We can extract thirty one association rules according to values of Lift, Support, and Confidence measure. We set the minimum transaction frequency to support associations as 5%, maximum number of items in an association as 4, and minimum confidence for rule generation as 10%. This study also excludes the extracted association rules below 1 of lift value. We finally get fifteen association rules by excluding duplicate rules. Among the fifteen association rules, eleven rules contain association between products in "Office Supplies" product group, one rules include the association between "Office Supplies" and "Fashion" product groups, and other three rules contain association between "Office Supplies" and "Home Decoration" product groups. Finally, the proposed product recommender systems provides list of recommendations to the proper customers. We test the usability of the proposed system by using prototype and real-world transaction and profile data. For this end, we construct the prototype system by using the ASP, Java Script and Microsoft Access. In addition, we survey about user satisfaction for the recommended product list from the proposed system and the randomly selected product lists. The participants for the survey are 173 persons who use MSN Messenger, Daum Caf$\acute{e}$, and P2P services. We evaluate the user satisfaction using five-scale Likert measure. This study also performs "Paired Sample T-test" for the results of the survey. The results show that the proposed model outperforms the random selection model with 1% statistical significance level. It means that the users satisfied the recommended product list significantly. The results also show that the proposed system may be useful in real-world online shopping store.