• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.205-213
• /
• 2010

This study uses the FP-tree algorithm, one of the mining techniques. This study is an attempt to suggest a new recommended system using a modified FP-tree algorithm which yields an association rule based on frequent 2-itemsets extracted from the transaction database. The modified recommended system consists of a pre-processing module, a learning module, a recommendation module and an evaluation module. The study first makes an assessment of the modified recommended system with respect to the precision rate, recall rate, F-measure, success rate, and recommending time. Then, the efficiency of the system is compared against other recommended systems utilizing the sequential pattern mining. When compared with other recommended systems utilizing the sequential pattern mining, the modified recommended system exhibits 5 times more efficiency in learning, and 20% improvement in the recommending capacity. This result proves that the modified system has more validity than recommended systems utilizing the sequential pattern mining.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1093-1102
• /
• 2003

As the use of internet is growing, the amount of information is increasing rapidly and XML that is a standard of the web data has the property of flexibility of data representation. Therefore electronic document systems based on web, such as EDMS (Electronic Document Management System), ebXML (e-business extensible Markup Language), have been adopting XML as the method for exchange and standard of documents. So research on the method which can manage and search structural XML documents in an effective wav is required. In this paper we propose the clustering method based on structural similarity among the many XML documents, using typical structures extracted from each document by sequential pattern mining in pre-clustering process. The proposed algorithm improves the accuracy of clustering by computing cost considering cluster cohesion and inter-cluster similarity.

• Journal of the Korea Convergence Society
• /
• v.10 no.2
• /
• pp.217-225
• /
• 2019

The Latent Growth Modeling(LGM) is known as the typical analysis method of longitudinal data and it could be classified into unconditional model and conditional model. It is common to assume that the growth trajectory of unconditional model of LGM is linear. In the case of quasi-linear, the methodology for improving the model fitness using Sequential Pattern of Association Rule Mining is suggested. To do this, we divide longitudinal data into quintiles and extract periodic changes of the longitudinal data in each quintiles and make sequential pattern based on this periodic changes. To evaluate the effectiveness, the LGM module in SPSS AMOS was used and the dataset of the Youth Panel from 2001 to 2006 of Korea Employment Information Service. Our methodology was able to increase the fitness of the model compared to the simple linear growth trajectory.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.6
• /
• pp.194-210
• /
• 2022

The user-centered EV charging infrastructure construction policy the government is aiming for can increase convenience for electric vehicle users and bring new electric vehicle users into the market. This study was conducted to provide an in-depth understanding of the charging behaviors of actual electric vehicle users, which can be used as basic information for the electric vehicle charging infrastructure. Based on charging diary data collected for a week, the charging of electric vehicles was analyzed on a daily and weekly basis, and sequence analysis and latent class analysis were used. As a result, five daily charging profiles and four weekly charging profiles were identified, which are expected to contribute to revitalizing the electric vehicle market by providing key information for decision-making by potential electric vehicle users as well for establishing user-centered charging infrastructure policies in the future.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.25-27
• /
• 2004

대용량 웹 데이터베이스로부터 필요한 관련 정보를 탐색하고, 다양한 형태의 정보로부터 지식을 창출하는 일은 매우 어려운 일이다. 본 논문은 복잡하고 다양한 형태의 패턴이 존재하고, 연속된 입력을 갖는 웹 데이터베이스에서 발생되는 빈발 패턴들을 효과적으로 저장할 수 있는 FP-Tree를 기반으로 하여 변화된 정보들을 능동적으로 유지하고 새로운 정보들에 U해 FP-Tree를 재구성하여 웹 페이지에 대한 유용한 패턴 정보와 사용자의 웹 사용 패턴 분석을 용이하게 한다. 그 결과 새로이 발견된 웹 사용 패턴들을 통해 웹 페이지의 구조적 정보와 구조적 연판 정보를 효과적으로 얻을 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.6
• /
• pp.2021-2029
• /
• 2010

This paper suggested the method to design and analyze FMC robot's dispatching rule using the Simulation and Sequential Patterns. To do this, first of all, we built FMC using simulation and then, extracted signals that facilities call a robot, saved it as the log type. Secondly, we built robot's optimal path using the Sequential Pattern Mining with the results of analyzing the log and relationship between machine and robot actions. Lastly, we adapted it to the A corp.'s manufacturing line for verifying its performance. As a result of applying the new dispatching rule in FMC, total throughput and total flow time decrease because of decreasing material loss time and increasing robot utility. Furthermore, because this method can be applied for every manufacturing plant using simulation, it can contribute to advance total FMC efficiency as well.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.89-104
• /
• 2007

This research attempts to give a personalized recommendation framework in large-sized music contents environment. Despite of existing studios and commercial contents for recommendation systems, large online shopping malls are still looking for a recommendation system that can serve personalized recommendation and handle large data in real-time. This research utilizes data mining technologies and new pattern matching algorithm. A clustering technique is used to get dynamic user segmentations using user preference to contents categories. Then a sequential pattern mining technique is used to extract contents access patterns in the user segmentations. And the recommendation is given by our recommendation algorithm using user contents preference history and contents access patterns of the segment. In the framework, preprocessing and data transformation and transition are implemented on DBMS. The proposed system is implemented to show that the framework is feasible. In the experiment using real-world large data, personalized recommendation is given in almost real-time and shows acceptable correctness.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.478-480
• /
• 1998

설계 문제의 추상화와 특정 영역의 일반적인 해결에 대한 정보 표현 및 구성요소 상호 간의 관련성을 효과적으로 나타내는 설계 패턴과 공통 도메인 응용 구축에서 자동화된 아키텍쳐를 생성하는 프레임워크의 사용은 WWW상에서 활용으로 더욱 가치를 높이고 있다. 또한 각 정보가 연관성에 따라 상호 연결되어 있어서 비순차적인 접근을 통해 데이터의 종류에 관계없이 저장, 관리가 편리한 하이퍼미디어 응용이 크게 활용되고 있다. 따라서 본 논문에서는 하이퍼미디어 응용 구축에 적용될 수 있는 패턴들을 식별하고 응용을 구성하는 객체와 이들 간의 관련성을 네비게이션이 가능한 노드와 링크로의 재구조화를 지원하기 위한 자사용 요소로서 설계 패턴을 제공하는 프레임워크를 제시함으로써 프레임 워크 및 생성 응용의 아키택쳐에서 패턴 재사용을 통한 생산성을 향상하고자 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.63-65
• /
• 2007

본 연구에서는 비디오 영상데이터로부터 인간의 행동패턴의 인식기술 및 상황인식 기법을 소개하고 이를 활용한 실용적 응용으로서 지능형 감시시스템을 제안한다. 순차적 영상신호에서 형태기반의 정적 특징과 목표물의 움직임 요소를 측정한 동적 특징을 결합한 형태의 특징 표현 및 추출기법과 행동패턴 및 상황패턴에 대한 인식 모델을 제시하고 구현한다. 모듈구조의 시스템에서 영상처리 모듈과 패턴인식 모듈은 특징추출 및 인식과정을 수행하며, 감시영상에 대한 상황판단 기능은 데이터베이스 모듈과 연동하여 효과적인 검색기능과 경보기능 등을 지원한다. 이러한 기능은 기존의 시스템에서 운영자의 지속적인 감시작업과 상황판단 작업을 보조 또는 대행하여 수행할 수 있을 뿐만 아니라 데이터저장 공간을 획기적으로 줄이고 부수적으로 효율적인 영상의 조회기능 및 추적기능 등의 유용한 인터페이스를 지원한다.