• Title/Summary/Keyword: New item Recommendation

Search Result 70, Processing Time 0.032 seconds

Strategies for Selecting Initial Item Lists in Collaborative Filtering Recommender Systems

  • Lee, Hong-Joo;Kim, Jong-Woo;Park, Sung-Joo
    • Management Science and Financial Engineering
    • /
    • v.11 no.3
    • /
    • pp.137-153
    • /
    • 2005
  • Collaborative filtering-based recommendation systems make personalized recommendations based on users' ratings on products. Recommender systems must collect sufficient rating information from users to provide relevant recommendations because less user rating information results in poorer performance of recommender systems. To learn about new users, recommendation systems must first present users with an initial item list. In this study, we designed and analyzed seven selection strategies including the popularity, favorite, clustering, genre, and entropy methods. We investigated how these strategies performed using MovieLens, a public dataset. While the favorite and popularity methods tended to produce the highest average score and greatest average number of ratings, respectively, a hybrid of both favorite and popularity methods or a hybrid of demographic, favorite, and popularity methods also performed within acceptable ranges for both rating scores and numbers of ratings.

A Simple and Effective Combination of User-Based and Item-Based Recommendation Methods

  • Oh, Se-Chang;Choi, Min
    • Journal of Information Processing Systems
    • /
    • v.15 no.1
    • /
    • pp.127-136
    • /
    • 2019
  • User-based and item-based approaches have been developed as the solutions of the movie recommendation problem. However, the user-based approach is faced with the problem of sparsity, and the item-based approach is faced with the problem of not reflecting users' preferences. In order to solve these problems, there is a research on the combination of the two methods using the concept of similarity. In reality, it is not free from the problem of sparsity, since it has a lot of parameters to be calculated. In this study, we propose a combining method that simplifies the combination equation of prior study. This method is relatively free from the problem of sparsity, since it has less parameters to be calculated. Thus, it can get more accurate results by reflecting the users rating to calculate the parameters. It is very fast to predict new movie ratings as well. In experiments for the proposed method, the initial error is large, but the performance gets quickly stabilized after. In addition, it showed about 6% lower average error rate than the existing method using similarity.

Recommendation Technique using Social Network in Internet of Things Environment (사물인터넷 환경에서 소셜 네트워크를 기반으로 한 정보 추천 기법)

  • Kim, Sungrim;Kwon, Joonhee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.11 no.1
    • /
    • pp.47-57
    • /
    • 2015
  • Recently, Internet of Things (IoT) have become popular for research and development in many areas. IoT makes a new intelligent network between things, between things and persons, and between persons themselves. Social network service technology is in its infancy, but, it has many benefits. Adjacent users in a social network tend to trust each other more than random pairs of users in the network. In this paper, we propose recommendation technique using social network in Internet of Things environment. We study previous researches about information recommendation, IoT, and social IoT. We proposed SIoT_P(Social IoT Prediction) using social relationships and item-based collaborative filtering. Also, we proposed SR(Social Relationship) using four social relationships (Ownership Object Relationship, Co-Location Object Relationship, Social Object Relationship, Parental Object Relationship). We describe a recommendation scenario using our proposed method.

Adaptive Recommendation System for Health Screening based on Machine Learning

  • Kim, Namyun;Kim, Sung-Dong
    • International journal of advanced smart convergence
    • /
    • v.9 no.2
    • /
    • pp.1-7
    • /
    • 2020
  • As the demand for health screening increases, there is a need for efficient design of screening items. We build machine learning models for health screening and recommend screening items to provide personalized health care service. When offline, a synthetic data set is generated based on guidelines and clinical results from institutions, and a machine learning model for each screening item is generated. When online, the recommendation server provides a recommendation list of screening items in real time using the customer's health condition and machine learning models. As a result of the performance analysis, the accuracy of the learning model was close to 100%, and server response time was less than 1 second to serve 1,000 users simultaneously. This paper provides an adaptive and automatic recommendation in response to changes in the new screening environment.

Addressing the Cold Start Problem of Recommendation Method based on App (초기 사용자 문제 개선을 위한 앱 기반의 추천 기법)

  • Kim, Sung Rim;Kwon, Joon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.15 no.3
    • /
    • pp.69-78
    • /
    • 2019
  • The amount of data is increasing significantly as information and communication technology advances, mobile, cloud computing, the Internet of Things and social network services become commonplace. As the data grows exponentially, there is a growing demand for services that recommend the information that users want from large amounts of data. Collaborative filtering method is commonly used in information recommendation methods. One of the problems with collaborative filtering-based recommendation method is the cold start problem. In this paper, we propose a method to improve the cold start problem. That is, it solves the cold start problem by mapping the item evaluation data that does not exist to the initial user to the automatically generated data from the mobile app. We describe the main contents of the proposed method and explain the proposed method through the book recommendation scenario. We show the superiority of the proposed method through comparison with existing methods.

Content Recommendation Techniques for Personalized Software Education (개인화된 소프트웨어 교육을 위한 콘텐츠 추천 기법)

  • Kim, Wan-Seop
    • Journal of Digital Convergence
    • /
    • v.17 no.8
    • /
    • pp.95-104
    • /
    • 2019
  • Recently, software education has been emphasized as a key element of the fourth industrial revolution. Many universities are strengthening the software education for all students according to the needs of the times. The use of online content is an effective way to introduce SW education for all students. However, the provision of uniform online contents has limitations in that it does not consider individual characteristics(major, sw interest, comprehension, interests, etc.) of students. In this study, we propose a recommendation method that utilizes the directional similarity between contents in the boolean view history data environment. We propose a new item-based recommendation formula that uses the confidence value of association rule analysis as the similarity level and apply it to the data of domestic paid contents site. Experimental results show that the recommendation accuracy is improved than when using the traditional collaborative recommendation using cosine or jaccard for similarity measurements.

An Extended Content-based Procedure to Solve a New Item Problem (신상품 추천을 위한 확장된 내용기반 추천방법)

  • Jang, Moon-Kyoung;Kim, Hyea-Kyeong;Kim, Jae-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.4
    • /
    • pp.201-216
    • /
    • 2008
  • Nowadays various new items are available, but limitation of searching effort makes it difficult for customers to search new items which they want to purchase. Therefore new item providers and customers need recommendation systems which recommend right items for right customers. In this research, we focus on the new item recommendation issue, and suggest preference boundary- based procedures which extend traditional content-based algorithm. We introduce the concept of preference boundary in a feature space to recommend new items. To find the preference boundary of a target customer, we suggest heuristic algorithms to find the centroid and the radius of preference boundary. To evaluate the performance of suggested procedures, we have conducted several experiments using real mobile transaction data and analyzed their results. Some discussions about our experimental results are also given with a further research area.

  • PDF

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.

Image recommendation algorithm based on profile using user preference and visual descriptor (사용자 선호도와 시각적 기술자를 이용한 사용자 프로파일 기반 이미지 추천 알고리즘)

  • Kim, Deok-Hwan;Yang, Jun-Sik;Cho, Won-Hee
    • 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.

A Research on TF-IDF-based Patent Recommendation Algorithm using Technology Transfer Data (기술이전 데이터를 활용한 TF-IDF기반 특허추천 알고리즘 연구)

  • Junki Kim;Joonsoo Bae;Yeongheon Song;Byungho Jeong
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.46 no.3
    • /
    • pp.78-88
    • /
    • 2023
  • The increasing number of technology transfers from public research institutes in Korea has led to a growing demand for patent recommendation platforms for SMEs. This is because selecting the right technology for commercialization is a critical factor in business success. This study developed a patent recommendation system that uses technology transfer data from the past 10 years to recommend patents that are suitable for SMEs. The system was developed in three stages. First, an item-based collaborative filtering system was developed to recommend patents based on the similarities between the patents that SMEs have previously transferred. Next, a content-based recommendation system based on TF-IDF was developed to analyze patent names and recommend patents with high similarity. Finally, a hybrid system was developed that combines the strengths of both recommendation systems. The experimental results showed that the hybrid system was able to recommend patents that were both similar and relevant to the SMEs' interests. This suggests that the system can be a valuable tool for SMEs that are looking to acquire new technologies.