• 디지털산업정보학회논문지
• /
• 제18권4호
• /
• pp.85-96
• /
• 2022

Personalized recommendation technology is one of the most important technologies in electronic commerce environment. It helps users overcome information overload by suggesting information that match user's interests. In e-commerce environment, both mobile device users and smart device users have risen dramatically. It creates new challenges. Our method suggests product information that match user's device interests beyond only user's interests. We propose a device-centered personalized recommendation method. Our method uses both purchase and share behavior for user's devices interests. Moreover, it considers data type preference for each device. This paper presents a new recommendation method and algorithm. Then, an e-commerce scenario with a computer, a smartphone and an AI-speaker are described. The scenario shows our work is better than previous researches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권4호
• /
• pp.366-375
• /
• 2009

In collaborative filtering, many neighbors are needed to improve the quality and stability of the recommendation. The quality may not be good mainly due to the high similarity between two users not guaranteeing the same preference for products considered for recommendation. This paper proposes a consistency definition, rather than similarity, based on information entropy between two users to improve the recommendation. This kind of consistency between two users is then employed as a trust metric in collaborative filtering methods that select neighbors based on the metric. Empirical studies show that such collaborative filtering reduces the number of neighbors required to make the recommendation quality stable. Recommendation quality is also significantly improved.

• 한국IT서비스학회지
• /
• 제13권2호
• /
• pp.173-184
• /
• 2014

As social network services has become one of the most successful web-based business, recommendation in social network sites that assist people to choose various products and services is also widely adopted. Collaborative Filtering is one of the most widely adopted recommendation approaches, but recommendation technique that use explicit or implicit social network information from social networks has become proposed in recent research works. In this paper, we reviewed and compared research works about recommendation using social network analysis and collaborative filtering in social network sites. As the results of the analysis, we suggested the trends and implications for future research of recommendation in SNSs. It is expected that graph-based analysis on the semantic social network and systematic comparative analysis on the performances of social filtering and collaborative filtering are required.

• 지능정보연구
• /
• 제17권3호
• /
• pp.79-98
• /
• 2011

우리는 개인 전자상거래 포탈에서 개인화를 위한 시맨틱 추천 방법을 제안한다. 시맨틱 추천은 제품의 특성(속성)을 이용하여 의미적 유사성 평가를 통해 이루어진다. 정확한 추천을 제공하기 위하여 제품의 시맨틱 유사성은 제품의 평점정보를 포함한다. 또한, 추천기술은 제품의 평점을 평가하여 고객의 다양한 내포된 의향을 분석한다. 고객의 의향은 "구입한 제품", "쇼핑카트에 추가한 제품", "정보를 본 제품"과 같이 세 가지 유형으로 분류 하고 있다. 우리는 제품의 추천을 위한 제품의 평점을 추정하기 위하여 고객의 내재적 의향을 추적할 수 있다. 또한 우리는 정확한 추천을 제공하기 위해 매우 중요한 유효한 세션을 식별하는 유효성 검사 프로세스 세션을 구현하였다. 우리의 추천 기술은 유사한 환경의 고객의 연령별 그룹에서 높은 수준을 정확도를 보여 준다. 본 논문의 실험섹션에서 우리의 제안 추천방식은 기존 고객뿐만 아니라 이전의 구매기록이 없는 새로운 사용자에게도 기존에 잘 알려진 협업 필터링 방법보다 좋은 성능을 보여 주었다.

• Journal of Information Processing Systems
• /
• 제17권2호
• /
• pp.369-384
• /
• 2021

In a personalized product recommendation system, when the amount of log data is large or sparse, the accuracy of model recommendation will be greatly affected. To solve this problem, a personalized product recommendation method using deep factorization machine (DeepFM) to analyze user behavior is proposed. Firstly, the K-means clustering algorithm is used to cluster the original log data from the perspective of similarity to reduce the data dimension. Then, through the DeepFM parameter sharing strategy, the relationship between low- and high-order feature combinations is learned from log data, and the click rate prediction model is constructed. Finally, based on the predicted click-through rate, products are recommended to users in sequence and fed back. The area under the curve (AUC) and Logloss of the proposed method are 0.8834 and 0.0253, respectively, on the Criteo dataset, and 0.7836 and 0.0348 on the KDD2012 Cup dataset, respectively. Compared with other newer recommendation methods, the proposed method can achieve better recommendation effect.

• Asia pacific journal of information systems
• /
• 제29권2호
• /
• pp.203-216
• /
• 2019

There is an accuracy-diversity dilemma with personalized recommendation services. Some researchers believe that accurate recommendations might reinforce customer satisfaction. However, others claim that highly accurate recommendations and customer satisfaction are not always correlated. Thus, this study attempts to establish the causal factors that determine customer satisfaction with personalized recommendation services to reconcile these incompatible views. This paper employs statistical analyses of simulation to investigate an accuracy-diversity dilemma with personalized recommendation services. To this end, we develop a personalized recommendation system and measured accuracy, diversity, and customer satisfaction using a simulation method. The results show that accurate recommendations positively affected customer satisfaction, whereas diverse recommendations negatively affected customer satisfaction. Also, customer satisfaction was associated with the recommendation product size when neighborhood size was optimal in accuracy. Thus, these results offer insights into personalizing recommendation service providers. The providers must identify customers' preferences correctly and suggest more accurate recommendations. Furthermore, accuracy is not always improved as the number of product recommendation increases. Accordingly, providers must propose adequate number of product recommendation.

• Journal of Information Processing Systems
• /
• 제15권3호
• /
• pp.616-631
• /
• 2019

With the rapid increase of information on the World Wide Web, finding useful information on the internet has become a major problem. The recommendation system helps users make decisions in complex data areas where the amount of data available is large. There are many methods that have been proposed in the recommender system. Collaborative filtering is a popular method widely used in the recommendation system. However, collaborative filtering methods still have some problems, namely cold-start problem. In this paper, we propose a movie recommendation system by using social network analysis and collaborative filtering to solve this problem associated with collaborative filtering methods. We applied personal propensity of users such as age, gender, and occupation to make relationship matrix between users, and the relationship matrix is applied to cluster user by using community detection based on edge betweenness centrality. Then the recommended system will suggest movies which were previously interested by users in the group to new users. We show shown that the proposed method is a very efficient method using mean absolute error.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권11호
• /
• pp.2903-2923
• /
• 2023

Knowledge recommendation is a type of recommendation system that recommends knowledge content to users in order to satisfy their needs. Although using graph neural networks to extract data features is an effective method for solving the recommendation problem, there is information loss when modeling real-world problems because an edge in a graph structure can only be associated with two nodes. Because one super-edge in the hypergraph structure can be connected with several nodes and the effectiveness of knowledge graph for knowledge expression, a dual-channel hypergraph convolutional neural network model (DCHC) based on hypergraph structure and knowledge graph is proposed. The model divides user data and knowledge data into user subhypergraph and knowledge subhypergraph, respectively, and extracts user data features by dual-channel hypergraph convolution and knowledge data features by combining with knowledge graph technology, and finally generates recommendation results based on the obtained user embedding and knowledge embedding. The performance of DCHC model is higher than the comparative model under AUC and F1 evaluation indicators, comparative experiments with the baseline also demonstrate the validity of DCHC model.

• 지능정보연구
• /
• 제16권4호
• /
• pp.195-211
• /
• 2010

전시회는 전시업체가 새로운 상품이나 서비스를 관람객에게 알리기 위해 개최되는 것으로 효과적인 마케팅 수단으로 중요한 역할을 수행한다. 전시회를 방문하는 다양한 관람객의 니즈를 충족시키기 위하여 다양한 유비쿼터스 기술이 전시회에 응용되고 있지만 관람객이 사전에 요청한 정보만을 제공함으로 개별 관람객의 선호가 반영되지 않아 관람객의 니즈를 충족시키기에는 한계가 있다. 이러한 한계를 해결하기 위한 방법으로 개인의 선호에 부합하는 부스를 추천하는 추천 시스템의 이용이 가능하다. 추천시스템은 전시 환경에서 관람객의 선호를 추론하여 선호에 부합하는 방문 부스를 추천하여 관람객의 니즈를 충족시킬 수 있다. 그러나 추천 시스템 중 가장 성공적으로 평가 받는 기존의 협업 필터링은 관람객의 부스 방문 순서에 나타나는 선호를 반영하지 않아 동적으로 변화하는 선호를 가지는 관람객으로 구성된 전시 환경의 추천 시스템으로는 적합하지 않다. 따라서 본 연구에서는 관람객의 방문 순서를 고려하는 기법 중 순차 연관 규칙을 이용하여 관람객의 선호에 부합하는 부스를 추천하는 방법론을 제안하였다. 본 연구에서 제안한 방법론의 성과 측정을 위해 실제 전시회에서 획득한 데이터를 사용하여 기존의 협업 필터링과 비교한 결과 전체적으로 추천의 성과가 향상되어 향후 전시 환경에서의 부스 추천시스템에 적용하여 관람객의 니즈를 충족시킬 것으로 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.109-134
• /
• 2018

Collaborative Filtering (CF) is widely used in recommendation field, which can be divided into rating-based CF and learning-to-rank based CF. Although many methods have been proposed based on these two kinds of CF, there still be room for improvement. Firstly, the data sparsity problem still remains a big challenge for CF algorithms. Secondly, the malicious rating given by some illegal users may affect the recommendation accuracy. Existing CF algorithms seldom took both of the two observations into consideration. In this paper, we propose a recommendation method based on listwise learning-to-rank by incorporating users' social information. By taking both ratings and order of items into consideration, the Plackett-Luce model is presented to find more accurate similar users. In order to alleviate the data sparsity problem, the improved matrix factorization model by integrating the influence of similar users is proposed to predict the rating. On the basis of exploring the trust relationship between users according to their social information, a listwise learning-to-rank algorithm is proposed to learn an optimal ranking model, which can output the recommendation list more consistent with the user preference. Comprehensive experiments conducted on two public real-world datasets show that our approach not only achieves high recommendation accuracy in relatively short runtime, but also is able to reduce the impact of malicious ratings.