• Title/Summary/Keyword: paper recommendation

Search Result 1,134, Processing Time 0.03 seconds

Transformer-based DKN for News Recommendation

  • Xia, Hanwei;Joe, Inwhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.05a
    • /
    • pp.523-525
    • /
    • 2020
  • In recent years, deep learning has been widely used in news recommendation systems. In the previous personalized news recommendation, a large number of CF-based methods, content-based or hybrid methods have been proposed. But most of the works are only modeling the user's interaction history, ignoring the hidden meaning of the user's continuous behaviors. In this paper, we propose to adopt the powerful Transformer model in order to understand the hidden meaning of the user's continuous behaviors in news recommendations. The experimental results prove the superiority of the transformer, and the AUC has been significantly improved as compared to the original model.

Content-based Movie Recommendation system based on demographic information and average ratings of genres. (사용자 정보 및 장르별 평균 평가를 이용한 내용 기반 영화 추천 시스템)

  • Ugli, Sadriddinov Ilkhomjon Rovshan;Park, Doo-Soon;Kim, Dae-Young
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.34-36
    • /
    • 2022
  • Over the last decades, information has increased exponentially due to SNS(Social Network Service), IoT devices, World Wide Web, and many others. Therefore, it was monumentally hard to offer a good service or set of recommendations to consumers. To surmount this obstacle numerous research has been conducted in the Data Mining field. Different and new recommendation models have emerged. In this paper, we proposed a Content-based movie recommendation system using demographic information of users and the average rating for genres. We used MovieLens Dataset to proceed with our experiment.

Using Metaverse and AI recommendation services Development of Korea's leading kiosk usage service guide (메타버스와 AI 추천서비스를 활용한 국내 대표 키오스크 사용서비스 안내 개발)

  • SuHyeon Choi;MinJung Lee;JinSeo Park;Yeon Ho Seo;Jaehyun Moon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.886-887
    • /
    • 2023
  • This paper is about the development of kiosks that provide four types of service. Simple UI and educational videos solve the complexity of existing kiosks and provide an intuitive and convenient screen to users. In addition, the AR function, which is a three-dimensional form, shows directions and store representative images. After storing user information in the DB, a learning model is generated using user-based KNN collaborative filtering to provide a recommendation menu. As a result, it is possible to increase user convenience through kiosks using metaverse and AI recommendation services. It is also expected to solve digital alienation of social classes who have difficulty using kiosks.

Complexity and Algorithms for Optimal Bundle Search Problem with Pairwise Discount

  • Chung, Jibok;Choi, Byungcheon
    • Journal of Distribution Science
    • /
    • v.15 no.7
    • /
    • pp.35-41
    • /
    • 2017
  • Purpose - A product bundling is a marketing approach where multiple products or components are packaged together into one bundle solution. This paper aims to introduce an optimal bundle search problem (hereinafter called "OBSP") which may be embedded with online recommendation system to provide an optimized service considering pairwise discount and delivery cost. Research design, data, and methodology - Online retailers have their own discount policy and it is time consuming for online shoppers to find an optimal bundle. Unlike an online system recommending one item for each search, the OBSP considers multiple items for each search. We propose a mathematical formulation with numerical example for the OBSP and analyzed the complexity of the problem. Results - We provide two results from the complexity analysis. In general case, the OBSP belongs to strongly NP-Hard which means the difficulty of the problem while the special case of OBSP can be solved within polynomial time by transforming the OBSP into the minimum weighted perfect matching problem. Conclusions - In this paper, we propose the OBSP to provide a customized service considering bundling price and delivery cost. The results of research will be embedded with an online recommendation system to help customers for easy and smart online shopping.

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.

Recommendation of tourist attractions based on Preferences using big data

  • KIM HYUN SEOK;Gi-hwan Ryu;kim im yeo-reum
    • International Journal of Advanced Culture Technology
    • /
    • v.11 no.3
    • /
    • pp.327-331
    • /
    • 2023
  • This paper proposes a tourist destination recommendation application that combines a chatbot and a recommendation system. The data to be entered into the chatbot was through big data on social media. Through TEXTOM, a total of 22,701 data were collected over a one-year period from January 2022 to January 2023. Non-terms that interfere with analysis were removed through the data purification process. Using refined data, network visualization and CONCOR analysis were used to identify the information users want to obtain about travel to Jeju Island, and categories for each cluster were organized. The content was intuitively organized so that even those who approached it for the first time could easily use it, reducing the difficulty of operating the application. In this paper, users can select their own preferences and receive information. In addition, a tool called a chatbot allows users to focus more on the process of acquiring information by gaining a sense of reality while operating the application. This suggests an application that can reach the purpose of the curator by affecting the user's desire to visit tourist attractions.

A Study on Validity Analysis of Observation-Recommendation Admission System of the Gifted Children in IT to Lead Software-oriented Society (소프트웨어 중심사회를 선도할 정보영재아동의 관찰추천 입학제도 타당성 분석연구)

  • Jun, Woo-chun
    • Journal of Internet Computing and Services
    • /
    • v.17 no.3
    • /
    • pp.87-93
    • /
    • 2016
  • In the current information-based society, information and communication technology(ICT) is very important for an individual, a society, and a nation. Especially, for a nation, ICT-related industries are forming an important part of a nation's economy. Also, unlike other industries, ICT-related industries do not require various infrastructures, and have an advantage of being developed with a few talented persons in a short period of time. In this sense, identification and education of gifted children in IT become an essential task of a nation's future. In the past, selection of the gifted children was based on paper tests. However, paper tests incurred various side effects such as private education. Since 2013, observation-recommendation system instead of paper tests has been fully adopted. The purpose of this paper is to analyze the validity of observation-recommendation admission system of the gifted children in IT. For this research purpose, the gifted children in gifted science education center attached in a university at Seoul become the focus of the samples. Their entrance score ranking and graduation record raking are compared for analysis of validity of admission system. After statistical analysis, there is a meaningful correlation between entrance score ranking and graduation record ranking for the gifted children in IT. It means that the higher entrance score ranking, the higher graduation record ranking. The analysis results are expected to be valuable baseline data for deciding usefulness of observation-recommendation admission system.

Automatic TV Program Recommendation using LDA based Latent Topic Inference (LDA 기반 은닉 토픽 추론을 이용한 TV 프로그램 자동 추천)

  • Kim, Eun-Hui;Pyo, Shin-Jee;Kim, Mun-Churl
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.270-283
    • /
    • 2012
  • With the advent of multi-channel TV, IPTV and smart TV services, excessive amounts of TV program contents become available at users' sides, which makes it very difficult for TV viewers to easily find and consume their preferred TV programs. Therefore, the service of automatic TV recommendation is an important issue for TV users for future intelligent TV services, which allows to improve access to their preferred TV contents. In this paper, we present a recommendation model based on statistical machine learning using a collaborative filtering concept by taking in account both public and personal preferences on TV program contents. For this, users' preference on TV programs is modeled as a latent topic variable using LDA (Latent Dirichlet Allocation) which is recently applied in various application domains. To apply LDA for TV recommendation appropriately, TV viewers's interested topics is regarded as latent topics in LDA, and asymmetric Dirichlet distribution is applied on the LDA which can reveal the diversity of the TV viewers' interests on topics based on the analysis of the real TV usage history data. The experimental results show that the proposed LDA based TV recommendation method yields average 66.5% with top 5 ranked TV programs in weekly recommendation, average 77.9% precision in bimonthly recommendation with top 5 ranked TV programs for the TV usage history data of similar taste user groups.

Personalized Travel Path Recommendation Scheme on Social Media (소셜 미디어 상에서 개인화된 여행 경로 추천 기법)

  • Aniruddha, Paul;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.2
    • /
    • pp.284-295
    • /
    • 2019
  • In the recent times, a personalized travel path recommendation based on both travelogues and community contributed photos and the heterogeneous meta-data (tags, geographical locations, and date taken) which are associated with photos have been studied. The travellers using social media leave their location history, in the form of paths. These paths can be bridged for acquiring information, required, for future recommendation, for the future travellers, who are new to that location, providing all sort of information. In this paper, we propose a personalized travel path recommendation scheme, based on social life log. By taking advantage, of two kinds of social media, such as travelogue and community contributed photos, the proposed scheme, can not only be personalized to user's travel interest, but also be able to recommend, a travel path rather than individual Points of Interest (POIs). The proposed personalized travel route recommendation method consists of two steps, which are: pruning POI pruning step and creating travel path step. In the POI pruning step, candidate paths are created by the POI derived. In the creating travel path step, the proposed scheme creates the paths considering the user's interest, cost, time, season of the topic for more meaningful recommendation.

Implementation of App System for Personalized Health Information Recommendation (사용자 맞춤형 건강정보 추천 앱 구현)

  • Park, Seong-min;Park, Jeong-soo;Lee, Yoon-kyu;Chae, Woo-Joon;Shin, Moon-sun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.316-318
    • /
    • 2019
  • Recently, healthy life has become an issue in an aging society, and the number of people who have been interested in continuous health care for better life is increasing. In this paper, we implemented a personalized recommendation systm to provide convenient healthcare management for user. The PHR (Personal Health Record) of user could be stored in the server along with health related information such as lifestyle, disease, and physical condition. The users could be classified into similar clusters according to the PHR profile in order to provide healthcare contents to the users who had similar PHR profile. K-Means clustering was applied to generate clusters based on PHR profile and ACDT(Ant Colony Decision Tree) algorithm was used to provide personalised recommendation of health information stored in knowledge base. The app system developed in this paper is useful for users to perform healthcare themselves by providing information on serious diseases and lifestyle habits to be improved according to the clusters classified by PHR profile.

  • PDF