scholarly journals Fuzzy Frequent Pattern Mining Algorithm Based on Weighted Sliding Window and Type-2 Fuzzy Sets over Medical Data Stream

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Jing Chen ◽  
Peng Li ◽  
Weiqing Fang ◽  
Ning Zhou ◽  
Yue Yin ◽  
...  

Real-time data stream mining algorithms are largely based on binary datasets and do not handle continuous quantitative data streams, especially in medical data mining field. Therefore, this paper proposes a new weighted sliding window fuzzy frequent pattern mining algorithm based on interval type-2 fuzzy set theory over data stream (WSWFFP-T2) with a single scan based on the artificial datasets of medical data stream. The weighted fuzzy frequent pattern tree based on type-2 fuzzy set theory (WFFPT2-tree) and fuzzy-list sorted structure (FLSS) is designed to mine the fuzzy frequent patterns (FFPs) over the medical data stream. The experiments show that the proposed WSWFFP-T2 algorithm is optimal for mining the quantitative data stream and not limited to the fragile databases; the performance is reliable and stable under the condition of the weighted sliding window. Moreover, the proposed algorithm has high performance in mining the FFPs compared with the existing algorithms under the condition of recall and precision rates.

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.


2018 ◽  
Vol 7 (4.19) ◽  
pp. 1007
Author(s):  
Shankar B. Naik ◽  
Jyoti D. Pawar

In this paper we have proposed a framework which uses high utility itemset mining to store data stream elements in a compressed form and then detect events from the sliding window. This approach promises to reduce the memory requirements when applied to frequent pattern mining in data streams.In addition to this, a method to dynamically define the value of minimum support threshold based on data in the data stream is presented.  


2009 ◽  
Vol 179 (22) ◽  
pp. 3843-3865 ◽  
Author(s):  
Syed Khairuzzaman Tanbeer ◽  
Chowdhury Farhan Ahmed ◽  
Byeong-Soo Jeong ◽  
Young-Koo Lee

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.


Sign in / Sign up

Export Citation Format

Share Document