• Title/Summary/Keyword: recommendation algorithm

Search Result 412, Processing Time 0.03 seconds

Genre-based Collaborative Filtering Movie Recommendation (장르 기반 Collaborative Filtering 영화 추천)

  • Hwang, Ki-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.3
    • /
    • pp.51-59
    • /
    • 2010
  • There have been proposed several movie recommendation algorithms based on Collaborative Filtering(CF). CF decides neighbors whose ratings are the most similar to each other and it predicts how well users will like new movies, based on ratings from neighbors. This paper proposes a new method to improve the result predicted by CF based on genres of the movies seen by users. The proposed method can be combined to the most of all existing CF algorithms. In this paper, a performance evaluation has been conducted between an existing simple CF algorithm and CF-Genre that is the proposed genre-based method added to the CF algorithm. The result shows that CF-Genre improves 3.3% in prediction performance over existing CF algorithms.

A Study on Recommendation Systems based on User multi-attribute attitude models and Collaborative filtering Algorithm (다속성 태도 모델과 협업적 필터링 기반 장소 추천 연구)

  • Ahn, Byung-Ik;Jung, Ku-Imm;Choi, Hae-Lim
    • Smart Media Journal
    • /
    • v.5 no.2
    • /
    • pp.84-89
    • /
    • 2016
  • For a place-recommendation model based on user's behavior and multi-attribute attitude in this thesis. We focus groups that show similar patterns of visiting restaurants and then compare one and the other. We make use of The Fishbein Equation, Pearson's Correlation Coefficient to calculate multi-attribute attitude scores. Furthermore, We also make use of Preference Prediction Algorithm and Distance based method named "Euclidean Distance" to provide accurate results. We can demonstrate how excellent this system is through several experiments carried out with actual data.

Development of User-dependent Mid-point Navigation System (사용자 중심의 중간지점 탐색 시스템의 설계 및 구현)

  • Ahn, Jonghee;Kang, Inhyeok;Seo, Seyeong;Kim, Taewoo;Heo, Yusung;Ahn, Yonghak
    • Convergence Security Journal
    • /
    • v.19 no.2
    • /
    • pp.73-81
    • /
    • 2019
  • In this paper, we propose a user-dependent mid-point navigation system using a time weighted mid-point navigation algorithm and a user preference based mid-point neighborhood recommendation system. The proposed system consists of a mid-point navigation module for calculating an mid-point by applying a time weight of each user based on a departure point between users, and a search module for providing a search for a route to the calculated mid-point. In addition, based on the mid-point search result, it is possible to increase the utilization rate of users by including a place recommending function based on user's preference. Experimental results show that the proposed system can increase the efficiency of using by the user-dependent mid-point navigation and place recommendation function.

Deep learning-based custom problem recommendation algorithm to improve learning rate (학습률 향상을 위한 딥러닝 기반 맞춤형 문제 추천 알고리즘)

  • Lim, Min-Ah;Hwang, Seung-Yeon;Kim, Jeong-Jun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.171-176
    • /
    • 2022
  • With the recent development of deep learning technology, the areas of recommendation systems have also diversified. This paper studied algorithms to improve the learning rate and studied the significance results according to words through comparison with the performance characteristics of the Word2Vec model. The problem recommendation algorithm was implemented with the values expressed through the reflection of meaning and similarity test between texts, which are characteristics of the Word2Vec model. Through Word2Vec's learning results, problem recommendations were conducted using text similarity values, and problems with high similarity can be recommended. In the experimental process, it was seen that the accuracy decreased with the quantitative amount of data, and it was confirmed that the larger the amount of data in the data set, the higher the accuracy.

Machine Learning Algorithms for Predicting Anxiety and Depression (불안과 우울 예측을 위한 기계학습 알고리즘)

  • Kang, Yun-Jeong;Lee, Min-Hye;Park, Hyuk-Gyu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.207-209
    • /
    • 2022
  • In the IoT environment, it is possible to collect life pattern data by recognizing human physical activity from smart devices. In this paper, the proposed model consists of a prediction stage and a recommendation stage. The prediction stage predicts the scale of anxiety and depression by using logistic regression and k-nearest neighbor algorithm through machine learning on the dataset collected from life pattern data. In the recommendation step, if the symptoms of anxiety and depression are classified, the principal component analysis algorithm is applied to recommend food and light exercise that can improve them. It is expected that the proposed anxiety/depression prediction and food/exercise recommendations will have a ripple effect on improving the quality of life of individuals.

  • PDF

Fast Random Walk with Restart over a Signed Graph (부호 그래프에서의 빠른 랜덤워크 기법)

  • Myung, Jaeseok;Shim, Junho;Suh, Bomil
    • The Journal of Society for e-Business Studies
    • /
    • v.20 no.2
    • /
    • pp.155-166
    • /
    • 2015
  • RWR (Random Walk with Restart) is frequently used by many graph-based ranking algorithms, but it does not consider a signed graph where edges may have negative weight values. In this paper, we apply the Balance Theory by F. Heider to RWR over a signed graph and propose a novel RWR, Balanced Random Walk (BRW). We apply the proposed technique into the domain of recommendation system, and show by experiments its effectiveness to filter out the items that users may dislike. In order to provide the reasonable performance of BRW in the domain, we modify the existing Top-k algorithm, BCA, and propose a new algorithm, Bicolor-BCA. The proposed algorithm yet requires employing a threshold. In the experiment, we show how threshold values affect both precision and performance of the algorithm.

A Development of Optimal Travel Course Recommendation System based on Altered TSP and Elasticsearch Algorithm (변형된 TSP 및 엘라스틱서치 알고리즘 기반의 최적 여행지 코스 추천 시스템 개발)

  • Kim, Jun-Yeong;Jo, Kyeong-Ho;Park, Jun;Jung, Se-Hoon;Sim, Chun-Bo
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.9
    • /
    • pp.1108-1121
    • /
    • 2019
  • As the quality and level of life rise, many people are doing search for various pieces of information about tourism. In addition, users prefer the search methods reflecting individual opinions such as SNS and blogs to the official websites of tourist destination. Many of previous studies focused on a recommendation system for tourist courses based on the GPS information and past travel records of users, but such a system was not capable of recommending the latest tourist trends. This study thus set out to collect and analyze the latest SNS data to recommend tourist destination of high interest among users. It also aimed to propose an altered TSP algorithm to recommend the optimal routes to the recommended destination within an area and a system to recommend the optimal tourist courses by applying the Elasticsearch engine. The altered TSP algorithm proposed in the study used the location information of users instead of Dijkstra's algorithm technique used in previous studies to select a certain tourist destination and allowed users to check the recommended courses for the entire tourist destination within an area, thus offering more diverse tourist destination recommendations than previous studies.

Design of Elliptic Curve Cryptographic Coprocessor over binary fields for the IC card (IC 카드를 위한 polynomial 기반의 타원곡선 암호시스템 연산기 설계)

  • 최용제;김호원;김무섭;박영수
    • Proceedings of the IEEK Conference
    • /
    • 2001.06b
    • /
    • pp.305-308
    • /
    • 2001
  • This paper describes the design of elliptic curve cryptographic (ECC) coprocessor over binary fields for the If card. This coprocessor is implemented by the shift-and-add algorithm for the field multiplication algorithm. And the modified almost inverse algorithm(MAIA) is selected for the inverse multiplication algorithm. These two algorithms is merged to minimize the hardware size. Scalar multiplication is performed by the binary Non Adjacent Format(NAF) method. The ECC we have implemented is defined over the field GF(2$^{163}$), which is a SEC-2 recommendation[7]..

  • PDF

Ontology based Context-Aware Recommendation System using Concept Hierarchy (개념 계층 모델을 이용한 온톨로지 기반 상황 인식 추천 시스템)

  • Ahn, Myoung-Hwan;Kwon, Joon-Hee
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.81-89
    • /
    • 2007
  • In this thesis, we propose ontology based context-aware recommendation system using concept hierarchy(OCARCH), Context-aware recommendation services are useful to provide an user with relevant information and/or services bared on his current context, However several approaches to context-aware recommendation system have been already proposed, each of them provide information without considering level of information concept bared on his current context, For this reason, we propose OCARCH as system capable of helping people to find their way quickly and easily through large amounts of information by determining level of information concept based on his current context, We are also using prefetching algorithm to store recommendation information that the user is likely to need in the near future based on current predictions, Therefore the OCARCH enables users to obtain relevant information efficiently, Several experiments are performed and the experimental results show that the proposed system provides more effective than conventional context-aware recommendation system.

  • PDF

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

  • Pyo, Shinjee;Jeong, Jin-Hwan;Song, Injun
    • Journal of Broadcast Engineering
    • /
    • v.24 no.6
    • /
    • pp.1013-1023
    • /
    • 2019
  • In content consumption environment with various live TV channels, VoD contents and web contents, recommendation service is now a necessity, not an option. Currently, various kinds of recommendation services are provided in the OTT service or the IPTV service, such as recommending popular contents or recommending related contents which similar to the content watched by the user. However, in the case of a content viewing environment through TV or IPTV which shares one TV and a TV set-top box, it is difficult to recommend proper content to a specific user because one or more usage histories are accumulated in one subscription information. To solve this problem, this paper interprets the concept of family as {user, time}, extends the existing recommendation relationship defined as {user, content} to {user, time, content} and proposes a method based on deep learning algorithm. Through the proposed method, we evaluate the recommendation performance qualitatively and quantitatively, and verify that our proposed model is improved in recommendation accuracy compared with the conventional method.