• Title/Summary/Keyword: paper recommendation

Search Result 1,140, Processing Time 0.031 seconds

An Ontology-Based Method for Calculating the Difficulty of a Learning Content (온톨로지 기반 학습 콘텐츠의 난이도 계산 방법)

  • Park, Jae-Wook;Park, Mee-Hwa;Lee, Yong-Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.2
    • /
    • pp.83-91
    • /
    • 2011
  • Much research has been conducted on the e-learning systems for recommending a learning content to a student based on the difficulty of it. The difficulty is one of the most important factors for selecting a learning content. In the existing learning content recommendation systems, the difficulty of a learning content is determined by the creator. Therefore, it is not easy to apply a standard rule to the difficulty as it is determined by a subjective method. In this paper, we propose an ontology-based method for determining the difficulty of a learning content in order to provide an objective measurement. Previously, ontologies and knowledge maps have been used to recommend a learning content. However, their methods have the same problem because the difficulty is also determined by the creator. In this research, we use an ontology representing the IS-A relationships between words. The difficulty of a learning content is the sum of the weighted path lengths of the words in the learning content. By using this kind of difficulty, we can provide an objective measurement and recommend the proper learning content most suitable for the student's current level.

Index for Efficient Ontology Retrieval and Inference (효율적인 온톨로지 검색과 추론을 위한 인덱스)

  • Song, Seungjae;Kim, Insung;Chun, Jonghoon
    • The Journal of Society for e-Business Studies
    • /
    • v.18 no.2
    • /
    • pp.153-173
    • /
    • 2013
  • The ontology has been gaining increasing interests by recent arise of the semantic web and related technologies. The focus is mostly on inference query processing that requires high-level techniques for storage and searching ontologies efficiently, and it has been actively studied in the area of semantic-based searching. W3C's recommendation is to use RDFS and OWL for representing ontologies. However memory-based editors, inference engines, and triple storages all store ontology as a simple set of triplets. Naturally the performance is limited, especially when a large-scale ontology needs to be processed. A variety of researches on proposing algorithms for efficient inference query processing has been conducted, and many of them are based on using proven relational database technology. However, none of them had been successful in obtaining the complete set of inference results which reflects the five characteristics of the ontology properties. In this paper, we propose a new index structure called hyper cube index to efficiently process inference queries. Our approach is based on an intuition that an index can speed up the query processing when extensive inferencing is required.

Perceived Product Value and Attitude Change Affecting Web-based Price Discount Level and Scarcity (웹 기반 가격할인 수준과 희소성이 영향을 주는 지각된 제품 가치와 태도 변화)

  • Zhang, Yutao;Lim, Hyun-A;Choi, Jaewon
    • The Journal of Information Systems
    • /
    • v.27 no.2
    • /
    • pp.157-173
    • /
    • 2018
  • Purpose Product characteristics and price value in website have strongly effects on customer satisfaction. Especially, in the online shopping site, the scarcity limits the customer's opportunity to purchase the product. Thus scarcity has been proposed as a important factor that makes the customer highly aware of the merchantability of the product. The scarcity in the web store is used as an important variable to make purchasing decisions of users easier by psychological pressure. In the case of scarce products with price discounts in online commerce, advertising formats that highlight scarcity value in the web commerce market are very effective in enhancing purchase intentions of consumers. Unlike offline stores, the importance of scarcity becomes more important when reflecting the characteristics of online commerce. Therefore, this study intends to confirm the influence of the degree of price discounts and scarcity information presented by Web sites on consumer purchase behavior in Web purchase behavior. Design/methodology/approach This study conducted a web-based experimental study on price sensitivity and price discount. Therefore, we created experimental web-sites that offer two stimuli according to the discount rate. The 200 respondents were randomly assigned. The stimuli were fictitious based on tourism products. The first stimulus presented the price discount(15% discount) with basic explanation about the package of the tourist package. The stimuli assigned to the second group were used for groups with high price discount intensity(65% discount). In this way, the two stimuli clearly distinguished the level of price discount intensity. This paper conducted t-test analysis and structural equation to analyze the experiemental results after confirming the reliability and validity. Findings The results of this study are as follows. The difference in price discount intensity (15% vs 65%) with scarcity showed the mean difference among all the variables. Therefore, this study concluded that there is a significant difference between the price discount of 15% and 65% for the acquisition value and transaction value of users. In particular, consumers' purchase intention is greater and product recommendation intensity is stronger when the price discount is 65%. As a result, the high degree of the price discount intensity with scarcity exerts a greater influence on consumers' purchase intentions. Product scarcity also have a significant impact on perceived value of users. Therefore, purchase intention of customers increases when perceived value increases their profit and pleasure feeling.

Recommendation of Best Empirical Route Based on Classification of Large Trajectory Data (대용량 경로데이터 분류에 기반한 경험적 최선 경로 추천)

  • Lee, Kye Hyung;Jo, Yung Hoon;Lee, Tea Ho;Park, Heemin
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.101-108
    • /
    • 2015
  • This paper presents the implementation of a system that recommends empirical best routes based on classification of large trajectory data. As many location-based services are used, we expect the amount of location and trajectory data to become big data. Then, we believe we can extract the best empirical routes from the large trajectory repositories. Large trajectory data is clustered into similar route groups using Hadoop MapReduce framework. Clustered route groups are stored and managed by a DBMS, and thus it supports rapid response to the end-users' request. We aim to find the best routes based on collected real data, not the ideal shortest path on maps. We have implemented 1) an Android application that collects trajectories from users, 2) Apache Hadoop MapReduce program that can cluster large trajectory data, 3) a service application to query start-destination from a web server and to display the recommended routes on mobile phones. We validated our approach using real data we collected for five days and have compared the results with commercial navigation systems. Experimental results show that the empirical best route is better than routes recommended by commercial navigation systems.

Two Factors of Overseas Online Shopping : Self-Efficacy and Impulsivity (해외직접구매의 두 요소 : 자기효능감과 구매충동성)

  • Lee, Han-Suk
    • Journal of Distribution Science
    • /
    • v.16 no.8
    • /
    • pp.79-89
    • /
    • 2018
  • Purpose - This research aims to investigate the factors that influence consumer's overseas online shopping behavior. Consumers adopt overseas online shopping as a new buying way and more and more consumers prefer overseas online shopping than traditional shopping ways. Consumers' behaviors in this shopping experience can be different from other shopping experiences. With the increase of overseas online shopping, we need to find antecedents and results of overseas online shopping. Especially there would be positive or negative factors which influence overseas online shopping motivation. To find the relationship, this study examines self-efficacy and impulsivity as major factors which influence overseas online shopping. We also suggest that several attitude factors increase self-efficacy and it is positively related to customer satisfaction. On the other hand, we assume that overseas online shopping factors influence impulsivity of buying and it will decrease customer satisfaction. Research design, data, and methodology - This empirical study data were collected from Korean people who experience overseas online shopping. The subjects for this study were confined to shoppers who used overseas online shopping within the past six months. A total of 267 responses were gathered. SPSS 23.0, PLS 2.0 software were used in the data analysis. Descriptive statistics were used to show sample characteristics. We examined reliability, validity test for constructs. All measurement items used seven-point scales(1= very strong disagree, 7 = very strongly agree) drawn from previously published papers. Partial Least Square method was applied to find the relationship between antecedent factors and dependent factors and hypotheses were estimated. Results - Results show that perceived superiority, perceived ease of use, perceived transaction safety, perceived behavioral control positively affect self-efficacy. Self-efficacy influences positively to consumer's post purchase satisfaction. Perceived monetary benefit and perceived uniqueness motivated impulse buying. This can make consumer's post purchase dissatisfaction. Conclusions - This paper attempted to confirm the existence of both the positive and negative faces of overseas online shopping. The result reveals that self-efficacy is a major factor which may increase satisfaction in the overseas online shopping. Usually, we can think monetary benefit and uniqueness of products motivate overseas online shopping. But it can also intrigue impulse buying and negatively affect customer relationship. Therefore companies should provide enough products information to their potential customers and they might apply adequate processes such as recommendation, comparing systems to build long term relationship with their customers.

Simulation training applying SBAR for the improvement of nursing undergraduate students' interdisciplinary communication skills (SBAR 적용 시뮬레이션 교육이 간호학생의 의료팀간 의사소통능력 향상에 미치는 효과)

  • Ha, Yikyung;Lee, Yoonju;Lee, Yeon Hee
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.2
    • /
    • pp.407-419
    • /
    • 2017
  • In this paper, we aim to evaluate the effect of simulation training with a focus on the application of SBAR for the improvement of communication skills of nursing students with physician. The results of the analysis of 25 videos recorded pre/post-simulation were as follows: In terms of the SBAR score, "the most recently measured vital signs" in stage B increased significantly (Z = -2.448, p =.014); the frequency of step-by-step progress in SBAR did not advance to the SBA or SBAR stage in the pre-simulation stage, but increased to 48% post-simulation. The frequencies of SBAR evaluation items mentioned in the post-simulation were the following order: the name of the patient (96%), nurse's name (80%), most recently measured oxygen saturation (76%), and main symptoms (60%). The results of the nurse's judgment (A), request for additional prescription or request for the doctor's direct patient visit (R) were not mentioned. Therefore, it is necessary to consider the application of SBAR in simulation training, which requires problem solving through cooperation with physicians, because it has a positive effect on education in nurse-physician communication.

An Investigation on Expanding Co-occurrence Criteria in Association Rule Mining (온라인 연관관계 분석의 장바구니 기준에 대한 연구)

  • Kim, Mi-Sung;Kim, Nam-Gyu
    • CRM연구
    • /
    • v.4 no.2
    • /
    • pp.19-29
    • /
    • 2011
  • There is a large difference between purchasing patterns in an online shopping mall and in an offline market. This difference may be caused mainly by the difference in accessibility of online and offline markets. It means that an interval between the initial purchasing decision and its realization appears to be relatively short in an online shopping mall, because a customer can make an order immediately. Because of the short interval between a purchasing decision and its realization, an online shopping mall transaction usually contains fewer items than that of an offline market. In an offline market, customers usually keep some items in mind and buy them all at once a few days after deciding to buy them, instead of buying each item individually and immediately. On the contrary, more than 70% of online shopping mall transactions contain only one item. This statistic implies that traditional data mining techniques cannot be directly applied to online market analysis, because hardly any association rules can survive with an acceptable level of Support because of too many Null Transactions. Most market basket analyses on online shopping mall transactions, therefore, have been performed by expanding the co-occurrence criteria of traditional association rule mining. While the traditional co-occurrence criteria defines items purchased in one transaction as concurrently purchased items, the expanded co-occurrence criteria regards items purchased by a customer during some predefined period (e.g., a day) as concurrently purchased items. In studies using expanded co-occurrence criteria, however, the criteria has been defined arbitrarily by researchers without any theoretical grounds or agreement. The lack of clear grounds of adopting a certain co-occurrence criteria degrades the reliability of the analytical results. Moreover, it is hard to derive new meaningful findings by combining the outcomes of previous individual studies. In this paper, we attempt to compare expanded co-occurrence criteria and propose a guideline for selecting an appropriate one. First of all, we compare the accuracy of association rules discovered according to various co-occurrence criteria. By doing this experiment we expect that we can provide a guideline for selecting appropriate co-occurrence criteria that corresponds to the purpose of the analysis. Additionally, we will perform similar experiments with several groups of customers that are segmented by each customer's average duration between orders. By this experiment, we attempt to discover the relationship between the optimal co-occurrence criteria and the customer's average duration between orders. Finally, by a series of experiments, we expect that we can provide basic guidelines for developing customized recommendation systems.

  • PDF

A Study on Real-Time Loudness Metering Algorithm for Digital Broadcasting (디지털 방송용 오디오 레벨 계측 알고리즘의 실시간화 연구)

  • Park Seong-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.16 no.4 s.95
    • /
    • pp.427-437
    • /
    • 2005
  • In this paper, the perceived audio level metering algorithm of digital audio sound to be able to operate in real-time is proposed. Through analyzing a conventional recommendation ITU-RBS1387-I for objective audio quality analysis, FFT-based loudness metering algorithm is implemented and the real-time method of that algorithm was advised and proved. The proposed method is based on look-up table. In order to prove the proved method, using 23 pure tones and 30 preselected digital audio samples, its performance and operation time is evaluated. Its performance, compared with an original algorithm's, have a good figure of less than $2\;\%$ error even if look-up table related with spectral spreading have large level resolution of $10\;\cal{dB}$. The proposed algorithm take only 1/21 of original algorithm's measuring time. Also, in the proposed algorithm auditory pitch group energy calculation take 1/450 of original algorithm's and excitation calculation take 1/3.57. In conclusion, the proposed algorithm is expected to be implemented into DSP-based real-time loudness meter.

An Item-based Collaborative Filtering Technique by Associative Relation Clustering in Personalized Recommender Systems (개인화 추천 시스템에서 연관 관계 군집에 의한 아이템 기반의 협력적 필터링 기술)

  • 정경용;김진현;정헌만;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.467-477
    • /
    • 2004
  • While recommender systems were used by a few E-commerce sites former days, they are now becoming serious business tools that are re-shaping the world of I-commerce. And collaborative filtering has been a very successful recommendation technique in both research and practice. But there are two problems in personalized recommender systems, it is First-Rating problem and Sparsity problem. In this paper, we solve these problems using the associative relation clustering and “Lift” of association rules. We produce “Lift” between items using user's rating data. And we apply Threshold by -cut to the association between items. To make an efficiency of associative relation cluster higher, we use not only the existing Hypergraph Clique Clustering algorithm but also the suggested Split Cluster method. If the cluster is completed, we calculate a similarity iten in each inner cluster. And the index is saved in the database for the fast access. We apply the creating index to predict the preference for new items. To estimate the Performance, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

A Predictive Algorithm using 2-way Collaborative Filtering for Recommender Systems (추천 시스템을 위한 2-way 협동적 필터링 방법을 이용한 예측 알고리즘)

  • Park, Ji-Sun;Kim, Taek-Hun;Ryu, Young-Suk;Yang, Sung-Bong
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.9
    • /
    • pp.669-675
    • /
    • 2002
  • In recent years most of personalized recommender systems in electronic commerce utilize collaborative filtering algorithm in order to recommend more appropriate items. User-based collaborative filtering is based on the ratings of other users who have similar preferences to a user in order to predict the rating of an item that the user hasn't seen yet. This nay decrease the accuracy of prediction because the similarity between two users is computed with respect to the two users and only when an item has been rated by the users. In item-based collaborative filtering, the preference of an item is predicted based on the similarity between the item and each of other items that have rated by users. This method, however, uses the ratings of users who are not the neighbors of a user for computing the similarity between a pair of items. Hence item-based collaborative filtering may degrade the accuracy of a recommender system. In this paper, we present a new approach that a user's neighborhood is used when we compute the similarity between the items in traditional item-based collaborative filtering in order to compensate the weak points of the current item-based collaborative filtering and to improve the prediction accuracy. We empirically evaluate the accuracy of our approach to compare with several different collaborative filtering approaches using the EachMovie collaborative filtering data set. The experimental results show that our approach provides better quality in prediction and recommendation list than other collaborative filtering approaches.