• 대한산업공학회지
• /
• 제27권1호
• /
• pp.30-36
• /
• 2001

We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

• Genomics & Informatics
• /
• 제10권1호
• /
• pp.51-57
• /
• 2012

Mining interesting patterns from DNA sequences is one of the most challenging tasks in bioinformatics and computational biology. Maximal contiguous frequent patterns are preferable for expressing the function and structure of DNA sequences and hence can capture the common data characteristics among related sequences. Biologists are interested in finding frequent orderly arrangements of motifs that are responsible for similar expression of a group of genes. In order to reduce mining time and complexity, however, most existing sequence mining algorithms either focus on finding short DNA sequences or require explicit specification of sequence lengths in advance. The challenge is to find longer sequences without specifying sequence lengths in advance. In this paper, we propose an efficient approach to mining maximal contiguous frequent patterns from large DNA sequence datasets. The experimental results show that our proposed approach is memory-efficient and mines maximal contiguous frequent patterns within a reasonable time.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2008년도 추계 학술논문 발표대회
• /
• pp.181-186
• /
• 2008

The purpose of this study is analyzing the frequent defect about each inspection part of Pre-qualification of residential building reconstruction and finding the cause of occurrence so that can supply a solution of the problem during the plalnning and constructure. The frequent defects are naturally following the deterioration and more occur in the structure body than a skin. The meaning that supply the cause and the managing method for preventing frequent defects about each inspection part is as follows. To prevent the defects, it is needed that the choice of the appropriate materials, giving a sufficient space for facilities, reliable constructure for the part of expecting the defects. The quality of life will go up due to making a good dwelling environment and extending the life cycle of structures from the inspection and managing the part of expecting defects.

• Journal of Information Processing Systems
• /
• 제17권1호
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• 정보처리학회논문지D
• /
• 제11D권7호
• /
• pp.1357-1366
• /
• 2004

웹에서 효율적인 정보 관리와 데이터 교환을 위해 XML의 중요성이 증가함에 따라 XML의 구조 통합과 구조 검색에 대한 연구가 진행되고 있다. 구조가 정의되어 있는 XML 문서의 구조 검색은 스키마 또는 DTD를 통해 가능하다 그러나 DTD나 스키마가 정의되어 있지 않은 XML 문서에 대한 검색은 기존의 검색 방법을 적용할 수 없다. 그러므로 이 논문에서는 구조 정보가 주어지지 않은 많은 양의 XML 문서를 대상으로 구조를 빠르게 검색하기 위한 기반 연구로써 새로운 클러스터링 기법을 제안한다. 먼저 각 문서로부터 빈발한 구조의 특성을 추출한다. 그리고 추출된 빈발 구조를 문서의 대표 구조로 하여 유사 구조기반의 클러스터링을 수행한다. 이것은 서로 다른 구조의 전체 문서를 대상으로 검색하는 것보다 신속하게 구조 검색을 할 수 있도록 한다. 또한 유사한 구조들로 그룹화되어 있는 클러스터들을 기반으로 XML 문서에 대한 구조 검색을 수행한다. 아울러 구조 검색의 적용 방법을 기술하고, 그에 대한 결과의 예를 보여 제안 기법의 효율성을 증명한다.

• 정보처리학회논문지D
• /
• 제14D권1호
• /
• pp.1-8
• /
• 2007

발달된 인터넷 환경과 데이터 교환 표준 언어로서 확정되고 있는 XML을 기반으로 하여 대량의 웹 문서들이 생산되면서 정보 추출의 대상은 자연스럽게 웹 문서로 이동하게 되었다. 이에 따라 급속히 증가하고 있는 XML 문서에 대한 구조, 통합 및 검색을 위한 연구들이 있다. 이 논문에서는 XML 문서들에 대한 질의 처리, 검색 등을 효율적으로 처리하기 위한 기반으로써 빈발구조 중심의 XML 문서를 클러스터링 하는 방법을 제안한다. 첫째 XML 문서를 트리 구조로 표현하여 분리하고 분리된 구조들을 대상으로 빈발하게 발생하는 구조들을 추출한다. 둘째 각 XML 문서에서 추출된 빈발 구조들을 트랜잭션의 항목으로 취급하여 클러스터링을 수행한다. 클러스터링을 수행할 때 각 클러스터의 생성 및 생성된 전체 클러스터의 응집도를 함께 고려하는 주요항목 가중치를 이용한다. 셋째 기존연구와의 비교 실험을 통해 제안하는 방법의 우수성을 증명한다.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.1478-1485
• /
• 2011

이 기술은 지하철 역사 특성상 천정판 개방이 수반되는 보수공사와 각종점검이 수시로 이루어지고 있는 바, 잦은 탈 부착으로 천정판이 쉽게 탈락 및 훼손되어 역사 유지관리에 어려움이 발생되고 있는 문제를 해결하기 위해 천정판의 설치 방법을 고정방식에서 탈피하여, 일부분을 미닫이 방식으로 개폐할 수 있도록 설치함으로서 천정판의 탈 부착으로 인한 훼손을 방지하고 내구성을 증대시켜 역사 천정판 교체공사 주기를 연장시키고 이에 따른 유지관리 비용 절감 효과가 있는 천정판 시공방법을 제시코자 함.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권11호
• /
• pp.5287-5303
• /
• 2018

Handling vast amount of data found in large transactional datasets is an obvious challenge for the conventional data mining algorithms. Addressing this challenge, our paper proposes a parallel approach for proper decomposition of mining problem into sub-problems in order to find frequent patterns from these datasets. The proposed, Pattern Mining for Large Distributed Dataset (PMLDD) approach, ensures minimum dependencies as well as minimum communications among sub-problems. It establishes a linear aggregation of the intermediate results so that it can be adapted to large-scale programming models like MapReduce. In this context, an algorithmic structure for MapReduce programming model is presented. PMLDD guarantees an efficient load balancing among the sub-problems by a specific selection criterion. Further, it optimizes the number of required iterations over the dataset for mining frequent patterns as compared to the existing approaches. Finally, we believe that our approach is scalable enough to handle larger datasets in terms of performance evaluation, and the result analysis justifies all these mentioned concerns.

• 재무관리연구
• /
• 제25권3호
• /
• pp.155-173
• /
• 2008

Controlling for the impacts of main strands of debt maturity theories, we highlight the relationship between syndicated loan maturity and ownership structure of Korean borrowers. We find that as the ownership of large shareholders increases, the maturity of syndicated loans also increases. Additionally, we identify a negative relation between foreigners' ownership and loan maturity, indicating that foreign institutional investors serve valuable monitoring functions; as their equity shares increase, they fully take advantage of frequent renewals through the short maturity of syndicated loan. We also show that the predicted value of leverage is more systematically and positively related to the maturity of syndicated loan.

• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제48권7호
• /
• pp.384-390
• /
• 1999

This paper describes a new ac-to-dc power converter using a multilevel converter. A conventional multilevel ac-to-dc converter has large output dc filter capacitors. When a short circuit happens in a load, the stored energy in the capacitors should be discharged through the load with a high short circuit current. The high current may cause considerable damage to the capacitors and the load. The output dc capacitors of the proposed converter do not discharge even under load short circuit condition. In the case of a load short circuit, the capacitors become a floating state immediately and remain in the state. Then the stored capacitor energy is supplied to the load again as soon as the short circuit has been cleared. Therefore, the rising time of the load voltage can be significantly reduced. This feature satisfies the requirement of a power supply for a load with frequent short circuits. The proposed converter has the characteristics of a simplified structure, a reduced cost, weight, and volume compared with conventional power supplies with frequent output short circuits. Experimental results are presented to verify the usefulness of the proposed converter.