• The Journal of KAIRB
• /
• 제2권1호
• /
• pp.1-5
• /
• 2020

The U.S. Department of Health and Human Services and fifteen other Federal Departments and Agencies have issued final revisions to the Federal Policy for the Protection of Human Subjects (the Common Rule, 45 CFR 46, Subpart A). The Common Rule was initially promulgated in 1991 and amended in 2005. The Final Rule to update the current regulations was published in the Federal Register on 19 January 2017. The final compliance date of the revised Common Rule including the cooperative research requirement is effective on 20 January 2020 after twice to delay. The revised Common Rule aims to make more effective conduct of minimal risk research reflecting modern research activities and recognize evolving technologies, including mobile technologies, internet, and the growth in computing power. The revisions to the Common Rule were based on a variety of sources of public, stakeholder, and expert comments. The author summarized the key changes and the implications to Korean human research regulations.

• Journal of the Korean Data and Information Science Society
• /
• 제19권2호
• /
• pp.551-558
• /
• 2008

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. If there is many item in the association rule, much time is required. Xiong(2004) studies new method which is to compute the support of upper. They used support of upper to the $^{\theta}$. But $^{\theta}$ is subjective. In this paper, we present statistical objective criterion for efficiently identifying correlated pairs.

• Journal of the Korean Data and Information Science Society
• /
• 제19권3호
• /
• pp.903-911
• /
• 2008

Association rule mining searches for interesting relationships among items in a given large database. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. Many data is most quantitative data. There is a need for partitioning techniques to quantitative data. The partitioning process is referred to as binning. We introduce several binning methods ; parameter mean binning, equi-width binning, equi-depth binning, clustering-based binning. So we apply these binning methods to several distribution types of quantitative data and present the best binning method for association rule discovery.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 한국퍼지및지능시스템학회 2001년도 춘계학술대회 학술발표 논문집
• /
• pp.8-11
• /
• 2001

연관규칙 마이닝은 트랜잭션 데이터를 이루고 있는 항목간의 잠재적인 의존관계를 발견하는 데이터 마이닝의 한 분야이다. 정량 연관규칙이란 부류적 속성과 정량적 속성을 모두 포함한 연관규칙이다. 정량 연관규칙 마아닝을 위한 퍼지 기술의 응용, 정량 연관규칙 마이닝을 위한 일반화된 연관규칙 마이닝, 사용자의 관심도를 반영한 중요도 가중치가 있는 연관규칙 마이닝 등에 대한 연구가 이루어져 왔다. 이 논문에서는 중요도 가중치가 있는 일반화된 퍼지 정량 연관규칙 마이닝의 새로운 방법을 제안한다. 이 방법은 부류적 속성의 퍼지 개념 계층과 정량적 속성의 퍼지 언어항 일반화 계층을 일반화된 추출하기 위해 이용한다. 이것은 속성들의 수준별 일반화 계층과 속성의 중요도 가중치를 이용함으로써 사용자가 보다 융통성 있는 연관규칙을 마이닝할 수 있게 해준다.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2006년도 추계 학술발표회 논문집
• /
• pp.197-203
• /
• 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. If there is many item in the association rule, much time is required. Xiong(2004) studies new method which is to compute the support of upper. They used support of upper to the $\theta$. But $\theta$ is subjective. In this paper, we present statistical objective criterion for efficiently identifying correlated pairs.

• Journal of Internet of Things and Convergence
• /
• 제9권1호
• /
• pp.77-87
• /
• 2023

Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제19권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.

• Journal of the Korean Data and Information Science Society
• /
• 제23권4호
• /
• pp.717-725
• /
• 2012

Data mining is a method to find useful information for large amounts of data in database. One of the well-studied problems in data mining is exploration for association rules. Association rule mining searches for interesting relationships among items in a given database by support, confidence, and lift. If we use the existing association rules, we can commit some errors by information loss not to consider the size of occurrence frequency. In this paper, we proposed a new association rule thresholds considering the number of possible rules of interest items and compare with existing association rule thresholds by example and real data. As the results, the new association rule thresholds were more useful than existing thresholds.

• Journal of the Korean Data and Information Science Society
• /
• 제14권4호
• /
• pp.737-749
• /
• 2003

This Paper analyzed simultaneous activities of the time use survey by Korea National Statistical Office to use data mining's association rule. The survey of National Statistical Office in 1999 considered general analysis for main activities like that personal care(eating), employment and study, leisure, travel by purpose. But if we use the association rule, we can found the ratio of simultaneous activities at the same time. And also we can found the probability that another activities practise if we act one particular activity. Using this association rule of data mining we can do more developed and analytical sociological study.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 춘계학술대회
• /
• pp.159-170
• /
• 2003

This Paper analyzed simultaneous activities of the time use survey by Korea National Statistical Office to use data mining‘s association rule. The survey of National Statistical Office in 1999 considered general analysis for simultaneous activities. But if we use the association rule, we can found the ratio of particular activities at the same time. And we found the probability that another activities practise if we act one particular activity. Using this association rule of data mining we can do more developed and analytical sociological study.