• Industrial Engineering and Management Systems
• /
• v.13 no.4
• /
• pp.421-431
• /
• 2014

The market basket data in the form of a binary user-item matrix or a binary item-user matrix can be modelled as a binary classification problem. The binary logistic regression approach tackles the binary classification problem, where principal components are predictor variables. If users or items are sparse in the training data, the binary classification problem can be considered as a cold-start problem. The binary logistic regression approach may not function appropriately if the principal components are inefficient for the cold-start problem. Assuming that the market basket data can also be considered as a special regression problem whose response is either 0 or 1, we propose three supervised learning approaches: random forest regression, random forest classification, and elastic net to tackle the cold-start problem, comparing the performance in a variety of experimental settings. The experimental results show that the proposed supervised learning approaches outperform the conventional approaches.

• The KIPS Transactions:PartB
• /
• v.13B no.6 s.109
• /
• pp.625-632
• /
• 2006

Collaborative filtering is a technology that aims at teaming predictive models of user preferences. Collaborative filtering systems have succeeded in Ecommerce market but they have shortcomings of high dimensionality and sparsity. In this paper we propose the nearest neighbor collaborative filtering method using non-negative matrix factorization(NNMF). We replace the missing values in the user-item matrix by using the user variance coefficient method as preprocessing for matrix decomposition and apply non-negative factorization to the matrix. The positive decomposition method using the non-negative decomposition represents users as semantic vectors and classifies the users into groups based on semantic relations. We compute the similarity between users by using vector similarity and selects the nearest neighbors based on the similarity. We predict the missing values of items that didn't rate by a new user based on the values that the nearest neighbors rated items.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.463-474
• /
• 2008

The advancement of information technology and the popularization of Internet has explosively increased the amount of multimedia contents. Therefore, the requirement of multimedia recommendation to satisfy a user's needs increases fastly. Up to now, CF is used to recommend general items and multimedia contents. However, general CF doesn't reflect visual characteristics of image contents so that it can't be adaptable to image recommendation. Besides, it has limitations in new item recommendation, the sparsity problem, and dynamic change of user preference. In this paper, we present new image recommendation method FBCF (Feature Based Collaborative Filtering) to resolve such problems. FBCF builds new user profile by clustering visual features in terms of user preference, and reflects user's current preference to recommendation by using preference feedback. Experimental result using real mobile images demonstrate that FBCF outperforms conventional CF by 400% in terms of recommendation ratio.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.379-386
• /
• 2014

As the use of mobile device is increasing rapidly, the number of users is also increasing. However, most of the app stores are using recommendation of simple ranking method, so the accuracy of recommendation is lower. To recommend an item that is more appropriate to the user, this paper proposes a technique that reflects the weight of user information and recent preference degree of item. The proposed technique classifies the data set by categories and then derives a predicted value by applying the user's information weight to the collaborative filtering technique. To reflect the recent preference degree of item by categories, the average of items' rating values in the designated period is computed. An item is recommended by combining the two result values. The experiment result indicated that the proposed method has been more enhanced the accuracy, appropriacy, compared to item-based, user-based method.

• Journal of Information Technology Services
• /
• v.6 no.2
• /
• pp.113-123
• /
• 2007

In ubiquitous computing environment such as ubiquitous marketplace (u-market), there is a need of providing context-based personalization service while considering the nomadic user preference and corresponding requirements. To do so, the recommendation systems should deal with the tremendous amount of context data. Hence, the purpose of this paper is to propose a novel recommendation method which provides the products-group list of the customers in u-market based on the shopping intention and preferences. We have developed FREPIRS(FREquent Purchased Item-sets Recommendation Service), which makes recommendation listof product-group, not individual product. Collaborative filtering and apriori algorithm are adopted in FREPIRS to build product-group.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.877-885
• /
• 2011

A collaborative filtering(CF) is the most widely used technique in recommender system. However, CF has sparsity and scalability problems. These problems reduce the accuracy of recommendation and extensive studies have been made to solve these problems, In this paper, we proposed a method that uses a weight so as to solve these problems. After creating a user-item matrix, the proposed method analyzes information about users who prefer the item only by using data with a rating over 4 for enhancing the accuracy in the recommendation. The proposed method uses information about the genre of the item as well as analyzed user information as a weight during the calculation of similarity, and it calculates prediction by using only data for which the similarity is over a threshold and uses the data as the rating value of unrated data. It is possible simultaneously to reduce sparsity and to improve accuracy by calculating prediction through an analysis of the characteristics of an item. Also, it is possible to conduct a quick classification based on the analyzed information once a new item and a user are registered. The experiment result indicated that the proposed method has been more enhanced the accuracy, compared to item based, genre based methods.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.581-591
• /
• 2005

Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.221-226
• /
• 2021

Collaborative filtering based recommender systems recommend user-preferrable items based on rating history and are essential function for the current various commercial purposes. In order to determine items to recommend, prediction of preference score for unrated items is estimated based on similar rating history. Previous studies usually employ two methods individually, i.e., similar user based or similar item based ones. These methods have drawbacks of degrading prediction accuracy in case of sparse user ratings data or when having difficulty with finding similar users or items. This study suggests a new rating prediction method by integrating the two previous methods. The proposed method has the advantage of consulting more similar ratings, thus improving the recommendation quality. The experimental results reveal that our method significantly improve the performance of previous methods, in terms of prediction accuracy, relevance level of recommended items, and that of recommended item ranks with a sparse dataset. With a rather dense dataset, it outperforms the previous methods in terms of prediction accuracy and shows comparable results in other metrics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2399-2413
• /
• 2021

A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.