• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.265-276
• /
• 1997

There have been many studies on efficient discovery of association rules in large databases. However, it is nontrivial to maintain such discovered rules in large databases because a database may allow frequent or occasional updates and such updates may not only invalidate some existing strong association rules but also turn some weak rules into strong ones. The major idea of updating algorithm is to resuse the information of the old large itemsets and to integrate the support information of the new large itemsets in order to substantially reduce the pool of candidate sets to be re-exmained. In this paper, an updating algorithm is proposed for efficient maintenance of discovered assocation rules when new transaction data are added to a transaction database. And superiority of the proposed updating algorithm will be shown by comparing with FUP algorithm that was already proposed.

• 정보처리학회논문지:소프트웨어 및 데이터공학
• /
• 제8권10호
• /
• pp.391-396
• /
• 2019

다양한 하드웨어의 발전으로 영상처리를 이용한 연구가 활발하게 진행되고 있다. 예를 들어 차량에 의한 각종 범죄를 예방하기 위해 기존에 설치된 CCTV를 이용하여 실시간으로 범죄 차량의 위치를 탐색하여 단속하는 방법이 있다. 그러나 특정 시스템과 높은 시스템 요구 사항으로 인해 기존 장비들에 적용하기 어려운 문제점 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 기존 장비들에서도 차량의 탐지를 수행할 수 있도록 한국 표준 차량 번호판 정보를 파일 데이터베이스로 구성하고, 특정 차량에 대한 정보를 빠르게 탐색할 수 있는 탐색 알고리즘을 제안하였다. 본고에서 제안한 파일 데이터베이스와 탐색 알고리즘의 성능 평가를 위해 다양한 위치에 탐색 대상을 설정하고 실험한 결과 탐색 알고리즘은 항상 특정 시간 안에 차량을 탐색하여 정보를 확인할 수 있었다.

• 한국컴퓨터정보학회논문지
• /
• 제6권2호
• /
• pp.1-7
• /
• 2001

데이터베이스의 발달은 데이터 보안에 대한 새로운 인식과 필요성으로 정보의 보호와 데이터베이스의 효율적인 관리 및 데이터에 대한 연산들로 구성된 트랜잭션 관리가 필요로 하다. 사용자가 데이터에 접근할 때 사용자의 보안인가와 데이터의 보안 등급에 의해서 트랜잭션 동시성이 제어된다. 그래서 기존의 보안 알고리즘은 비밀 경로를 제거하는 부분에 초점을 맞추었기 때문에 하위 등급 트랜잭션에 의해 상위등급 트랜잭션의 수행이 반복적으로 지연되는 상위 등급 트랜잭션의 직렬성을 만족시키지 못하는 문제가 발생하였다. 따라서 본 논문에서는 트랜잭션의 직렬성 위배 문제를 방지하여 상위 트랜잭션 재수행 및 지연에 의한 자원 낭비를 막고 동시성 제어의 효율을 높이는 알고리즘을 제시한다.

• 정보처리학회논문지D
• /
• 제11D권3호
• /
• pp.545-552
• /
• 2004

데이터마이닝 기법중의 하나인 연관규칙 탐사는 데이터베이스상에서 빈번하게 나타나는 데이터들 중 서로 연관성이 강한 데이터들을 탐색대상으로 한다. 그러나. 빈번하게 나타나지 않는 희소한 데이터들이라 할 지라도 가중치가 높은 중요한 데이터이면서 서로 연관성이 강할 경우 비즈니스정보로서 중요한 가치가 있다. 본 논문에서는 데이터베이스 상에서 희소하게 나타나지만 중요한 의미를 갖고 또한 서로 연관성이 높은 데이터들을 탐사할 수 있는 연관규칙 탐사 알고리즘을 제안한다. 제안한 알고리즘의 성능을 시뮬레이션을 통하여 평가한 결과 희소하면서도 중요한 데이터를 사이의 연간규칙을 효율적으로 탐사함을 알 수 없었다

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 춘계 학술대회 학술발표 논문집
• /
• pp.247-250
• /
• 2003

Due to the increasing use of very large databases, mining useful information and implicit knowledge from databases is evolving. However, most conventional data mining algorithms identify the relationship among features using binary values (TRUE/FALSE or 0/1) and find simple If-THEN rules at a single concept level. Therefore, implicit knowledge and causal relationships among features are commonly seen in real-world database and applications. In this paper, we thus introduce the mechanism of mining fuzzy association rules and constructing causal knowledge base form database. Acausal knowledge base construction algorithm based on Fuzzy Cognitive Map(FCM) and Srikant and Agrawal's association rule extraction method were proposed for extracting implicit causal knowledge from database. Fuzzy association rules are well suited for the thinking of human subjects and will help to increase the flexibility for supporting users in making decisions or designing the fuzzy systems. It integrates fuzzy set concept and causal knowledge-based data mining technologies to achieve this purpose. The proposed mechanism consists of three phases: First, adaptation of the fuzzy membership function to the database. Second, extraction of the fuzzy association rules using fuzzy input values. Third, building the causal knowledge base. A credit example is presented to illustrate a detailed process for finding the fuzzy association rules from a specified database, demonstration the effectiveness of the proposed algorithm.

• 정보보호학회논문지
• /
• 제6권3호
• /
• pp.41-56
• /
• 1996

WWW 환경에서 멀티미디어 정보 서비스를 제공하기 위해 사용되는 데이터베이스 서버는 데이터 베이스에 구축된 정보 서비스를 인가된 사용자가 안전하게 사용하도록 해주는 접근 통제 기법을 제공해야 한다. 본 논문에서는 바다-III 시스템의 객체지향 데이터베이스 서버에서 데이터의 적절한 접근통제를 시행하는 권한부여 모델과 권한부여 정책들을 정의하고, 사용자의 접근 권한을 평가하기 위한 알고리즘을 제안한다. 제안된 모델은 WWW 정보 서비스 환경을 고려하여, 데이터베이스 서비스 제공자가 구축한 데이터베이스를 쉽고 효율적으로 보호할 수 있는 구조를 제공한다.

• Journal of Welding and Joining
• /
• 제34권1호
• /
• pp.54-58
• /
• 2016

In this research paper, suggest method of generate same bead as an actual measurement data in virtual welding conditions, exploit morphology information of the bead that acquired through robot welding. It has many multiple risk factors to Beginners welding training, by we make possible to train welding in virtual reality, we can reduce welding training risk and welding material to exploit bead visualization algorithm that we suggest so it will be expected to achieve educational, environmental and economical effect. The proposed method is acquire data to each case performing robot welding by set the voltage, current, working angle, process angle, speed and arc length of welding condition value. As Welding condition value is most important thing in decide bead form, we would selected one of baseline each item and then acquired metal followed another factors change. Welding type is FCAW, SMAW and TIG. When welding trainee perform the training, it's difficult to save all of changed information into database likewise working angle, process angle, speed and arc length. So not saving data into database are applying the method to infer the form of bead using a neural network algorithm. The way of bead's visualization is applying the spline algorithm. To accurately represent Morphological information of the bead, requires much of morphological information, so it can occur problem to save into database that is why we using the spline algorithm. By applying the spline algorithm, it can make simplified data and generate accurate bead shape. Through the research paper, the shape of bead generated by the virtual reality was able to improve the accuracy when compared using the form of bead generated by the robot welding to using the morphological information of the bead generated through the robot welding. By express the accurate shape of bead and so can reduce the difference of the actual welding training and virtual welding, it was confirmed that it can be performed safety and high effective virtual welding education.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.438-441
• /
• 2007

Recently, due to molecular biology and engineering technology, DNA microarray makes people watch thousands of genes and the state of variation from the tissue samples of living body. With DNA Microarray, it is possible to construct a genetic group that has similar expression patterns and grasp the progress and variation of gene. This paper practices Cluster Analysis which purposes the discovery of biological subgroup or class by using gene expression information. Hence, the purpose of this paper is to predict a new class which is unknown, open leukaemia data are used for the experiment, and MCL (Markov CLustering) algorithm is applied as an analysis method. The MCL algorithm is based on probability and graph flow theory. MCL simulates random walks on a graph using Markov matrices to determine the transition probabilities among nodes of the graph. If you look at closely to the method, first, MCL algorithm should be applied after getting the distance by using Euclidean distance, then inflation and diagonal factors which are tuning modulus should be tuned, and finally the threshold using the average of each column should be gotten to distinguish one class from another class. Our method has improved the accuracy through using the threshold, namely the average of each column. Our experimental result shows about 70% of accuracy in average compared to the class that is known before. Also, for the comparison evaluation to other algorithm, the proposed method compared to and analyzed SOM (Self-Organizing Map) clustering algorithm which is divided into neural network and hierarchical clustering. The method shows the better result when compared to hierarchical clustering. In further study, it should be studied whether there will be a similar result when the parameter of inflation gotten from our experiment is applied to other gene expression data. We are also trying to make a systematic method to improve the accuracy by regulating the factors mentioned above.

• 산업기술연구
• /
• 제25권B호
• /
• pp.171-174
• /
• 2005

In this paper, we propose a new data encoding algorithm for a two-dimensional bar code system. In general, the one-dimensional bar code is just a key which can access detailed information to the host computer database. But the two-dimensional bar code is a new technology which can obtain high density information without access to the host computer database. We implemented the encoding algorithm for Data Matrix bar code which is the most widely used among the many kinds of two-dimensional bar codes in the field of marking using Digital Signal Processor (TMS320C31). The performance of the proposed algorithm is verified by comparing the imprinted symbols on the steel surfaces with the codes which are decoded by a bar code reader.

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

Moving objects are spatio-temporal data that change their location or shape continuously over time. Generally, if continuously moving objects are managed by a conventional database management system, the system cannot properly process the past and future location which is not stored in the database. Up to now, for the purpose of location tracking which is not stored, the linear interpolation to estimate the past location has been usually used. It is suitable for the moving objects on linear route, not curved route. In this paper, we propose a past location tracking algorithm for a moving object on curved routes, and also suggest a future location tracking algorithm using some past location information. We found that the proposed location tracking algorithm has higher accuracy than the linear interpolation function.