• Title/Summary/Keyword: paper recommendation

Search Result 1,134, Processing Time 0.035 seconds

An Adaptive Recommendation System for Personalized Stock Trading Advice Using Artificial Neural Networks

  • Kaensar, Chayaporn;Chalidabhongse, Thanarat
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.931-934
    • /
    • 2005
  • This paper describes an adaptive recommendation system that provides real-time personalized trading advice to the investors based on their profiles and trading information environment. A proposed system integrates Stochastic technical analysis and artificial neural network that incorporates an adaptive user modeling. The user model is constructed and updated based on initial user profile and recorded user interactions with the system. The information presented to each individual user is also tailor-made to fit the user's behavior and preference. A system prototype was implemented in JAVA. Experiments used to evaluate the system's performance were done on both human subjects and synthetic users. The results show our proposed system is able to rapidly learn to provide appropriate advice to different types of users.

  • PDF

A Recommendation System for Health Screening Hospitals based on Client Preferences

  • Kim, Namyun;Kim, Sung-Dong
    • International journal of advanced smart convergence
    • /
    • v.9 no.3
    • /
    • pp.145-152
    • /
    • 2020
  • When conducting a health screening, it is important to select the most appropriate hospitals for the screening items. There are various packages in the screening hospitals, and the screening items and price are very different for each package. In this paper, we provide a method of recommending the screening packages in consideration of the customer's preferences such as screening items and minimum matching ratio. First, after collecting package information of hospitals, information such as basic items and optional items in the package are extracted. Then, we determine whether the client's screening items exist in the basic item or optional item of the package and calculate the matching rate of the package. Finally, we recommend screening packages with the lowest price while meeting the minimum matching rate suggested by the client. For performance analysis, we implement a prototype for recommending screening packages and provide the experimental results. The performance analysis shows that the proposed approach provides a real-time response time and recommends appropriate packages.

Recommended Chocolate Applications Based On The Propensity To Consume Dining outside Using Big Data On Social Networks

  • Lee, Tae-gyeong;Moon, Seok-jae;Ryu, Gihwan
    • International Journal of Advanced Culture Technology
    • /
    • v.8 no.3
    • /
    • pp.325-333
    • /
    • 2020
  • In the past, eating outside was usually the purpose of eating. However, it has recently expanded into a restaurant culture market. In particular, a dessert culture is being established where people can talk and enjoy. Each consumer has a different tendency to buy chocolate such as health, taste, and atmosphere. Therefore, it is time to recommend chocolate according to consumers' tendency to eat out. In this paper, we propose a chocolate recommendation application based on the tendency to eat out using data on social networks. To collect keyword-based chocolate information, Textom is used as a text mining big data analysis solution.Text mining analysis and related topics are extracted and modeled. Because to shorten the time to recommend chocolate to users. In addition, research on the propensity of eating out is based on prior research. Finally, it implements hybrid app base.

An Applet Recommendation System for Multi-Application Smart Cards (멀티 애플리케이션 스마트카드를 위한 애플릿 추천 시스템)

  • Eun, Na-Rae;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2005.10b
    • /
    • pp.295-297
    • /
    • 2005
  • As multi-application smart cards have become very attractive mobile devices, card users are able to add and to remove card-applets after card issuance. However, because of constrained memory on a smart card, it is necessary to manage card-resident applets. In this paper, we propose an adaptive applet management algorithm in order to recommend card-resident applets which can be removed. This algorithm's goal is to select card-resident applets in a way minimizes the number of applet downloads. To serve this purpose, our algorithm identifies the applets that are most likely to be executed again, and based on that, decides which should be kept in the memorY and which can be discarded.

  • PDF

Automatic Recommendation of IPTV Programs using Collaborative Filtering (협업 필터링을 통한 IPTV 프로그램 자동 추천)

  • Kim, Eun-Hui;Kim, Mun-Churl
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.701-702
    • /
    • 2008
  • A large amount of efforts are required to search user's preferred contents for the program contents being provided by IPTV services. In this paper, using collaborative filtering, an automatic recommendation method of IPTV program contents is presented by reasoning similar group preferences on IPTV program contents which constitutes personalized IPTV environments. The proposed method models the user's preference of IPTV program contents with the program attributes such as content, genres, channels actor/actress, staffs and calculates it using the watching history of program contents in different genres and watching times. Also, the proposed method considers timely changing user's preference and the preference oon the content itself, which improves the traditional collaborative filtering methods that can not recommend the non-consumed items.

  • PDF

Addressing the New User Problem of Recommender Systems Based on Word Embedding Learning and Skip-gram Modelling

  • Shin, Su-Mi;Kim, Kyung-Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.7
    • /
    • pp.9-16
    • /
    • 2016
  • Collaborative filtering(CF) uses the purchase or item rating history of other users, but does not need additional properties or attributes of users and items. Hence CF is known th be the most successful recommendation technology. But conventional CF approach has some significant weakness, such as the new user problem. In this paper, we propose a approach using word embedding with skip-gram for learning distributed item representations. In particular, we show that this approach can be used to capture precise item for solving the "new user problem." The proposed approach has been tested on the Movielens databases. We compare the performance of the user based CF, item based CF and our approach by observing the change of recommendation results according to the different number of item rating information. The experimental results shows the improvement in our approach in measuring the precision applied to new user problem situations.

Personalized Travel Path Recommendations with Social Life Log (소셜 라이프 로그를 이용한 개인화된 여행 경로 추천)

  • Paul, Aniruddha;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jasesoo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2017.05a
    • /
    • pp.453-454
    • /
    • 2017
  • The travellers using social media leave their location history in the form of trajectories. These trajectories can be bridged for acquiring information, required for future recommendation for the future travelers, 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). It also maps both user's and routes' textual descriptions to the topical package space to get user topical package model and route topical package model (i.e., topical interest, cost, time and season).

  • PDF

Exponential Smoothing Temporal Association Rules for Recommendation of Temperal Products (시간 의존적인 상품 추천을 위한 지수 평활 시간 연관 규칙)

  • Jeong Kyeong Ja
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.45-52
    • /
    • 2005
  • We proposed the product recommendation algorithm mixed the temporal association rule and the exponential smoothing method. The temporal association rule added a temporal concept in a commercial association rule In this paper. we proposed a exponential smoothing temporal association rule that is giving higher weights to recent data than past data. Through simulation and case study in temporal data sets, we confirmed that it is more Precise than existing temporal association rules but consumes running time.

  • PDF

Priority Rankings of the System Modifications to Reduce Core Damage Frequency of Wolsong NPP Units 2/3/4

  • Kwon, Jong-Jooh;Kim, Myung-Ki;Seo, Mi-Ro;Hong, Sung-Yull
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1998.05a
    • /
    • pp.899-905
    • /
    • 1998
  • The analysis priority makings the recommendation to reduce the total core damage frequency (CDF) of Wolsong nuclear Power Plant nits 2/3/4 was Performed in this paper. In order to derive the recommendation, the sensitivity analysis of CDF on which major contributors effect m performed based on the accident quantification results during Level 1 Probabilistic safety assessment (PSA). Priorities were ranked in tile way that compares the CDF reduction rate with efforts required to implement those recommendations using risk matrix

  • PDF

Levelized Data Processing Method for Social Search in Ubiquitous Environment (유비쿼터스 환경에서 소셜 검색을 위한 레벨화된 데이터 처리 기법)

  • Kim, Sung Rim;Kwon, Joon Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.10 no.1
    • /
    • pp.61-71
    • /
    • 2014
  • Social networking services have changed the way people communicate. Rapid growth of information generated by social networking services requires effective search methods to give useful results. Over the last decade, social search methods have rapidly evolved. Traditional techniques become unqualified because they ignore social relation data. Existing social recommendation approaches consider social network structure, but social context has not been fully considered. Especially, the friend recommendation is an important feature of SNSs. People tend to trust the opinions of friends they know rather than the opinions of strangers. In this paper, we propose a levelized data processing method for social search in ubiquitous environment. We study previous researches about social search methods in ubiquitous environment. Our method is a new paradigm of levelelized data processing method which can utilize information in social networks, using location and friendship weight. Several experiments are performed and the results verify that the proposed method's performance is better than other existing method.