• Title/Summary/Keyword: Recommending system

Search Result 214, Processing Time 0.027 seconds

A Web-document Recommending System using the Korean Thesaurus (한국어 시소러스를 이용한 웹 문서 추천 에이전트)

  • Seo, Min-Rye;Lee, Song-Wook;Seo, Jung-Yun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.1
    • /
    • pp.103-109
    • /
    • 2009
  • We build the web document recommending agent system which offers a certain amount of web documents to each user by monitoring and learning the user's action of web browsing. We also propose a method of query expansion using the Korean thesaurus. The queries to search for new web documents generate a candidate set using the Korean thesaurus. We extract the words which are mostly correlated with the queries, among the words in the candidate set, by using TF-IDF and mutual information. Then, we expand the query. If we adopt the system of query expansion, we can recommend a lot of web documents which have potential interests to users. We thus conclude that the system of query expansion is more effective than a base system of recommending web-documents to users.

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.

A Study of Recommending Service Using Mining Sequential Pattern based on Weight (가중치 기반의 순차패턴 탐사를 이용한 추천서비스에 관한 연구)

  • Cho, Young-Sung;Moon, Song-Chul;Ahn, Yeon S.
    • Journal of Digital Contents Society
    • /
    • v.15 no.6
    • /
    • pp.711-719
    • /
    • 2014
  • Along with the advent of ubiquitous computing environment, it is becoming a part of our common life style that the demands for enjoying the wireless internet using intelligent portable device such as smart phone and iPad, are increasing anytime or anyplace without any restriction of time and place. The recommending service becomes a very important technology which can find exact information to present users, then is easy for customers to reduce their searching effort to find out the items with high purchasability in e-commerce. Traditional mining association rule ignores the difference among the transactions. In order to do that, it is considered the importance of type of merchandise or service and then, we suggest a new recommending service using mining sequential pattern based on weight to reflect frequently changing trends of purchase pattern as time goes by and as often as customers need different merchandises on e-commerce being extremely diverse. To verify improved better performance of proposing system than the previous systems, we carry out the experiments in the same dataset collected in a cosmetic internet shopping mall.

A Study of Similar Blog Recommendation System Using Termite Colony Algorithm (흰개미 군집 알고리즘을 이용한 유사 블로그 추천 시스템에 관한 연구)

  • Jeong, Gi Sung;Jo, I-Seok;Lee, Malrey
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.83-88
    • /
    • 2013
  • This paper proposes a recommending system of the similar blogs gathered with similarities between blogs according to the similarity, dividing words, for each frequency, that individual blogs have. It improved the algorithm of k-means, using the model of the habits of white ants for better performance of clustering, and showed better performance of clustering as a result of evaluating and comparing with the existing algorithm of k-means as the improved algorithm. The recommending system of similar blog was designed and embodied, using the improved algorithm. TCA can reduce clustering time and the number of moving time for clustering compare with K-means algorithm.

Improved Cold Item Recommendation Accuracy by Applying an Recommendation Diversification Method (추천 다양화 방법을 적용한 콜드 아이템 추천 정확도 향상)

  • Han, Jungkyu;Chun, Sejin
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.1242-1250
    • /
    • 2022
  • When recommending cold items that do not have user-item interactions to users, even we adopt state-of-the-arts algorithms, the predicted information of cold items tends to have lower accuracy compared to warm items which have enough user-item interactions. The lack of information makes for recommender systems to recommend monotonic items which have a few top popular contents matched to user preferences. As a result, under-diversified items have a negative impact on not only recommendation diversity but also on recommendation accuracy when recommending cold items. To address the problem, we adopt a diversification algorithm which tries to make distributions of accumulated contents embedding of the two items groups, recommended items and the items in the target user's already interacted items, similar. Evaluation on a real world data set CiteULike shows that the proposed method improves not only the diversity but also the accuracy of cold item recommendation.

Digital Convergence Teaching Strategy System using Spearman Correlation Coefficients (스피어만 상관계수를 이용한 디지털 융합 강의 전략 시스템)

  • Lee, Byung-Wook
    • Journal of Internet Computing and Services
    • /
    • v.11 no.6
    • /
    • pp.111-122
    • /
    • 2010
  • Since educating digital convergence is to unite various sciences and technologies with computer as the central figure, it has different range and methods of education. Therefore, it has problems with recommending limited conceptual information because of difficulties to standardize education plan and teaching strategies. In this paper, I propose education plan and teaching strategy system by using Spearman correlation coefficients. This system is to find a solution against disadvantage of recommending limited conceptual information by ranking relations of teaching strategies from the information based on the demand of industrial and academic fields, and then provides lists of teaching strategy information suitable for user's atmosphere and characteristics. Performance test is to compare effects of precision and recall with existing service systems. The test shows 90.4% of precision and 77.6% of recall.

A Dynamic Recommendation Agent System for E-Mail Management based on Rule Filtering Component (이메일 관리를 위한 룰 필터링 컴포넌트 기반 능동형 추천 에이전트 시스템)

  • Jeong, Ok-Ran;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2004.05a
    • /
    • pp.126-128
    • /
    • 2004
  • As e-mail is becoming increasingly important in every day life activity, mail users spend more and more time organizing and classifying the e-mails they receive into folder. Many existing recommendation systems or text classification are mostly focused on recommending the products for the commercial purposes or web documents. So this study aims to apply these application to e-mail more necessary to users. This paper suggests a dynamic recommendation agent system based on Rule Filtering Component recommending the relevant category to enable users directly to manage the optimum classification when a new e-mail is received as the effective method for E-Mail Management. Moreover we try to improve the accuracy as eliminating the limits of misclassification that can be key in classifying e-mails by category. While the existing Bayesian Learning Algorithm mostly uses the fixed threshold, we prove to improve the satisfaction of users as increasing the accuracy by changing the fixed threshold to the dynamic threshold. We designed main modules by rule filtering component for enhanced scalability and reusability of our system.

  • PDF

A System Algorithm for Recommending User-Customized Games

  • Son, So-hui;Lee, Im-kyeong;Huh, Jun-ho
    • Journal of Multimedia Information System
    • /
    • v.4 no.3
    • /
    • pp.145-150
    • /
    • 2017
  • Recently, game companies are having difficulties in exactly figuring out the right consumer groups for their games. To solve this problem, a system algorithm which recommends user-customized games based on the user information entered has been proposed in this study. Game developers will be able to clearly determine the consumer group(s) of both on and off-line games through accumulated data while consumers can find the game they desire. It is expected that the gaming culture will advance further with the proposed algorithm.

The Goods Recommendation System based on modified FP-Tree Algorithm (변형된 FP-Tree를 기반한 상품 추천 시스템)

  • Kim, Jong-Hee;Jung, Soon-Key
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.11
    • /
    • pp.205-213
    • /
    • 2010
  • This study uses the FP-tree algorithm, one of the mining techniques. This study is an attempt to suggest a new recommended system using a modified FP-tree algorithm which yields an association rule based on frequent 2-itemsets extracted from the transaction database. The modified recommended system consists of a pre-processing module, a learning module, a recommendation module and an evaluation module. The study first makes an assessment of the modified recommended system with respect to the precision rate, recall rate, F-measure, success rate, and recommending time. Then, the efficiency of the system is compared against other recommended systems utilizing the sequential pattern mining. When compared with other recommended systems utilizing the sequential pattern mining, the modified recommended system exhibits 5 times more efficiency in learning, and 20% improvement in the recommending capacity. This result proves that the modified system has more validity than recommended systems utilizing the sequential pattern mining.

Identifying Prospective Visitors and Recommending Personalized Booths in the Exhibition Industry

  • Moon, Hyun Sil;Kim, Jae Kyeong;Choi, Il Young
    • Journal of Information Technology Applications and Management
    • /
    • v.21 no.1
    • /
    • pp.85-105
    • /
    • 2014
  • Exhibition industry is important business domains to many countries. Not only lots of countries designated the exhibition industry as tools to stimulate national economics, but also many companies offer millions of service or products to customers. Recommender systems can help visitors navigate through large information spaces of various booths. However, no study before has proposed a methodology for identifying and acquiring prospective visitors although it is important to acquire them. Accordingly, we propose a methodology for identifying, acquiring prospective visitors, and recommending the adequate booth information to their preferences in the exhibition industry. We assume that a visitor will be interested in an exhibition within same class of exhibition taxonomy as exhibition which the visitor already saw. Moreover, we use user-based collaborative filtering in order to recommend personalized booths before exhibition. A prototype recommender system is implemented to evaluate the proposed methodology. Our experiments show that the proposed methodology is better than the item-based CF and have an effect on the choice of exhibition or exhibit booth through automation of word-of-mouth communication.