• 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.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2007.02a
• /
• pp.61-71
• /
• 2007

The Association Rules is the most important method in technology of the data mining. This text further study The Association Rules, has analyzed and commented to Apriori algorithm of The Association Rules. Have realized Apriori algorithm base on Visual Basic 6.0, probe into Apriori algorithm application among the digital library, show with experimental data of application of Association Rules in borrow in the data analysis in readers finally.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.5
• /
• pp.493-498
• /
• 2019

This study deals with the analysis of the technology association rules between CPC codes of the Internet of Things(IoT) patent, the core of the Fourth Industrial Revolution ICT-based technology. The association rules between CPC codes were extracted using R, an open source for data mining. To this end, we analyzed 369 of the 605 patents related to the Internet of Things filed with the Patent Office until July 2019, with a complex CPC code, up to the subclass-level. As a result of the technology association rules, CPC codes with high support were [H04W ${\rightarrow}$ H04L](18.2%), [H04L ${\rightarrow}$ H04W](18.2%), [G06Q ${\rightarrow}$ H04L](17.3%), [H04L ${\rightarrow}$ G06Q](17.3%), [H04W ${\rightarrow}$ G06Q](9.8%), [G06Q ${\rightarrow}$ H04W](9.8%), [G06F ${\rightarrow}$ H04L](7.9%), [H04L ${\rightarrow}$ G06F](7.9%), [G06F ${\rightarrow}$ G06Q](6.2%), [G06Q ${\rightarrow}$ G06F](6.2%). After analyzing the technology interconnection network, the core CPC codes related to technology association rules are G06Q and H04L. The results of this study can be used to predict future patent trends.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.1-17
• /
• 2008

Data mining is defined as the process of discovering meaningful and useful pattern in large volumes of data. In particular, finding associations rules between items in a database of customer transactions has become an important thing. Some data structures and algorithms had been proposed for storing meaningful information compressed from an original database to find frequent itemsets since Apriori algorithm. Though existing method find all association rules, we must have a lot of process to analyze association rules because there are too many rules. In this paper, we propose a new data structure, called a Frequent Pattern Network (FPN), which represents items as vertices and 2-itemsets as edges of the network. In order to utilize FPN, We constitute FPN using item's frequency. And then we use a clustering method to group the vertices on the network into clusters so that the intracluster similarity is maximized and the intercluster similarity is minimized. We generate association rules based on clusters. Our experiments showed accuracy of clustering items on the network using confidence, correlation and edge weight similarity methods. And We generated association rules using clusters and compare traditional and our method. From the results, the confidence similarity had a strong influence than others on the frequent pattern network. And FPN had a flexibility to minimum support value.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.1
• /
• pp.77-83
• /
• 2010

In this paper, we proposed new outworn aircraft management procedure. ROKAF has both good management skill and information system, AMMIS, regarding aircraft maintenance based on all kinds of aircraft's defects. To optimize and secure aircraft's operation, management of the outworn aircraft is very important for ROKAF. With respect to these outworn aircraft's defects and maintenance, we analyzed defects occurrence pattern of outworn aircraft by using AMMIS data and Market Basket Analysis, and found the specified association rules for each defect. By using these association rules, we developed new management procedure for outworn aircraft based on the results of affinity analysis. The management procedure in this paper will also be used to optimal operation and maintenance of other aircraft and weapon systems.

• Journal of Arbitration Studies
• /
• v.33 no.2
• /
• pp.109-137
• /
• 2023

This paper reviews legal framework, characteristics and main contents of the 'Optional Rules for the Arbitration of Disputes Relating to Outer Space Activity' enacted by the Permanent Court of Arbitration (PCA) in 2011. Space activities, which began in the 1950s, are undergoing significant changes according to the international characteristics and development of science and technology. New Space and the space business will be the key factors driving these changes. However, the diversity of disputes caused by New Space space activities and the characteristics of each type of dispute must be considered together. This is because the space business can be maintained and developed by securing the effectiveness of dispute resolution. This paper identifies that the PCA Space Dispute Arbitration Rules have important legislative and policy significance in this respect. Specifically, in this paper, the international space law system, the draft convention of the International Law Association, and the PCA arbitration rules were introduced in an overview of the international dispute settlement system related to space activities. Afterwards, it examines that the systematic structure and some major contents of the PCA Space Dispute Arbitration Rules in detail. Based on this, the paper suggests some points of application of the PCA Arbitration Rules and the legislative policy implications.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.161-164
• /
• 2005

Data mining techniques can be applied to identify patterns of interest in the gene expression data. One goal in mining gene expression data is to determine how the expression of any particular gene might affect the expression of other genes. To find relationships between different genes, association rules have been applied to gene expression data set [1]. A notable limitation of association rule mining method is that only the association in a single profile experiment can be detected. It cannot be used to find rules across different condition profiles or different time point profile experiments. However, with the appearance of time-series microarray data, it became possible to analyze the temporal relationship between genes. In this paper, we analyze the time-series microarray gene expression data to extract the sequential patterns which are similar to the association rules between genes among different time points in the yeast cell cycle. The sequential patterns found in our work can catch the associations between different genes which express or repress at diverse time points. We have applied sequential pattern mining method to time-series microarray gene expression data and discovered a number of sequential patterns from two groups of genes (test, control) and more sequential patterns have been discovered from test group (same CO term group) than from the control group (different GO term group). This result can be a support for the potential of sequential patterns which is capable of catching the biologically meaningful association between genes.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.74-78
• /
• 2009

Efficient reasoning has become important for improving the performance of ontology systems as the size of ontology grows. In this paper, we introduce a method that efficiently performs reasoning of RDFS entailment rules (i.e., rdfs7 and rdfs9 rules) and OWL inverse rule using views in the DBMS-based triple sotre. Reasoning is performed by replacing reasoning rules with the corresponding view definition and storing RDF triples into the structured triple tables. When processing queries, the views is referred instead of original tables. In this way, we can reduce the time needed for reasoning and also obtain the space-efficiency of the triple store.

• The Safety technology
• /
• no.192
• /
• pp.48-49
• /
• 2013

• The Safety technology
• /
• no.187
• /
• pp.48-49
• /
• 2013