• Title/Summary/Keyword: interestingness

Search Result 46, Processing Time 0.028 seconds

  • Han, Cheon-Woo;Hwang, Su-Young;So, Yeon-Hee;Lee, Myung-Jin;Lim, Ka-Ram;Lee, Woo-Gul;Lee, Sun-Young;Back, Sun-Hee;Woo, Yeon-Kyoung;Yoon, Mi-Sun;Kim, Sung-Il
    • 한국HCI학회:학술대회논문집
    • /
    • 2006.02a
    • /
    • pp.893-901
    • /
    • 2006
  • The major limitation of the traditional Intelligent Tutoring Systems (ITS) is that interface is mainly focused on the cognitive factors. However, the new direction of ITS is shifting form the cognitive perspectives to the motivational perspectives reflecting the individual differences. In this study, the specific design guidelines for motivational interface of ITS are proposed to promote learner's motivation to learn during the interaction with the ITS. First, ITS should be able to reflect individual differences in cognitive abilities, interest and motivation, and ongoing changes of the interestingness and comprehensibility during learning activities. Second, it is essential for ITS to guarantee learner controllability, diverse learning activities, curiosity, self-relevance, and challenge to enhance the level of motivation and situational interest. Third, the game-like properties are also needed to maximize the motivational effect of learning with ITS.

  • PDF

A Measure for Improvement in Quality of Association Rules in the Item Response Dataset (문항 응답 데이터에서 문항간 연관규칙의 질적 향상을 위한 도구 개발)

  • Kwak, Eun-Young;Kim, Hyeoncheol
    • The Journal of Korean Association of Computer Education
    • /
    • v.10 no.3
    • /
    • pp.1-8
    • /
    • 2007
  • In this paper, we introduce a new measure called surprisal that estimates the informativeness of transactional instances and attributes in the item response dataset and improve the quality of association rules. In order to this, we set artificial dataset and eliminate noisy and uninformative data using the surprisal first, and then generate association rules between items. And we compare the association rules from the dataset after surprisal-based pruning with support-based pruning and original dataset unpruned. Experimental result that the surprisal-based pruning improves quality of association rules in question item response datasets significantly.

  • PDF

Frequent Pattern Mining By using a Completeness for BigData (빅데이터에 대한 Completeness를 이용한 빈발 패턴 마이닝)

  • Park, In-Kyu
    • Journal of Korea Game Society
    • /
    • v.18 no.2
    • /
    • pp.121-130
    • /
    • 2018
  • Most of those studies use frequency, the number of times a pattern appears in a transaction database, as the key measure for pattern interestingness. It prerequisites that any interesting pattern should occupy a maximum portion of the transactions it appears. But in our real world scenarios the completeness of any pattern is more likely to become various in transactions. Hence, we should also consider the problem of finding the qualified patterns with the significant values of the weighted support by completeness in order to reduce the loss of information within any pattern in transaction. In these pattern recommendation applications, patterns with higher completeness may lead to higher recall while patterns with higher completeness may lead to higher recall while patterns with higher frequency lead to higher precision. In this paper, we propose a measure of weighted support and completeness and an algorithm WSCFPM(weigted support and completeness frequent pattern mining). Our algorithm handles the invalidation of the monotone or anti-monotone property which does not hold on completeness. Extensive performance analysis show that our algorithm is very efficient and scalable for word pattern mining.

The Characteristic of Reward in Computer Assisted Learning

  • Yeon, Eun-Mo;Lee, Sun-Young;Chung, Yoon-Kyung;Cho, Eun-Soo;Kwon, Soon-Goo;Jeon, Hun;Lee, Kye-Hyeng;Yoon, Sung-Hyun;So, Yeon-Hee;Kim, Sung-Il
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02b
    • /
    • pp.64-70
    • /
    • 2008
  • Computer Assisted Learning (CAL) is quite different from in many aspects. CAL provides individualistic learning environment and facilitates autonomy of the learner. Thus the learners who uses CAL program has more sense of control and engages in more strategic learning than conventional learning environment. In this experiment, we used KORI (KORea university intelligent agent) which is a new type of ITS adopting TA (Teachable Agent) that fosters learning by teaching, So, we investigated the critical motivational factor that have influences in CAL learning and the effects of reward in CAL are another area of our interest. Thus, we divided two conditions that presence of reward and absence of reward. The 174 elementary school students(5th) were participated and they are randomly assigned the one of the reward conditions. Before entering the experimental instruction, all participants measured about metacognition, self-efficacy and goal orientation questionnaire as independent variables. Then, Participants were instructed of method of using KORI program and asked to study for ten days with KORI program at least 20 minutes everyday in their home, about 10 days. After 10 days, they were rated interest and comprehension. Regression results suggest that regardless of the presence of reward, metacognition is a positive predictor in interestingness. It indicate that metacognitive skills are required in CAL learning situation irrespective of reward. But on comprehension in the absence of reward, only self- efficacy appeared to be a positive predictor. In the presence of reward, performance goal orientation showed as a negative predictor of comprehension, whereas self-efficacy was a positive predictor. This result suggest that presence of reward especially interferes learning process of performance goal orientation in CAL learning situation. It could be interpreted that reward interferes the learning process of performance goal orientation by debilitating intrinsic motivation.

  • PDF

Generally non-linear regression model containing standardized lift for association number estimation (연관성 규칙 수의 추정을 위한 일반적인 비선형 회귀모형에서의 표준화 향상도 활용 방안)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.27 no.3
    • /
    • pp.629-638
    • /
    • 2016
  • Among data mining techniques, the association rule is one of the most used in the real fields because it clearly displays the relationship between two or more items in large databases by quantifying the relationship between the items. There are three primary quality measures for association rule; support, confidence, and lift. We evaluate association rules using these measures. The approach taken in the previous literatures as to estimation of association rule number has been one of a determination function method or a regression modeling approach. In this paper, we proposed a few of non-linear regression equations useful in estimating the number of rules and also evaluated the estimated association rules using the quality measures. Furthermore we assessed their usefulness as compared to conventional regression models using the values of regression coefficients, F statistics, adjusted coefficients of determination and variation inflation factor.

Comparison of confidence measures useful for classification model building (분류 모형 구축에 유용한 신뢰도 측도 간의 비교)

  • Park, Hee Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.2
    • /
    • pp.365-371
    • /
    • 2014
  • Association rule of the well-studied techniques in data mining is the exploratory data analysis for understanding the relevance among the items in a huge database. This method has been used to find the relationship between each set of items based on the interestingness measures such as support, confidence, lift, similarity measures, etc. By typical association rule technique, we generate association rule that satisfy minimum support and confidence values. Support and confidence are the most frequently used, but they have the drawback that they can not determine the direction of the association because they have always positive values. In this paper, we compared support, basic confidence, and three kinds of confidence measures useful for classification model building to overcome this problem. The result confirmed that the causal confirmed confidence was the best confidence in view of the association mining because it showed more precisely the direction of association.

A Viewer Preference Model Based on Physiological Feedback (CogTV를 위한 생체신호기반 시청자 선호도 모델)

  • Park, Tae-Suh;Kim, Byoung-Hee;Zhang, Byoung-Tak
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.3
    • /
    • pp.316-322
    • /
    • 2014
  • A movie recommendation system is proposed to learn a preference model of a viewer by using multimodal features of a video content and their evoked implicit responses of the viewer in synchronized manner. In this system, facial expression, body posture, and physiological signals are measured to estimate the affective states of the viewer, in accordance with the stimuli consisting of low-level and affective features from video, audio, and text streams. Experimental results show that it is possible to predict arousal response, which is measured by electrodermal activity, of a viewer from auditory and text features in a video stimuli, for estimating interestingness on the video.

The proposition of attributably pure confidence in association rule mining (연관 규칙 마이닝에서 기여 순수 신뢰도의 제안)

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.2
    • /
    • pp.235-243
    • /
    • 2011
  • The most widely used data mining technique is to explore association rules. This technique has been used to find the relationship between each set of items based on the association thresholds such as support, confidence, lift, etc. There are many interestingness measures as the criteria for evaluating association rules. Among them, confidence is the most frequently used, but it has the drawback that it can not determine the direction of the association. The net confidence measure was developed to compensate for this drawback, but it is useless in the case that the value of positive confidence is the same as that of negative confidence. This paper propose a attributably pure confidence to evaluate association rules and then describe some properties for a proposed measure. The comparative studies with confidence, net confidence, and attributably pure confidence are shown by numerical example. The results show that the attributably pure confidence is better than confidence or net confidence.

Proposition of negatively pure association rule threshold (음의 순수 연관성 규칙 평가 기준의 제안)

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.2
    • /
    • pp.179-188
    • /
    • 2011
  • Association rule represents the relationship between items in a massive database by quantifying their relationship, and is used most frequently in data mining techniques. In general, association rule technique generates the rule, 'If A, then B.', whereas negative association rule technique generates the rule, 'If A, then not B.', or 'If not A, then B.'. We can determine whether we promote other products in addition to promote its products only if we add negative association rules to existing association rules. In this paper, we proposed the negatively pure association rules by negatively pure support, negatively pure confidence, and negatively pure lift to overcome the problems faced by negative association rule technique. In checking the usefulness of this technique through numerical examples, we could find the direction of association by the sign of the negatively pure association rule measure.

A Study On Analysis of Interestingness for Web-pages (웹페이지 관심도 분석에 관한 연구)

  • Kim, Chang-Geun;Jung, Youn-Hong;Kim, Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.687-695
    • /
    • 2007
  • There has been increasing of using Internet shopping mall like an e-business, and it means that the analysis technique of appetence for webpase visitors logging into the case of analyzing the degree of concern and using them in the personalization has been absolutely advanced. For heavy web pages, it is impossible to use click-stream based analysis in analyzing interest for each area by what kind of information the visitors are interested in to. A web browser of a limited size has difficulty in expressing on a screen information about what they want, or what hey are looking for. Pagescrolling is used to overcome such a limitation in expression. In this study, a analyzing system of degree of concern for Webpage is presented, designed and implemented using page scrolling to track the position of the scroll bar and movements of the window cursor regularly within a window browser for real-time transfer to analyze user's interest by using information received from the analysis of the visual perception area of the web page.