• The Journal of Society for e-Business Studies
• /
• v.17 no.2
• /
• pp.129-147
• /
• 2012

Collaborative filtering (CF), one of the most successful recommendation techniques, has been used in a number of different applications such as recommending web pages, movies, music, articles and products. One of the critical issues in CF is why recommendation performances are different depending on application domains. However, prior literatures have focused on only data characteristics to explain the origin of the difference. Scant attentions have been paid to provide systematic explanation on the issue. To fill this research gap, this study attempts to systematically explain why recommendation performances are different using structural indexes of social network. For this purpose, we developed hypotheses regarding the relationships between structural indexes of social network and recommendation performance of collaboration filtering, and empirically tested them. Results of this study showed that density and inconclusiveness positively affected recommendation performance while clustering coefficient negatively affected it. This study can be used as stepping stone for understanding collaborative filtering recommendation performance. Furthermore, it might be helpful for managers to decide whether they adopt recommendation systems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.510-514
• /
• 2004

Recommender systems are a personalized information filtering technology to help customers find the products they would like to purchase. Collaborative filtering is known to be the most successful recommendation technology, but its widespread use has exposed some problems such as sparsity and scalability in the e-business environment. In this paper, we propose a recommendation methodology based on Web usage mining and product taxonomy to enhance the recommendation quality and the system performance of original CF-based recommender systems. Web usage mining populates the rating database by tracking customers' shopping behaviors on the Web, so leading to better quality recommendations. The product taxonomy is used to improve the performance of searching for nearest neighbors through dimensionality reduction of the rating database. Several experiments on real e-commerce data show that the proposed methodology provides higher quality recommendations and better performance than original collaborative filtering methodology.

• Journal of Intelligence and Information Systems
• /
• v.22 no.4
• /
• pp.1-18
• /
• 2016

Collaborative Filtering (CF) predicts the focal user's preference for particular item based on user's preference rating data and recommends items for the similar users by using them. It is a popular technique for the personalization in e-commerce to reduce information overload. However, it has some limitations including sparsity and scalability problems. In this paper, we use a method to integrate social network information into collaborative filtering in order to mitigate the sparsity and scalability problems which are major limitations of typical collaborative filtering and reflect the user's qualitative and emotional information in recommendation process. In this paper, we use a novel recommendation algorithm which is integrated with collaborative filtering by using Social SVD++ algorithm which considers social network information in SVD++, an extension algorithm that can reflect implicit information in singular value decomposition (SVD). In particular, this study will evaluate the performance of the model by reflecting the real-world user's social network information in the recommendation process.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.625-632
• /
• 2001

The electronic stores have realized that they need to understand their customers and to quickly response their wants and needs. To be successful in increasingly competitive Internet marketplace, recommender systems are adapting data mining techniques. One of most successful recommender technologies is collaborative filtering (CF) algorithm which recommends products to a target customer based on the information of other customers and employ statistical techniques to find a set of customers known as neighbors. However, the application of the systems, however, is not very suitable for seasonal products which are sensitive to time or season such as refrigerator or seasonal clothes. In this paper, we propose a new adjusted item-based recommendation generation algorithms called the exponentially weighted collaborative filtering recommendation (EWCFR) one that computes item-item similarities regarding seasonal products. Finally, we suggest the recommendation system with relatively high quality computing time on main memory database (MMDB) in XML since the collaborative filtering systems are needed that can quickly produce high quality recommendations with very large-scale problems.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.191-194
• /
• 2003

As internet commerce grows, many company has begun to use a CF (Collaborative Filtering) as a Recommender System. To achieve an accuracy of CF, we need to obtain sufficient account of voting scores from customers. Moreover, those scores may not be consistent. To overcome this problem, we propose a new recommendation scheme using binary user-item matrix, which represents whether a user purchases a product instead of using the voting scores. Through the experiment regarding this new scheme, a better accuracy is demonstrated.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.953-964
• /
• 2006

Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4892-4911
• /
• 2015

Trust as one of important social relations has attracted much attention from researchers in the field of social network-based recommender systems. In trust network-based recommender systems, there exist normally two roles for users, truster and trustee. Most of trust-based methods generally utilize explicit links between truster and trustee to find similar neighbors for recommendation. However, there possibly exist implicit correlations between users, especially for users with the same role (truster or trustee). In this paper, we propose a novel Collaborative Filtering method called CF-TC, which exploits Trust Context to discover implicit correlation between users with the same role for recommendation. In this method, each user is first represented by the same-role users who are co-occurring with the user. Then, similarities between users with the same role are measured based on obtained user representation. Finally, two variants of our method are proposed to fuse these computed similarities into traditional collaborative filtering for rating prediction. Using two publicly available real-world Epinions and Ciao datasets, we conduct comprehensive experiments to compare the performance of our proposed method with some existing benchmark methods. The results show that CF-TC outperforms other baseline methods in terms of RMSE, MAE, and recall.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.9-16
• /
• 2016

Collaborative filtering(CF) uses the purchase or item rating history of other users, but does not need additional properties or attributes of users and items. Hence CF is known th be the most successful recommendation technology. But conventional CF approach has some significant weakness, such as the new user problem. In this paper, we propose a approach using word embedding with skip-gram for learning distributed item representations. In particular, we show that this approach can be used to capture precise item for solving the "new user problem." The proposed approach has been tested on the Movielens databases. We compare the performance of the user based CF, item based CF and our approach by observing the change of recommendation results according to the different number of item rating information. The experimental results shows the improvement in our approach in measuring the precision applied to new user problem situations.

• Journal of Information Technology Applications and Management
• /
• v.30 no.4
• /
• pp.29-38
• /
• 2023

A single-learner model which integrates the user's positive and negative perceptions is proposed by augmenting counterfactual data to the interaction data between users and items, which are mainly used in collaborative filtering in this study. The proposed CausRec showed superior performance compared to the existing NCF model in terms of F1 value and AUC in experiments using three published datasets: MovieLens 100K, Amazon Gift Card, and Amazon Magazine. Compared to the existing NCF model, the F1 and AUC values of CausRec showed 1.2% and 2.6% performance improvement in MovieLens 100K data, and 2.2% and 10% improvement in Amazon Gift Card data, respectively. In particular, in experiments using Amazon Magazine data, F1 and AUC values were improved by 11.7% and 21.9%, respectively, showing a significant performance improvement effect. The performance of CausRec is improved because both positive and negative perceptions of the item were reflected in the recommendation at the same time. It is judged that the proposed method was able to improve the performance of the collaborative filtering because it can simultaneously alleviate the sparsity and imbalance problems of the interaction data.

• Journal of Intelligence and Information Systems
• /
• v.20 no.2
• /
• pp.137-148
• /
• 2014

Recommender system has become one of the most important technologies in e-commerce in these days. The ultimate reason to shop online, for many consumers, is to reduce the efforts for information search and purchase. Recommender system is a key technology to serve these needs. Many of the past studies about recommender systems have been devoted to developing and improving recommendation algorithms and collaborative filtering (CF) is known to be the most successful one. Despite its success, however, CF has several shortcomings such as cold-start, sparsity, gray sheep problems. In order to be able to generate recommendations, ordinary CF algorithms require evaluations or preference information directly from users. For new users who do not have any evaluations or preference information, therefore, CF cannot come up with recommendations (Cold-star problem). As the numbers of products and customers increase, the scale of the data increases exponentially and most of the data cells are empty. This sparse dataset makes computation for recommendation extremely hard (Sparsity problem). Since CF is based on the assumption that there are groups of users sharing common preferences or tastes, CF becomes inaccurate if there are many users with rare and unique tastes (Gray sheep problem). This study proposes a new algorithm that utilizes Social Network Analysis (SNA) techniques to resolve the gray sheep problem. We utilize 'degree centrality' in SNA to identify users with unique preferences (gray sheep). Degree centrality in SNA refers to the number of direct links to and from a node. In a network of users who are connected through common preferences or tastes, those with unique tastes have fewer links to other users (nodes) and they are isolated from other users. Therefore, gray sheep can be identified by calculating degree centrality of each node. We divide the dataset into two, gray sheep and others, based on the degree centrality of the users. Then, different similarity measures and recommendation methods are applied to these two datasets. More detail algorithm is as follows: Step 1: Convert the initial data which is a two-mode network (user to item) into an one-mode network (user to user). Step 2: Calculate degree centrality of each node and separate those nodes having degree centrality values lower than the pre-set threshold. The threshold value is determined by simulations such that the accuracy of CF for the remaining dataset is maximized. Step 3: Ordinary CF algorithm is applied to the remaining dataset. Step 4: Since the separated dataset consist of users with unique tastes, an ordinary CF algorithm cannot generate recommendations for them. A 'popular item' method is used to generate recommendations for these users. The F measures of the two datasets are weighted by the numbers of nodes and summed to be used as the final performance metric. In order to test performance improvement by this new algorithm, an empirical study was conducted using a publically available dataset - the MovieLens data by GroupLens research team. We used 100,000 evaluations by 943 users on 1,682 movies. The proposed algorithm was compared with an ordinary CF algorithm utilizing 'Best-N-neighbors' and 'Cosine' similarity method. The empirical results show that F measure was improved about 11% on average when the proposed algorithm was used