• Title/Summary/Keyword: Recommender Technique

Search Result 83, Processing Time 0.025 seconds

A CF-based Health Functional Recommender System using Extended User Similarity Measure (확장된 사용자 유사도를 이용한 CF-기반 건강기능식품 추천 시스템)

  • Sein Hong;Euiju Jeong;Jaekyeong Kim
    • Journal of Intelligence and Information Systems
    • /
    • v.29 no.3
    • /
    • pp.1-17
    • /
    • 2023
  • With the recent rapid development of ICT(Information and Communication Technology) and the popularization of digital devices, the size of the online market continues to grow. As a result, we live in a flood of information. Thus, customers are facing information overload problems that require a lot of time and money to select products. Therefore, a personalized recommender system has become an essential methodology to address such issues. Collaborative Filtering(CF) is the most widely used recommender system. Traditional recommender systems mainly utilize quantitative data such as rating values, resulting in poor recommendation accuracy. Quantitative data cannot fully reflect the user's preference. To solve such a problem, studies that reflect qualitative data, such as review contents, are being actively conducted these days. To quantify user review contents, text mining was used in this study. The general CF consists of the following three steps: user-item matrix generation, Top-N neighborhood group search, and Top-K recommendation list generation. In this study, we propose a recommendation algorithm that applies an extended similarity measure, which utilize quantified review contents in addition to user rating values. After calculating review similarity by applying TF-IDF, Word2Vec, and Doc2Vec techniques to review content, extended similarity is created by combining user rating similarity and quantified review contents. To verify this, we used user ratings and review data from the e-commerce site Amazon's "Health and Personal Care". The proposed recommendation model using extended similarity measure showed superior performance to the traditional recommendation model using only user rating value-based similarity measure. In addition, among the various text mining techniques, the similarity obtained using the TF-IDF technique showed the best performance when used in the neighbor group search and recommendation list generation step.

Performance Improvement of a Movie Recommendation System based on Personal Propensity and Secure Collaborative Filtering

  • Jeong, Woon-Hae;Kim, Se-Jun;Park, Doo-Soon;Kwak, Jin
    • Journal of Information Processing Systems
    • /
    • v.9 no.1
    • /
    • pp.157-172
    • /
    • 2013
  • There are many recommendation systems available to provide users with personalized services. Among them, the most frequently used in electronic commerce is 'collaborative filtering', which is a technique that provides a process of filtering customer information for the preparation of profiles and making recommendations of products that are expected to be preferred by other users, based on such information profiles. Collaborative filtering systems, however, have in their nature both technical issues such as sparsity, scalability, and transparency, as well as security issues in the collection of the information that becomes the basis for preparation of the profiles. In this paper, we suggest a movie recommendation system, based on the selection of optimal personal propensity variables and the utilization of a secure collaborating filtering system, in order to provide a solution to such sparsity and scalability issues. At the same time, we adopt 'push attack' principles to deal with the security vulnerability of collaborative filtering systems. Furthermore, we assess the system's applicability by using the open database MovieLens, and present a personal propensity framework for improvement in the performance of recommender systems. We successfully come up with a movie recommendation system through the selection of optimal personalization factors and the embodiment of a safe collaborative filtering system.

Fiber Fashion Design Recommender Agent System using the Prediction of User-Preference and Textile based Collaborative Filtering Technique (사용자 선호도 예측과 Textile 기반의 협력적 필터링 기술을 이용한 섬유패션 디자인 추천 에이전트)

  • 정경용;김진현;나영주
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2002.11a
    • /
    • pp.224-228
    • /
    • 2002
  • 제품의 품질 및 가격 뿐만 아니라 물질적 풍요로움과 더불어 다변화 되어가는 생활 환경 속에서 소비자의 감성과 선호도를 파악하는 것은 제품 판매 전략의 중요한 성공요소가 되고 있다. 이를 위하여 제품의 기능적 측면 뿐만 아니라 개개인의 정서적 감정과 선호도가 반영된 제품의 설계나 디자인 또한 요구되고 있다. 본 연구에서는 소재 개발의 프로세스가 고객 중심으로 변화하는 것에 대응하여 사용자의 감성과 선호도를 중심으로 소재를 개발하는 방법의 하나로 협력적 필터링 개인화 기법을 응용하여 섬유 패션 디자인 추천 시스템을 제안한다. Textile 기반의 협력적 필터링 시스템에서 예측에 사용될 이웃의 수를 결정하기 위해서 Representative Attribute-Neighborhood를 사용한다. 이웃들간의 사용자 유사도 가중치는 피어슨 상관 계수(Pearson Correlation Coefficient)를 사용한다. 소재에 대한 사용자의 감성이나 선호도에 대한 Textile의 대표 감성 형용사를 추출함으로써 소재 개발을 위한 감성 형용사 데이터 베이스를 구축한다. 구축된 감성 형용사 데이터 베이스를 기반으로 성향이 비슷한 사용자에게 Textile을 추천한다. 사용자 선호도 예측과 Textile 기반의 협력적 필터링 기술을 이용한 섬유 패션 디자인 추천 에이전트를 구축하여 시스템의 논리적 타당성과 유효성을 검증하기 위해 실험적인 적용을 시도하고자 한다.

  • PDF

A Study on Recommendation Technique Using Mining and Clustering of Weighted Preference based on FRAT (마이닝과 FRAT기반 가중치 선호도 군집을 이용한 추천 기법에 관한 연구)

  • Park, Wha-Beum;Cho, Young-Sung;Ko, Hyung-Hwa
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.419-428
    • /
    • 2013
  • Real-time accessibility and agility are required in u-commerce under ubiquitous computing environment. Most of the existing recommendation techniques adopt the method of evaluation based on personal profile, which has been identified with difficulties in accurately analyzing the customers' level of interest and tendencies, as well as the problems of cost, consequently leaving customers unsatisfied. Researches have been conducted to improve the accuracy of information such as the level of interest and tendencies of the customers. However, the problem lies not in the preconstructed database, but in generating new and diverse profiles that are used for the evaluation of the existing data. Also it is difficult to use the unique recommendation method with hierarchy of each customer who has various characteristics in the existing recommendation techniques. Accordingly, this dissertation used the implicit method without onerous question and answer to the users based on the data from purchasing, unlike the other evaluation techniques. We applied FRAT technique which can analyze the tendency of the various personalization and the exact customer.

Location Recommendation Customize System Using Opinion Mining (오피니언마이닝을 이용한 사용자 맞춤 장소 추천 시스템)

  • Choi, Eun-jeong;Kim, Dong-keun
    • 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.

Time-aware Item-based Collaborative Filtering with Similarity Integration

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.7
    • /
    • pp.93-100
    • /
    • 2022
  • In the era of information overload on the Internet, the recommendation system, which is an indispensable function, is a service that recommends products that a user may prefer, and has been successfully provided in various commercial sites. Recently, studies to reflect the rating time of items to improve the performance of collaborative filtering, a representative recommendation technique, are active. The core idea of these studies is to generate the recommendation list by giving an exponentially lower weight to the items rated in the past. However, this has a disadvantage in that a time function is uniformly applied to all items without considering changes in users' preferences according to the characteristics of the items. In this study, we propose a time-aware collaborative filtering technique from a completely different point of view by developing a new similarity measure that integrates the change in similarity values between items over time into a weighted sum. As a result of the experiment, the prediction performance and recommendation performance of the proposed method were significantly superior to the existing representative time aware methods and traditional methods.

Time-aware Collaborative Filtering with User- and Item-based Similarity Integration

  • Lee, Soojung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.9
    • /
    • pp.149-155
    • /
    • 2022
  • The popularity of e-commerce systems on the Internet is increasing day by day, and the recommendation system, as a core function of these systems, greatly reduces the effort to search for desired products by recommending products that customers may prefer. The collaborative filtering technique is a recommendation algorithm that has been successfully implemented in many commercial systems, but despite its popularity and usefulness in academia, the memory-based implementation has inaccuracies in its reference neighbor. To solve this problem, this study proposes a new time-aware collaborative filtering technique that integrates and utilizes the neighbors of each item and each user, weighting the recent similarity more than the past similarity with them, and reflecting it in the recommendation list decision. Through the experimental evaluation, it was confirmed that the proposed method showed superior performance in terms of prediction accuracy than other existing methods.

A Fashion Design Recommender Agent System using Collaborative Filtering and Sensibilities related to Textile Design Factors (텍스타일 기반의 협력적 필터링 기술과 디자인 요소에 따른 감성 분석을 이용한 패션 디자인 추천 에이전트 시스템)

  • 정경용;나영주;이정현
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.2
    • /
    • pp.174-188
    • /
    • 2004
  • In the life environment changed with not only the quality and the price of the products but also the material abundance, it is the most crucial factor for the strategy of product sales to investigate consumer's sensibility and preference degree. In this perspective, it is necessary to design and merchandise the products in cope with each consumer's sensibility and needs as well as its functional aspects. In this paper, we propose the Fashion Design Recommender Agent System (FDRAS-pro) for textile design applying collaborative filtering personalization technique as one of the methods of material development centered on consumer's sensibility and preference. For a collaborative filtering system based on textile, Representative-Attribute Neighborhood is adopted to determine the number or neighbors that will be used for preferences estimation. Pearson's Correlation Coefficient is used to calculate similarity weights among users. We build a database founded on the sensibility adjectives to develop textile designs by extracting the representative sensibility adjectives from users' sensibility and preferences about textile designs. FDRAS-pro recommends textile designs to a customer who has a similar propensity about textile. To investigate the sensibility and emotion according to the effect of design factors, fertile designs were analyzed in terms of 9 design factors, such as, motif source, motif-background ratio, motif variation, motif interpretation, motif arrangement, motif articulation, hue contrast, value contrast, chroma contrast. Finally, we plan to conduct empirical applications to verify the adequacy and the validity of our system.

Weight Based Technique For Improvement Of New User Recommendation Performance (신규 사용자 추천 성능 향상을 위한 가중치 기반 기법)

  • Cho, Sun-Hoon;Lee, Moo-Hun;Kim, Jeong-Seok;Kim, Bong-Hoi;Choi, Eui-In
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.273-280
    • /
    • 2009
  • Today, many services and products that used to be only provided on offline have been being provided on the web according to the improvement of computing environment and the activation of web usage. These web-based services and products tend to be provided to customer by customer's preferences. This paradigm that considers customer's opinions and features in selecting is called personalization. The related research field is a recommendation. And this recommendation is performed by recommender system. Generally the recommendation is made from the preferences and tastes of customers. And recommender system provides this recommendation to user. However, the recommendation techniques have a couple of problems; they do not provide suitable recommendation to new users and also are limited to computing space that they generate recommendations which is dependent on ratings of products by users. Those problems has gathered some continuous interest from the recommendation field. In the case of new users, so similar users can't be classified because in the case of new users there is no rating created by new users. The problem of the limitation of the recommendation space is not easy to access because it is related to moneywise that the cost will be increasing rapidly when there is an addition to the dimension of recommendation. Therefore, I propose the solution of the recommendation problem of new user and the usage of item quality as weight to improve the accuracy of recommendation in this paper.

A Study on the Effect of Network Centralities on Recommendation Performance (네트워크 중심성 척도가 추천 성능에 미치는 영향에 대한 연구)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.23-46
    • /
    • 2021
  • Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.