scholarly journals WMFP-Outlier: An Efficient Maximal Frequent-Pattern-Based Outlier Detection Approach for Weighted Data Streams

2019 ◽  
Vol 48 (4) ◽  
pp. 505-521 ◽  
Author(s):  
Saihua Cai ◽  
Qian Li ◽  
Sicong Li ◽  
Gang Yuan ◽  
Ruizhi Sun

Since outliers are the major factors that affect accuracy in data science, many outlier detection approaches have been proposed for effectively identifying the implicit outliers from static datasets, thereby improving the reliability of the data. In recent years, data streams have been the main form of data, and the data elements in a data stream are not always of equal importance. However, the existing outlier detection approaches do not consider the weight conditions; hence, these methods are not suitable for processing weighted data streams. In addition, the traditional pattern-based outlier detection approaches incur a high time cost in the outlier detection phase. Aiming at overcoming these problems, this paper proposes a two-phase pattern-based outlier detection approach, namely, WMFP-Outlier, for effectively detecting the implicit outliers from a weighted data stream, in which the maximal frequent patterns are used instead of the frequent patterns to accelerate the process of outlier detection. In the process of maximal frequent-pattern mining, the anti-monotonicity property and MFP-array structure are used to accelerate the mining operation. In the process of outlier detection, three deviation indices are designed for measuring the degree of abnormality of each transaction, and the transactions with the highest degrees of abnormality are judged as outliers. Last, several experimental studies are conducted on a synthetic dataset to evaluate the performance of the proposed WMFP-Outlier approach. The results demonstrate that the accuracy of the WMFP-Outlier approach is higher compared to the existing pattern-based outlier detection approaches, and the time cost of the outlier detection phase of WMFP-Outlier is lower than those of the other four compared pattern-based outlier detection approaches.

2012 ◽  
Vol 433-440 ◽  
pp. 4457-4462 ◽  
Author(s):  
Jun Shan Tan ◽  
Zhu Fang Kuang ◽  
Guo Gui Yang

The design of synopses structure is an important issue of frequent patterns mining over data stream. A data stream synopses structure FPD-Graph which is based on directed graph is proposed in this paper. The FPD-Graph contains list head node FPDG-Head and list node FPDG-Node. The operations of FPD-Graph consist of insert operation and deletion operation. A frequent pattern mining algorithm DGFPM based on sliding window over data stream is proposed in this paper. The IBM synthesizes data generation which output customers shopping a data are adopted as experiment data. The DGFPM algorithm not only has high precision for mining frequent patterns, but also has low processing time.


2019 ◽  
Vol 16 (10) ◽  
pp. 83-99 ◽  
Author(s):  
Saihua Cai ◽  
Ruizhi Sun ◽  
Shangbo Hao ◽  
Sicong Li ◽  
Gang Yuan

2014 ◽  
Vol 37 ◽  
pp. 109-116 ◽  
Author(s):  
Shamila Nasreen ◽  
Muhammad Awais Azam ◽  
Khurram Shehzad ◽  
Usman Naeem ◽  
Mustansar Ali Ghazanfar

2020 ◽  
Vol 50 (10) ◽  
pp. 3452-3470
Author(s):  
Saihua Cai ◽  
Li Li ◽  
Qian Li ◽  
Sicong Li ◽  
Shangbo Hao ◽  
...  

2013 ◽  
Vol 756-759 ◽  
pp. 2606-2609
Author(s):  
Cui Cui Ge ◽  
Xiu Fen Fu

Weighted frequent pattern mining address to discover more important frequent pattern by considering different weights of every item, closed frequent pattern mining can significantly reduce the number of frequent itemset mining and keep sufficient result information. In this paper,we proposed an algorithm DS_CRWF to mine closed weighted frequent pattern over data stream,which is based on sliding window and take basic window as unit of updating,all the closed weighted frequent patterns can be mined through once scan.The experimental results show the feasibility of the algorithm.


2015 ◽  
Vol 3 (2) ◽  
Author(s):  
S. Vijayarani Mohan

A data stream is a real time, continuous, structured sequence of data items. Mining data stream is the process of extracting knowledge from continuous arrival of rapid data records. Data can arrive fast and in continuous manner. It is very difficult to perform mining process. Normally, stream mining algorithms are designed to scan the database only once, and it is a complicated task to extract the knowledge from the database by a single scan. Data streams are a computational challenge to data mining problems because of the additional algorithmic constraints created by the large volume of data. Popular data mining techniques namely clustering, classification, and frequent pattern mining are applied to data streams for extracting the knowledge. This research work mainly concentrates on how to predict the valuable items which are found in a transactional data of a data stream. In the literature, most of the researchers have discussed about how the frequent items are mined from the data streams. This research work helps to predict the valuable items in a transactional data. Frequent item mining is defined as finding the items which occur frequently, i.e. the occurrence of items above the given threshold is considered as frequent items. Valuable item mining is nothing but finding the costliest or most valuable items of a database. Predicting this information helps businesses to know about the sales details about the valuable items which guide to make crucial decisions, such as catalogue drawing, cross promotion, end user shopping, and performance scrutiny. In this research work, a new algorithm namely VIM (Valuable Item Mining) is proposed for finding the valuable items in data streams. The performance of this algorithm is analysed by using the factors, number of valuable items discovered, and execution time.


2014 ◽  
Vol 602-605 ◽  
pp. 3835-3838
Author(s):  
Fen Fen Zhou ◽  
Jun Rui Yang

A new algorithm DSMFP-Miner was proposed. When the data stream reach continuously, a maximal frequent pattern tree called MFP-Tree is adopted to maintain the transactions in data screams dynamically. Transactions in the same Transaction-sensitive sliding window are set to own the same “importance”. Besides, the support of the transactions in old window is decayed to reduce their influence to mining results, and infrequent patterns and overdue patterns are deleted periodically. In the mining process, the algorithm put an enumeration tree with each node of MFP-Tree as root as the search space, and use the "depth-first" search strategy to mining the maximal frequent patterns with this node as a suffix.


Author(s):  
Gangin Lee ◽  
Unil Yun ◽  
Heungmo Ryang ◽  
Donggyu Kim

Since the concept of frequent pattern mining was proposed, there have been many efforts to obtain useful pattern information from large databases. As one of them, applying weight conditions allows us to mine weighted frequent patterns considering unique importance of each item composing databases, and the result of analysis for the patterns provides more useful information than that of considering only frequency or support information. However, although this approach gives us more meaningful pattern information, the number of patterns found from large databases is extremely large in general; therefore, analyzing all of them may become inefficient and hard work. Thus, it is essential to apply a method that can selectively extract representative patterns from the enormous ones. Moreover, in the real-world applications, unexpected errors such as noise may occur, which can have a negative effect on the values of databases. Although the changes by the error are quite small, the characteristics of generated patterns can be turned definitely. For this reason, we propose a novel algorithm that can solve the above problems, called AWMax (an algorithm for mining Approximate weighted maximal frequent patterns (AWMFPs) considering error tolerance). Through the algorithm, we can obtain useful AWMFPs regardless of noise because of the consideration of error tolerance. Comprehensive performance experiments present that the proposed algorithm has more outstanding performance than previous state-of-the-art ones.


Sign in / Sign up

Export Citation Format

Share Document