• Title/Summary/Keyword: Rule Items

Search Result 246, Processing Time 0.025 seconds

Elementary School Students Development of a Scale to Measure the Outdoor School Safety Behavior in Elementary Students (초등학생 실외 학교생활 위험행위 측정도구 개발)

  • Park Kyung Min
    • Journal of Korean Public Health Nursing
    • /
    • v.17 no.1
    • /
    • pp.113-121
    • /
    • 2003
  • Purpose : This study was performed to develop a scale of outdoor school safety behavior in Korean elementary students. Methods : A list of 40 items were selected by priori experiences of school health teachers and a literature review. For evaluation of the appropriateness of the 32 items, questionnaires were reviewed by an expert group which was consisted of 10 professionals. Validity of the 31 items was screened in this process with 4 point Likert scale. Using the preliminary tool. data were collected from 684 subjects for item analysis and factor analysis. A total of 26 items were remained, and items with the lower than 0.2 item-total correlation coefficient were removed. Factor analysis was done with these 26 items, and 26 items with factor loadings higher or equal to 0.4 were remained. Relsult : 1. Cronbach's alpha for the 26 items was 0.70 2. Five factors were identified with eigen value 1.0 These contributed $51.617\%$ of the variance in the total score. 3. Each factor was labled 'vonobserbance of safety rule', 'good habit for safety', 'careless action', 'lack of safety knowledge', 'injurious action to friend' It is suggested that this scale could be used to measure outdoor school safety behaviors among elementary students in Korea.

  • PDF

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.

Association rule thresholds of similarity measures considering negative co-occurrence frequencies (동시 비 발생 빈도를 고려한 유사성 측도의 연관성 규칙 평가 기준 활용 방안)

  • Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.6
    • /
    • pp.1113-1121
    • /
    • 2011
  • Recently, a variety of data mining techniques has been applied in various fields like healthcare, insurance, and internet shopping mall. Association rule mining is a popular and well researched method for discovering interesting relations among large set of data items. Association rule mining is the method to quantify the relationship between each set of items in very huge database based on the association thresholds. There are three primary quality measures for association rules; support and confidence and lift. In this paper we consider some similarity measures with negative co-occurrence frequencies which is widely used in cluster analysis or multi-dimensional analysis as association thresholds. The comparative studies with support, confidence and some similarity measures are shown by numerical example.

An Effective Reduction of Association Rules using a T-Algorithm (T-알고리즘을 이용한 연관규칙의 효과적인 감축)

  • Park, Jin-Hee;Chung, Hwan-Mook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.2
    • /
    • pp.285-290
    • /
    • 2009
  • An association rule mining has been studied to find hidden data pattern in data mining. A realization of fast processing method have became a big issue because it treated a great number of transaction data. The time which is derived by association rule finding method geometrically increase according to a number of item included data. Accordingly, the process to reduce the number of rules is necessarily needed. We propose the T-algorithm that is efficient rule reduction algorithm. The T-algorithm can reduce effectively the number of association rules. Because that the T-algorithm compares transaction data item with binary format. And improves a support and a confidence between items. The performance of the proposed T-algorithm is evaluated from a simulation.

A study on insignificant rules discovery in association rule mining (연관성규칙에서 의미 없는 규칙의 발견에 관한 연구)

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.1
    • /
    • pp.81-88
    • /
    • 2011
  • Association rule mining searches for interesting relationships among items in a given database. There are three primary quality measures for association rule, support and confidence and lift. In order to improve the efficiency of existing mining algorithms, constraints were applied during the mining process to generate only those association rules that are interesting to users instead of all the association rules. When we create relation rule, we can often find a lot of rules. This can find rule that direct relativity by intervening variable does not exist. In this study we try to discovery an insignificant rule in association rules by intervening variable. Result of this study can understand relativity about rule that is created in relation rule more exactly.

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.

Association Rule Mining Considering Strategic Importance (전략적 중요도를 고려한 연관규칙 탐사)

  • Choi, Doug-Won;Shin, Jin-Gyu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.443-446
    • /
    • 2007
  • A new association rule mining algorithm, which reflects the strategic importance of associative relationships between items, was developed and presented in this paper. This algorithm exploits the basic framework of Apriori procedures and TSAA(transitive support association Apriori) procedure developed by Hyun and Choi in evaluating non-frequent itemsets. The algorithm considers the strategic importance(weight) of feature variables in the association rule mining process. Sample feature variables of strategic importance include: profitability, marketing value, customer satisfaction, and frequency. A database with 730 transaction data set of a large scale discount store was used to compare and verify the performance of the presented algorithm against the existing Apriori and TSAA algorithms. The result clearly indicated that the new algorithm produced substantially different association itemsets according to the weights assigned to the strategic feature variables.

  • PDF

Finding Negative Association Rules in Implicit Knowledge Domain (함축적 지식 영역에서 부 연관규칙의 발견)

  • Park, Yang-Jae
    • The Journal of Information Technology
    • /
    • v.9 no.3
    • /
    • pp.27-32
    • /
    • 2006
  • If is interested and create rule between it in item that association rules buys, by negative association rules is interested to item that do not buy, it is attempt to do data Maining more effectively. It is difficult that existent methods to find negative association rules find one part of rule, or negative association rules because use more complicated algorithm than algorithm that find association rules. Therefore, this paper presents method to create negative association rules by simpler process using Boolean Analyzer that use dependency between items. And as Boolean Analyzer through an experiment, show that can find negative association rules and more various rule through comparison with other algorithm.

  • PDF

A Study for Antecedent Association Rules

  • Cho, Kwang-Hyun;Park, Hee-Chang
    • 한국데이터정보과학회:학술대회논문집
    • /
    • 2006.11a
    • /
    • pp.51-57
    • /
    • 2006
  • Association rule mining searches for interesting relationships among Items in a given database. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary quality measures for association rule support and confidence and lift. In this paper we present association rule mining based antecedent variables. We call these rules to antecedent association rules. An antecedent variable is a variable that occurs before the independent variable and the dependent variable. For example, in politics, a special interest group may want to support a politician who backs their cause. The group would look for a candidate who supports their views and support his election. Once in office, the politician would then conduct policy that supports the interest group.

  • PDF

A Research on Utilization of KDC Based on Literary Warrant (문헌적 근거에 기반한 한국십진분류법(KDC) 활용현황에 대한 연구)

  • Kim, Sungwon
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.55 no.2
    • /
    • pp.25-50
    • /
    • 2021
  • General-purpose classification scheme encompasses all subject areas, While the whole classification scheme is constructed by library studies experts, structure and preparation of each specific subject area's classification should be referenced to that specific subject. In order for the whole system to be practical and useful classification scheme, not just a simple collection of each subject area's scheme, it is necessary to set the rule for properly distributing the amount of classification items, and the collections assigned to these items. The rule to set the distribution of items based on the amount of document collections is called 'literary warrant'. This study examines actual status of assignment of each classification items to information resources, as a result of application of Korean Decimal Classification, and then suggests a way to improve these practices.