scholarly journals Experimental results on a constraint based sequential pattern mining for telecommunication alarm data

Author(s):  
Jain-Zhi Ouh ◽  
Pei-Hsin Wu ◽  
Ming-Syan Chen
2011 ◽  
Vol 109 ◽  
pp. 729-733
Author(s):  
Jiang Yin ◽  
Yun Li ◽  
Cen Cheng Shen ◽  
Bo Liu

Multi-Relational Sequential mining is one of the areas of data mining that rapidly developed in recent years. However, the performance issues of traditional mining methods are not ideal. To effectively mining the pattern, we proposed an algorithm based on Iceberg concept lattice, adopting optimization methods of partition and merger to just mining the frequent sequences. Experimental results show this algorithm effectively reduced the time complexity of multi-relational sequential pattern mining.


2011 ◽  
Vol 63-64 ◽  
pp. 425-430
Author(s):  
Jun Wang ◽  
Ya Qiong Jiang

Pattern growth approach is an important method in sequential pattern mining. Projection database based on the method is introduced in PrefixSpan, and the PrefixSpan algorithm can solve the problem of mining sequential patterns. But relative to large projection database, the performance of PrefixSpan is affected. Inspired by the prefix-divide method and MH structure, this paper proposed a new algorithm MHSP for sequential pattern mining. Based on the real datasets, experimental results show that the performance of MHSP algorithm is more than twice as fast as PrefixSpan.


2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Xiangzhan Yu ◽  
Zhaoxin Zhang ◽  
Haining Yu ◽  
Feng Jiang ◽  
Wen Ji

The original sequential pattern mining model only considers occurrence frequencies of sequential patterns, disregarding their occurrence periodicity. We propose an asynchronous periodic sequential pattern mining model to discover the sequential patterns that not only occur frequently but also appear periodically. For this mining model, we propose a pattern-growth mining algorithm to mine asynchronous periodic sequential patterns with multiple minimum item supports. This algorithm employs a divide-and-conquer strategy to mine asynchronous periodic sequential patterns in a depth-first manner recursively. We describe the process of algorithm realization and demonstrate the efficiency and stability of the algorithm through experimental results.


2012 ◽  
Vol 2 (4) ◽  
Author(s):  
Aloysius George ◽  
D. Binu

AbstractDiscovering sequential patterns is a rather well-studied area in data mining and has been found many diverse applications, such as basket analysis, telecommunications, etc. In this article, we propose an efficient algorithm that incorporates constraints and promotion-based marketing scenarios for the mining of valuable sequential patterns. Incorporating specific constraints into the sequential mining process has enabled the discovery of more user-centered patterns. We move one step ahead and integrate three significant marketing scenarios for mining promotion-oriented sequential patterns. The promotion-based market scenarios considered in the proposed research are 1) product Downturn, 2) product Revision and 3) product Launch (DRL). Each of these scenarios is characterized by distinct item and adjacency constraints. We have developed a novel DRL-PrefixSpan algorithm (tailored form of the PrefixSpan) for mining all length DRL patterns. The proposed algorithm has been validated on synthetic sequential databases. The experimental results demonstrate the effectiveness of incorporating the promotion-based marketing scenarios in the sequential pattern mining process.


Sign in / Sign up

Export Citation Format

Share Document