• 제목/요약/키워드: Content-Based Recommendation Algorithm

검색결과 47건 처리시간 0.019초

영양성분 프로파일링 기반 사료추천 알고리듬 (Nutrient Profiling-based Pet Food Recommendation Algorithm)

  • 송희석
    • Journal of Information Technology Applications and Management
    • /
    • 제25권4호
    • /
    • pp.145-156
    • /
    • 2018
  • This study proposes a content-based recommendation algorithm (NRA) for pet food. The proposed algorithm tries to recommend appropriate or inappropriate feed by using collective intelligence based on user experience and prior knowledge of experts. Based on the physical and health status of the dogs, this study suggests what kind of nutrients are necessary for the dogs and the most recommended pet food containing these nutrients. Performance evaluation was performed in terms of recall, precision, F1 and AUC. As a result of the performance evaluation, the AUC and F1 value of the proposed NRA was 15% and 42% higher than that of the baseline model, respectively. In addition, the performance of NRA is shown higher for recommendation of normal dogs than disease dogs.

PCRM: Increasing POI Recommendation Accuracy in Location-Based Social Networks

  • Liu, Lianggui;Li, Wei;Wang, Lingmin;Jia, Huiling
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권11호
    • /
    • pp.5344-5356
    • /
    • 2018
  • Nowadays with the help of Location-Based Social Networks (LBSNs), users of Point-of-Interest (POI) recommendation service in LBSNs are able to publish their geo-tagged information and physical locations in the form of sign-ups and share their experiences with friends on POI, which can help users to explore new areas and discover new points-of-interest, and promote advertisers to push mobile ads to target users. POI recommendation service in LBSNs is attracting more and more attention from all over the world. Due to the sparsity of users' activity history data set and the aggregation characteristics of sign-in area, conventional recommendation algorithms usually suffer from low accuracy. To address this problem, this paper proposes a new recommendation algorithm based on a novel Preference-Content-Region Model (PCRM). In this new algorithm, three kinds of information, that is, user's preferences, content of the Point-of-Interest and region of the user's activity are considered, helping users obtain ideal recommendation service everywhere. We demonstrate that our algorithm is more effective than existing algorithms through extensive experiments based on an open Eventbrite data set.

LDA2Vec 항목 모델을 기반으로 한 협업 필터링 권장 알고리즘 (Collaborative Filtering Recommendation Algorithm Based on LDA2Vec Topic Model)

  • 장흠
    • 한국컴퓨터정보학회:학술대회논문집
    • /
    • 한국컴퓨터정보학회 2020년도 제62차 하계학술대회논문집 28권2호
    • /
    • pp.385-386
    • /
    • 2020
  • In this paper, we propose a collaborative filtering recommendation algorithm based on the LDA2Vec topic model. By extracting and analyzing the article's content, calculate their semantic similarity then combine the traditional collaborative filtering algorithm to recommend. This approach may promote the system's recommend accuracy.

  • PDF

비선호 분리 적용 콘텐츠 추천 방안 (Contents Recommendation Scheme Applying Non-preference Separately)

  • 윤주영;이길흥
    • 디지털산업정보학회논문지
    • /
    • 제19권3호
    • /
    • pp.221-232
    • /
    • 2023
  • In this paper, we propose a recommendation system based on the latent factor model using matrix factorization, which is one of the most commonly used collaborative filtering algorithms for recommendation systems. In particular, by introducing the concept of creating a list of recommended content and a list of non-preferred recommended content, and removing the non-preferred recommended content from the list of recommended content, we propose a method to ultimately increase the satisfaction. The experiment confirmed that using a separate list of non-preferred content to find non-preferred content increased precision by 135%, accuracy by 149%, and F1 score by 72% compared to using the existing recommendation list. In addition, assuming that users do not view non-preferred content through the proposed algorithm, the average evaluation score of a specific user used in the experiment increased by about 35%, from 2.55 to 3.44, thereby increasing user satisfaction. It has been confirmed that this algorithm is more effective than the algorithms used in existing recommendation systems.

An Intelligent Recommendation Service System for Offering Halal Food (IRSH) Based on Dynamic Profiles

  • Lee, Hyun-ho;Lee, Won-jin;Lee, Jae-dong
    • 한국멀티미디어학회논문지
    • /
    • 제22권2호
    • /
    • pp.260-270
    • /
    • 2019
  • As the growth of developing Islamic countries, Muslims are into the world. The most important thing for Muslims to purchase food, ingredient, cosmetics and other products are whether they were certified as 'Halal'. With the increasing number of Muslim tourists and residents in Korea, Halal restaurants and markets are on the rise. However, the service that provides information on Halal restaurants and markets in Korea is very limited. Especially, the application of recommendation system technology is effective to provide Halal restaurant information to users efficiently. The profiling of Halal restaurant information should be preceded by design of recommendation system, and design of recommendation algorithm is most important part in designing recommendation system. In this paper, an Intelligent Recommendation Service system for offering Halal food (IRSH) based on dynamic profiles was proposed. The proposed system recommend a customized Halal restaurant, and proposed recommendation algorithm uses hybrid filtering which is combined by content-based filtering, collaborative filtering and location-based filtering. The proposed algorithm combines several filtering techniques in order to improve the accuracy of recommendation by complementing the various problems of each filtering. The experiment of performance evaluation for comparing with existed restaurant recommendation system was proceeded, and result that proposed IRSH increase recommendation accuracy using Halal contents was deducted.

시청 시간대 정보를 활용한 LSTM 기반 IPTV 콘텐츠 추천 (LSTM-based IPTV Content Recommendation using Watching Time Information)

  • 표신지;정진환;송인준
    • 방송공학회논문지
    • /
    • 제24권6호
    • /
    • pp.1013-1023
    • /
    • 2019
  • 수많은 채널과 VoD 콘텐츠, 웹 콘텐츠들이 존재하는 콘텐츠 소비 환경에서의 추천은 이제 선택이 아닌 필수가 되었다. 현재 OTT서비스나 IPTV서비스에서도 많은 사람들이 선호하는 콘텐츠를 추천하거나 사용자가 시청한 콘텐츠와 유사한 콘텐츠들을 추천하는 등, 다양한 종류의 추천 서비스들이 제공되고 있다. 하지만 TV, IPTV와 같이 대체로 한 가구당 하나의 가입정보와 하나의 TV, 셋탑박스를 공유하는 TV를 통한 콘텐츠 시청환경의 경우, 하나의 가입정보에 1명 이상의 사용 이력이 쌓여 특정 사용자에 대한 추천을 제공하기에 어려움이 존재한다. 본 논문에서는 이러한 문제를 해결하기 위해 가족의 개념을 {사용자, 시간}으로 해석하여, 기존의 {사용자, 콘텐츠}로 정의하는 추천 관계를 {사용자, 시간, 콘텐츠}으로 확장하고 이를 딥러닝 기반으로 해결하는 방법을 제안한다. 제안한 방법을 통해 추천 성능을 정성적 정량적으로 평가하였으며, 기존의 시간대를 고려하지 않은 방법과 비교하여 추천 정확도가 향상됨을 확인할 수 있었다.

Development of the Recommender System of Arabic Books Based on the Content Similarity

  • Alotaibi, Shaykhah Hajed;Khan, Muhammad Badruddin
    • International Journal of Computer Science & Network Security
    • /
    • 제22권8호
    • /
    • pp.175-186
    • /
    • 2022
  • This research article develops an Arabic books' recommendation system, which is based on the content similarity that assists users to search for the right book and predict the appropriate and suitable books pertaining to their literary style. In fact, the system directs its users toward books, which can meet their needs from a large dataset of Information. Further, this system makes its predictions based on a set of data that is gathered from different books and converts it to vectors by using the TF-IDF system. After that, the recommendation algorithms such as the cosine similarity, the sequence matcher similarity, and the semantic similarity aggregate data to produce an efficient and effective recommendation. This approach is advantageous in recommending previously unrated books to users with unique interests. It is found to be proven from the obtained results that the results of the cosine similarity of the full content of books, the results of the sequence matcher similarity of Arabic titles of the books, and the results of the semantic similarity of English titles of the books are the best obtained results, and extremely close to the average of the result related to the human assigned/annotated similarity. Flask web application is developed with a simple interface to show the recommended Arabic books by using cosine similarity, sequence matcher similarity, and semantic similarity algorithms with all experiments that are conducted.

키워드 기반 콘텐츠 추천 웹서비스 (Keyword-Based Contents Recommendation Web Service)

  • 박동진;김민근;송현섭;윤석민;김영종
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2022년도 춘계학술발표대회
    • /
    • pp.346-348
    • /
    • 2022
  • Keyword-Based Contents Recommendation Web Service(서비스명 'mobodra')는 미디어 종류 및 장르 취향을 유저별로 분석하여 이에 맞는 콘텐츠를 추천하는 웹 서비스이다. 유저들은 회원가입 시 웹에서 제공하는 랜덤한 작품 중에 일부를 선택하며 서버에서 이를 토대로 취향을 분석한다. 해당 분석을 토대로 유저별 선호 콘텐츠를 추천한다. 본 논문에서는 아이템 기반 협업 필터링(Item-Based Collaborative Filtering)을 통해 콘텐츠 추천 알고리즘을 구현한다. 유저의 활동 데이터 혹은 선호도 재조사 시 위 과정을 다시 실행하여 사용자의 취향을 갱신한다.

A Hybrid Recommendation System based on Fuzzy C-Means Clustering and Supervised Learning

  • Duan, Li;Wang, Weiping;Han, Baijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권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.

A Study on Story propose model based on Machine Learning - Focused on YouTube

  • CHUN, Sanghun;SHIN, Seung-Jung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제13권2호
    • /
    • pp.224-230
    • /
    • 2021
  • YouTube is an OTT service that leads the home economy, which has emerged from the 2020 Corona Pandemic. With the growth of OTT-based individual media, creators are required to establish attractive storytelling strategies that can be preferred by viewers and elected for YouTube recommendation algorithms. In this study, we conducted a study on modeling that proposes a content storyline for creators. As the ability for Creators to create content that viewers prefer, we have presented the data literacy ability to find patterns in complex and massive data. We also studied the importance of compelling storytelling configurations that viewers prefer and can be selected for YouTube recommendation algorithms. This study is of great significance in that it deviated from the viewer-oriented recommendation system method and proposed a story suggestion model for individual creaters. As a result of incorporating this story proposal model into the production of the YouTube channel Tiger Love video, it showed a certain effectiveness. This story suggestion model is a machine learning text-based story suggestion system, excluding the application of photography or video.