Earticle

The application of the information and communication technologies (ICTs) towards sound solid waste management (SWM) is a challenging research area. This study is aimed at identifying evolving technological trends, competitor’s distribution and technological convergence pattern between ICTs and SWM technology. A total of 1041 patents’ applications that were submitted to Korean Intellectual Property Office (KIPO) from 1996 to 2016 were investigated as a dataset. Convergence patterns were obtained by applying the association rules of the International Patent Classification (IPC) codes. The results show some related technological fields where convergence technologies are mostly adopted and can contribute to establishing the development strategies of the ICTs - SWM technology in Korea.

PM (Inconsistency Pattern Modeling) is a hybrid supervised learning technique using the inconsistence pattern of input variables in mining data sets. The IPM tries to improve prediction accuracy by combining more than two different supervised learning methods. The previous related studies have shown that the IPM was superior to the single usage of an existing supervised learning methods such as neural networks, decision tree induction, logistic regression and so on, and it was also superior to the existing combined model methods such as Bagging, Boosting, and Stacking. The objectives of this paper is explore the characteristics of the IPM. To understand characteristics of the IPM, three experiments were performed. In these experiments, there are high performance improvements when the prediction inconsistency ratio between two different supervised learning techniques is high and the distance among supervised learning methods on MDS (Multi-Dimensional Scaling) map is long.

As the use of semantic web based on XML increases in the field of data management, a lot of studies to extract useful information from the data stored in ontology have been tried based on association rule mining. Ontology data is advantageous in that data can be freely expressed because it has a flexible and scalable structure unlike a conventional database having a predefined structure. On the contrary, it is difficult to find frequent patterns in a uniformized analysis method. The goal of this study is to provide a basis for extracting useful knowledge from ontology by searching for frequently occurring subgraph patterns by applying transaction-based graph mining techniques to ontology schema graph data and instance graph data constituting ontology. In order to overcome the structural limitations of the existing ontology mining, the frequent pattern search methodology in this study uses the methodology used in graph mining to apply the frequent pattern in the graph data structure to the ontology by applying iterative node chunking method. Our suggested methodology will play an important role in knowledge extraction.

근래에는 경제운전에 대한 중요성이 점차 부각되고 있어 운전자의 운전 행태나 성향을 자동으로 분석한 후 경제운전을 위한 방법을 운전자에게 알려줄 수 있는 연구가 필요하다. 본 논문에서는 이를 위해 차량에 대한 운행일시, 운행거리, 운행시간, 주행속도, 공회전시간, 급가속/급감속 횟수, 연료소모량 등의 운행정보를 수집하였고, 데이터마이닝을 이용하여 운전자의 운행패턴이 경제운전에 어떤 영향을 미칠 수 있는지 분석하였다. 본 연구 결과는 주행 중 운전자에게 지속적으로 공회전과 과속 정보, 급가속/급감속 횟수를 차량 단말에 표현하여 제공하고, 공회전과 과속 비율이 일정 임계치를 초과할 경우 경고 정보를 제공함으로써 경제운전에 악영향을 미칠 수 있는 운전 습관을 미리 예방할 수 있는 방안에 활용할 수 있다.

Recently, as the importance of Economical Driving has been gradually growing up, the needs for research on automatic analysis of driving patterns that will ultimately provide drivers the methods for Economical Driving have been increasingly risen. Based on this purpose, we have executed two things in this paper. First, we have collected overall driving information such as date, distance, driving time, speed, idle time, sudden acceleration/deceleration count, and the amount of fuel consumption. Second, we have analyzed the influences of driving patterns on economical driving by employing the data mining techniques. These results can be applied in preventing bad driving patterns which will have consequently bad effects on Economical Driving in two aspects: by presenting some information on the terminal of the vehicles such as idle time, over-speed time, sudden acceleration/deceleration count continuously and by providing the drivers with alert information when the idle time ratio and the over-speed time ratio are excessive.

빈발 아이템셋 마이닝은 데이터셋으로부터 유용한 정보를 추출하는 데 사용되는 마이닝기법이다. 일반적인 빈 발 아이템셋 마이닝은 모든 아이템이 같은 중요도를 갖는다는 것을 전제로 마이닝을 수행하므로 불필요한 아이템셋 을 포함할 수 있다. 하이 유틸리티 아이템셋 마이닝은 아이템의 수량과 이익을 함께 고려하는 유틸리티를 이용하여 마이닝한다. 본 논문에서 우리는 하이 유틸리티 아이템셋을 효율적으로 탐사하기 위해 비트맵과 유틸리티-리스트를 이용한다. 비트맵은 아이템셋의 조인 연산비용을 줄이기 위해 사용되고, 유틸리티-리스트는 아이템셋의 확장 가능성 을 체크하기 위해 사용된다. 실험결과에서 제안 알고리즘이 기존의 알고리즘보다 실행 속도에서 우수한 성능을 나타 내고, 특히 조인되는 아이템셋이 많을 때 더 효율적이라는 것을 보여준다.

Frequent itemset mining is a mining technique used to extract useful information from datasets. General frequent itemset mining may contain unnecessary itemsets by performing mining on the premise that all items have the same importance. High utility itemset mining uses itemset utility that consider the quantity and profit of items together. In this paper, we use bitmap and utility-lists to efficiently explore high-utility itemsets. Bitmap is used to reduce the cost of join operation of itemsets, and utility-list is used to determine whether the itemsets can be expanded. Experimental results show that the proposed algorithm outperforms the existing algorithm in running time and is especially efficient when there are many itemsets to be joined.

Periodic pattern mining has gained a great attention in the past decade. Previous studies mostly focus on synchronous periodic patterns. The literature proposes many methods for mining periodic patterns. Nevertheless, asynchronous periodic pattern mining has gradually received more attention recently. In this paper, we propose an efficient 2-D linked structure and the OEOP (One Event One Pattern) algorithm to discover all kinds of valid segments in each single event sequence. Then, referring to the general model of asynchronous periodic pattern mining proposed by Huang and Chang, this study combines these valid segments found by OEOP into 1-patterns with multiple events, multiple patterns with multiple events and asynchronous periodic patterns. The experimental results show that these algorithms have good performance and scalability.

Research on periodic pattern mining has gained a great attention in the past decade. Periodic pattern mining discovers valid periodic patterns in a time-related dataset. This study proposed an efficient 2-D linked structure and the OEOP (One Event One Pattern) algorithm to discover all kinds of valid segments in each single event sequence. Then, this study combines these valid segments found by OEOP into 1-patterns with multiple events, and multiple patterns with multiple events periodic patterns. The experimental results show that the proposed algorithm has good performance and scalability.

This paper proposes a new weighted mining frequent pattern based on customer’s RFM(Recency, Frequency, Monetary) score for personalized u-commerce recommendation system under ubiquitous computing. An existing recommendation system using traditional mining has the problem, such as delay of processing speed from a cause of frequent scanning a large data, considering equal weight value of every item, and accuracy as well. In this paper, to solve these problems, it is necessary for us to extract the most frequently purchased data from whole data, to consider the weight/importance of attribute of item in order to forecast frequently changing trends by emphasizing the important items with high purchasability and to improve the accuracy of personalized u-commerce recommendation. To verify improved performance, we make experiments with dataset collected in a cosmetic internet shopping mall.

In the last few years, RFID is commonly used in many related fields of new service application and new study as one of the significant technological advancements, such as science manufacturing, logistics transportation, traffic management, medical information, and so on. Those intelligent and automatic innovative products gradually take the place of manpower. Due to low cost and remote automatic identification advantages, RFID technology seems to be a popular current trend. In RFID database, there is a vast number of RFID trajectory data with the spatial-temporal characteristic. How to extract the traveling partners from these data is a difficult problem. For solving the difficult problem, we proposed an algorithm called MTP to discovery the traveling partners from RFID database, it uses a intersecting method to mine moving objects with moving together in a period of time. Meanwhile, we analyze the performance of MTP, the result of our experiment demonstrate that the MTP algorithm is suited to mine the traveling partners.

The extraction of similar features based on quality is called pattern discovery to the huge number of terms, phrases and noise. Identifying the better pattern discovery is the major problem to extract the accurate information from the text documents because of the noise and unwanted data present in the text documents. In this paper, pattern discovery is used to find the frequent item sets and reducing the noise from text documents and implement the advanced pattern discovery approach. In this paper, for implementation we use .txt files with unstructured data to find the efficient patterns.

A plethora of big data applications are emerging and being researched in the computer science community which require online classification and pattern recognition of huge data pools collected from sensor networks, image and video systems, online forum platforms, medical agencies etc. However, as an NP hard issue data mining techniques are facing with lots of difficulties. To deal with the hardship, we conduct research on the novel algorithm for data mining and knowledge discovery through network entropy. We firstly introduce necessary data analysis techniques such as support vector machine, neural network and decision tree methods. Later, we analyze the organizational structure of network graphical pattern with the knowledge of machine learning methodology and graph theory. Eventually, our modified method is finalized with decision and validation implementation. The simulation results of our approach on different databases show the feasibility and effectiveness of our proposed framework. As the final part, we provide our conclusion and prospect.

현존하는 빈발 패턴 마이닝 방법은 대부분 시간 효율성을 목표로 하고, 물리적 메모리 사용에 매우 의존적이다. 하지만 빅데이터 시대가 도래함에 따라 실제 세상의 데이터베이스는 급속도로 증가하고 있으며, 그에 따라 기존의 방법으로 현실적인 거대한 양의 데이터를 마이닝하기에 물리적 메모리 공간이 부족한 실정이다. 이러한 문제를 해결하기 위해, 빈발 패턴 마이닝의 메모리 의존성을 줄이기 위한 보조저장장치 기반의 연구들이 진행되었으나, 메모리 기반의 방법들에 비해 처리 시간이 너무 많이 소비된다는 한계가 있었다. 따라서 확장성을 가지며, 기존의 디스크 기반의 방법들에 비해 시간효율성을 높인 새로운 빈발 패턴 마이닝이 필요하게 되었다. 본 논문에서는 빅데이터로부터 빈도 아이템 집합들을 마이닝하기 위해 메모리와 디스크를 함께 사용하는 스택 기반의 새로운 접근법인 PPFP 알고리즘을 제안하였다. PPFP는 빈발 패턴 마이닝 접근법 중 가장 인기 있고 효율적인 접근법 중 하나인 FP-growth를 기반으로 하고 있다. PPFP 마이닝 방법은 다음과 같이 두 단계로 진행된다. (1) IFP-tree 구축: FP-tree를 생성한 후, 새로운 인덱스 번호 부여 방법으로 FP-tree의 각 노드에 인덱스 번호를 부여하고, 이 인덱스 번호가 부여된 FP-tree(IFP-tree)를 테이블로 변환하여(IFP-table) 디스크에 저장한다. (2) PPFP 알고리즘을 이용한 빈발 패턴 마이닝: 스택 기반의 PUSH-POP 방식으로 패턴을 확장시켜 나가며 빈발 패턴을 마이닝한다. 이러한 방식을 통해 메모리 기반의 방법에 비해 반복적으로 많은 시간이 소모되는 연산에 매우 적은 양의 메모리를 활용하여 확장성과 함께 시간효율성 또한 향상시킬 수 있었다. 그리고 기존의 연구 방법들과 비교 실험을 통해 새로운 알고리즘의 성능을 증명하였다.

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

In this paper, we offer a new technique to discover frequent spatiotemporal patterns from a moving object database. Though the search space for spatiotemporal knowledge is extremely challenging, imposing spatial and timing constraints on moving sequences makes the computation feasible. The proposed technique includes two algorithms, AllMOP and MaxMOP, to find all frequent patterns and maximal patterns, respectively. In addition, to support the service provider in sending information to a user in a push-driven manner, we propose a rule-based location prediction technique to predict the future location of the user. The idea is to employ the algorithm AllMOP to discover the frequent movement patterns in the user's historical movements, from which frequent movement rules are generated. These rules are then used to estimate the future location of the user. The performance is assessed with respect to precision and recall. The proposed techniques could be quite efficiently applied in a location-based service (LBS) system in which diverse types of data are integrated to support a variety of LBSs.

Moving pattern is as a kind of sequential pattern, which can be extracted from the large volume of location history data. This sort of knowledge is very useful in supporting intelligence to the LBS or GIS. In this paper, we proposed the continuous moving pattern mining approach in LBS platform and LBS Miner. The location updates of moving objects affect the set of the rules maintained. In our approach, we use the validity thresholds that indicate the next time to invoke the incremental pattern mining. The mining system will play a major role in supporting the various LBS solutions.

침입탐지란 컴퓨터와 네트워크 자원에 대한 유해한 침입 행동을 식별하고 대응하는 과정이다. 점차적으로 시스템에 대한 침입의 유형들이 복잡해지고 전문적으로 이루어지면서 빠르고 정확한 대응을 필요로 하는 시스템이 요구되고 있다. 이에 대용량의 데이터를 분석하여 의미 있는 정보를 추출하는 데이터 마이닝 기법을 적용하여 지능적이고 자동화된 탐지 및 경보데이터 분석에 이용할 수 있다. 마이닝 기법중의 하나인 순차 패턴 탐사 방법은 일정한 시퀸스 내의 빈발한 항목을 추출하여 순차적으로 패턴을 탐사하는 방법이며 이를 이용하여 시퀸스의 행동을 예측하거나 기술할 수 있는 규칙들을 생성할 수 있다. 이 논문에서는 대량의 경보 데이터를 효율적으로 분석하고 반복적인 공격 패턴에 능동적인 대응을 위한 방법으로 확장된 순차패턴 알고리즘인 PrefixSpan 알고리즘에 대해 제안하였고 이를 적용하므로써 침입탐지 시스템의 자동화 및 성능의 향상을 얻을 수 있다.

Sequential pattern mining has become an essential task with broad applications. Most sequential pattern mining algorithms use a minimum support threshold to prune the combinatorial search space. This strategy provides basic pruning; however, it cannot mine correlated sequential patterns with similar support and/or weight levels. If the minimum support is low, many spurious patterns having items with different support levels are found; if the minimum support is high, meaningful sequential patterns with low support levels may be missed. We present a new algorithm, weighted interesting sequential (WIS) pattern mining based on a pattern growth method in which new measures, sequential s-confidence and w-confidence, are suggested. Using these measures, weighted interesting sequential patterns with similar levels of support and/or weight are mined. The WIS algorithm gives a balance between the measures of support and weight, and considers correlation between items within sequential patterns. A performance analysis shows that WIS is efficient and scalable in weighted sequential pattern mining.

In this paper, in order to identify and recognize attack patterns, we propose a Bayesian classification using frequent patterns. In theory, Bayesian classifiers guarantee the minimum error rate compared to all other classifiers. However, in practice this is not always the case owing to inaccuracies in the unrealistic assumption{ class conditional independence) made for its use. Our method addresses the problem of attribute dependence by discovering frequent patterns. It generates frequent patterns using an efficient FP-growth approach. Since the volume of patterns produced can be large, we propose a pruning technique for selection only interesting patterns. Also, this method estimates the probability of a new case using different product approximations, where each product approximation assumes different independence of the attributes. Our experiments show that the proposed classifier achieves higher accuracy and is more efficient than other classifiers.

Aiming at the field of e-commerce, this paper analyzes e-commerce user behavior based on the data characteristics of e-commerce back-end logs and constructs a user behavior mining model. On the basis of Web user behavior theory, it analyzes user behavior based on interactive content. Based on the background of big data, the traditional data mining algorithm is further optimized, which greatly improves the operating efficiency of the algorithm. At the same time, a distributed file storage structure is adopted to improve the fault tolerance of system data processing. This paper studies the advantages and disadvantages of collaborative filtering recommendation algorithms. The Web user behavior mining system constructed in this paper can conduct multi-dimensional and efficient mining. It helps e-commerce merchants and content providers to understand their users and achieve better commercial value through precise marketing and accurate recommendations, and complete the upgrade of data-driven services.

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.

Sequential Pattern Mining is the mining approach which addresses the problem of discovering the existent maximal frequent sequences in a given databases. In the daily and scientific life, sequential data are available and used everywhere based on their representative forms as text, weather data, satellite data streams, business transactions, telecommunications records, experimental runs, DNA sequences, histories of medical records, etc. Discovering sequential patterns can assist user or scientist on predicting coming activities, interpreting recurring phenomena or extracting similarities. For the sake of that purpose, the core of sequential pattern mining is finding the frequent sequence which is contained frequently in all data sequences. Beside the discovery of frequent itemsets, sequential pattern mining requires the arrangement of those itemsets in sequences and the discovery of which of those are frequent. So before mining sequences, the main task is checking if one sequence is a subsequence of another sequence in the database. In this paper, we implement the subsequence matching method as the preprocessing step for sequential pattern mining. Matched sequences in our implementation are the normalized sequences as the form of number chain. The result which is given by this method is the review of matching information between input mapped sequences.