• The Journal of Information Systems
• /
• v.15 no.4
• /
• pp.211-224
• /
• 2006

This study investigates the application of data mining techniques such as artificial neural networks, rough sets, and induction teaming to the intrusion detection systems. To maximize the effectiveness of data mining for intrusion detection systems, we introduced the asymmetric costs with false positive errors and false negative errors. And we present a method for intrusion detection systems to utilize the asymmetric costs of errors in data mining. The results of our empirical experiment show our intrusion detection model provides high accuracy in intrusion detection. In addition the approach using the asymmetric costs of errors in rough sets and neural networks is effective according to the change of threshold value. We found the threshold has most important role of intrusion detection model for decreasing the costs, which result from false negative errors.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.511-513
• /
• 2005

본 논문은 정답 색인 방법을 이용하여 응답 속도가 빠르고 정확한 백과사전 질의응답 시스템을 구현하는 방법을 제안한다. 논문에서 제안한 정답 색인 방법은 대상 문서에서 160여 개의 정답 유형 범주에 해당하는 정답 후보를 인식하고, 정답 후보와 색인 범주에 속하는 키워드를 색인단위로 정의하여 저장하였다. 특히 용언정보에 대해서는 LF(Logical Form)단위로 색인하여 색인 정확도를 높였다. 정답 랭킹에서는 사용자 질문에서 각 단어별로 문장 성분. 단어 가중치 정보 등을 이용하여, 필수단어를 산정하고 이를 정답랭킹의 방법으로 활용하였다. 이러한 방법론은 용언 정보를 활용해야 효과적인 백과사전이라는 문서 도메인의 특성을 반영하고, 빠른 질문 응답 시간을 보장하는 백과사전 질의응답 시스템에 적합하다.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.673-682
• /
• 2009

XML data are widely used for data representation and exchange on the Web and the data type is an continuous stream in ubiquitous environment. Therefore there are some mining researches related to the extracting of frequent structures and the efficient query processing of XML stream data. In this paper, we propose a mining method to extract frequent structures of XML stream data in recent window based on the sliding window. XML stream data are modeled as a tree set, called XFP_tree and we quickly extract the frequent structures over recent XML data in the XFP_tree.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.39-40
• /
• 2015

As international construction market increases, the importance of risk management in international construction project is emphasized. Unfortunately, current risk management practice does not sufficiently deal with project risks. Although a lot of risk analysis techniques have been introduced, most of them focus on project's external unexpected risks such as country conditions and owner's financial standing. However, because those external risks are difficult to manage and take preemptive action, we need to concentrate on project inherent risks. Based on this premise, this paper proposes a project-oriented risk mining approach which could detect and extract project risk factors automatically before they are materialized. This study presents a methodology regarding how to extract potential risks which exist in owner's project requirements and project tender documents using state of the art data analysis method such as text mining. The project-oriented risk mining approach is expected to effectively reflect project characteristics to the project risk management and could provide construction firms with valuable business intelligence.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.741-753
• /
• 2006

As the total amount of traffic data in network has been growing at an alarming rate, many researches to mine traffic data with the purpose of getting useful information are currently being performed. However, network users' privacy can be compromised during the mining process. In this paper, we propose an efficient and practical privacy preserving sequential pattern mining method on network traffic data. In order to discover frequent sequential patterns without violating privacy, our method uses the N-repository server model and the retention replacement technique. In addition, our method accelerates the overall mining process by maintaining the meta tables so as to quickly determine whether candidate patterns have ever occurred. The various experiments with real network traffic data revealed tile efficiency of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.197-206
• /
• 2012

A exisiting recommedation system using association rules has the problem, such as delay of processing speed from a cause of frequent scanning a large data, scalability and accuracy as well. In this paper, using a Implicit method which is not used user's profile for rating, we propose the personalized recommendation system which is a new method using the FP-tree mining based on RFM. It is necessary for us to keep the analysis of RFM method and FP-tree mining to be able to reflect attributes of customers and items based on the whole customers' data and purchased data in order to find the items with high purchasability. The proposed makes frequent items and creates association rule by using the FP-tree mining based on RFM without occurrence of candidate set. We can recommend the items with efficiency, are used to generate the recommendable item according to the basic threshold for association rules with support, confidence and lift. To estimate the performance, the proposed system is compared with existing system. As a result, it can be improved and evaluated according to the criteria of logicality through the experiment with dataset, collected in a cosmetic internet shopping mall.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.8
• /
• pp.1-7
• /
• 2022

With the development of artificial intelligence, efforts to incorporate neuroscience mining with AI have increased. Neuroscience mining, also known as NSM, expands on this concept by combining computational neuroscience and business analytics. Using fNIRS (functional near-infrared spectroscopy)-based experiment dataset, we have investigated the potential of NSM in the context of the BPSC (business problem-solving creativity) prediction. Although BPSC is regarded as an essential business differentiator and a difficult cognitive resource to imitate, measuring it is a challenging task. In the context of NSM, appropriate methods for assessing and predicting BPSC are still in their infancy. In this sense, we propose a novel NSM method that systematically combines CNN, BiLSTM, and attention network for the sake of enhancing the BPSC prediction performance significantly. We utilized a dataset containing over 150 thousand fNIRS-measured data points to evaluate the validity of our proposed NSM method. Empirical evidence demonstrates that the proposed NSM method reveals the most robust performance when compared to benchmarking methods.

• Ocean and Polar Research
• /
• v.36 no.4
• /
• pp.465-473
• /
• 2014

This paper proposes a formation control method by which multi-mining robots maintain a specified formation and follow a path. To secure the path tracking performance, a pure-pursuit algorithm is considered for each individual robot, and to minimize the deviation from the reference path, speed reduction in the steering motion is added. For the formation, in which two robots are parallel in a lateral direction, the robots track the specified path at a constant distance. In this way, the Leader-Follower method is adopted and the following robot knows the position and heading angle of the leader robot. Through the experimental test using two ground vehicle models, the performance is verified.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.377-382
• /
• 2005

This paper presents a new method for the attitude control of planar space robots. In order to control highly constrained non-linear system such as a 3D space robot, the analytical formulation for the system with complex dynamics and effective control methodology based on the formulation, are not always obtainable. In the proposed method, correspondingly, a non-analytical but effective self-organizing modeling method for controlling a highly constrained system is proposed based on a polynomial data mining algorithm. In order to control the attitude of a planar space robot, it is well known to require inputs characterized by a special pattern in time series with a non-deterministic length. In order to correspond to this type of control paradigm, we adopt the Model Predictive Control (MPC) scheme where the length of the non-deterministic horizon is determined based on implementation cost and control performance. The optimal solution to finding the size of the input pattern is found by a solving two-stage programming problem.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2002.05a
• /
• pp.225-231
• /
• 2002

A specialized web search engine is an internet tool for detecting information in finite cyber world. It helps to retrieve necessary information in internet sites quickly In this paper, we design and implement a prototype search engine using method of mining for the association rule discovery. It consists of a search engine part and a search robot part. The search engine uses keyword method and is considered as various user oriented interface. The search robot fetches information related to ship parts n world wide web. The experiments show that our search engine(AISE) is superior to other search engines in collecting necessary informations.