• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.385-390
• /
• 2005

Set constraints logic language is a language that adopts `set theory` in programming. In this paper, we introduce the procedure for solving set constraints proposed by A. Dovier and show how the procedure can be implemented in logic language Prolog. The procedure is represented in `rewriting rules` and this representation is characterized by having nondeterministic rule applicationsand mathematical variables that is difficult to be implemented in general programming languages. In this paper, we show that the representation can be easily implemented by using nondeterministic control, logical variables and data structure `list` provided in Prolog. Our implementation has following advantages.First we have implemented the full features of the language. Second we have described the implementation detail in thisresearch. Third other used the commercial Prolog called SICStus, but we are using CIAO Prolog with GNU GPL(General Public License) and anyone can use it freely. Forth the software of our implementation is open source so anyone can use, modify, and distribute it freely.

• Journal of Internet of Things and Convergence
• /
• v.9 no.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 Data and Information Science Society
• /
• v.16 no.3
• /
• pp.529-538
• /
• 2005

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are association rules, decision tree, clustering, neural network and so on. Association rule mining searches for interesting relationships among items in a riven large data set. 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. We analyze Gyeongnam social indicator survey data using association rule technique for environmental information discovery. We can use to environmental preservation and environmental improvement by association rule outputs.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.431-434
• /
• 2001

Knowledge discovery in databases(KDD) is the process for extracting valid, novel, potentially useful and understandable knowledge form real data. There are many academic and industrial activities with new technologies and application areas. Particularly, data mining is the core step in the KDD process, consisting of many algorithms to perform clustering, pattern recognition and rule induction functions. The main goal of these algorithms is prediction and description. Prediction means the assessment of unknown variables. Description is concerned with providing understandable results in a compatible format to human users. We introduce an efficient data mining algorithm considering predictive and descriptive capability. Reasonable pattern is derived from real world data by a revised neural network model and a proposed fuzzy rule extraction technique is applied to obtain understandable knowledge. The proposed neural network model is a hierarchical self-organizing system. The rule base is compatible to decision makers perception because the generated fuzzy rule set reflects the human information process. Results from real world application are analyzed to evaluate the system\`s performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1991.11a
• /
• pp.121-125
• /
• 1991

In order to minimize fixing error of workpieces, prismatic and cylindrical types. Modification Rule by Indexing Table and Modification Rule by NC Program are developed for machining centers by using touch trigger probes. The Modification Rule by Indexing Table means the alignment of workpiece to NC program through degree of freedoms of indexing table. The Modification Rule by NC Program is the alignment of NC program to workpiece set-up condition via the generation of NC program. A postprocessing module is also developed for generating NC-part Program (User Macro) to compensate for Machining errors in end milling and boring processes. Developed methods are verified by experiments.

• 한국데이터정보과학회:학술대회논문집
• /
• 2004.10a
• /
• pp.115-124
• /
• 2004

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are association rules, decision tree, clustering, neural network and so on. Association rule mining searches for interesting relationships among items in a given large data set. 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. We analyze Gyeongnam social indicator survey data using association rule technique for environmental information discovery. We can use to environmental preservation and environmental improvement by association rule outputs.

• IE interfaces
• /
• v.11 no.1
• /
• pp.119-129
• /
• 1998

The relative importance of Logistics in steelworks industry is rather higher among other business activities. The objective of the paper is to propose the methodology for real-time vehicle scheduling for scrap disposal in the steelworks industry. Currently, the rule necessary to assign vehicles to a specific job is strictly fixed. The paper adopts the multi-pass rule selector (MPRS) that suggests a promising rule used for vehicle dispatching for a period of time. The MPRS is regularly invoked if necessary and then evaluates a set of rule candidates to select the best rule with respect to the system performance criteria. The experiment shows that the proposed approach outperforms the current single-pass strategy.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.10a
• /
• pp.177-188
• /
• 2005

Association rule mining searches for interesting relationships among items in a given large data set. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.1
• /
• pp.149-160
• /
• 2006

Association rule mining searches for interesting relationships among items in a given large data set. Association rules are frequently used by retail stores to assist in marketing, advertising, floor placement, and inventory control. There are three primary threshold measures in association rule; support and confidence and lift. In the case of appling real world to association rules, we have some difficulties in data interpretation because we obtain many rules. In this paper, we develop the model of association rules using latent variables for environmental survey data.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.1254-1263
• /
• 1993

Representing knowledge uncertainty , aggregating evidence confidences , and propagation uncertainties are three key elements that effect the ability of a rule-based expert system to represent domains with uncertainty . Fuzzy set theory provide a good mathematical tool for representing the vagueness associated with a variable when , as the condition of a rule , it only partially corresponds to the input data. However, the aggregation of ANDed and Ored confidences is not as simple as the intersection and union operators defined for fuzzy set membership. There is, in fact, a certain degree of compensation that occurs when an expert aggregates confidences associated with compound evidence . Further, expert often consider individual evidences to be varying importance , or weight , in their support for a conclusion. This paper presents a flexible approach for evaluating evidence and conclusion confidences. Evidences may be represented as fuzzy or nonfuzzy variables with as associat d degree of certainty . different weight can also be associated degree of certainty. Different weights can also be assigned to the individual condition in determining the confidence of compound evidence . Conclusion confidence is calculated using a modified approach combining the evidence confidence and a rule strength. The techniques developed offer a flexible framework for representing knowledge and propagating uncertainties. This framework has the potention to reflect human aggregation of uncertain information more accurately than simple minimum and maximum operator do.