Hybridized optimization oriented fast negative sequential patterns mining
Recently, negative sequential patterns (NSP) (like missing medical treatments) mining is important in data mining research since it includes negative correlations between item sets, which are overlooked by positive sequential pattern mining (PSP) (for instance, utilization of medical service). Yet,...
Gespeichert in:
Veröffentlicht in: | Multimedia tools and applications 2022-02, Vol.81 (4), p.5279-5303 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Recently, negative sequential patterns (NSP) (like missing medical treatments) mining is important in data mining research since it includes negative correlations between item sets, which are overlooked by positive sequential pattern mining (PSP) (for instance, utilization of medical service). Yet, discovering the NSP is very complex than finding PSP because of the important problem complexity occurred by high computational cost, non-occurring elements, as well as huge search space in evaluating NSC, and most of the NSP based existing works are inefficient. Therefore, this paper intends to propose a fast NSP mining algorithm for the disease prediction model. This model includes Data normalization, Data separation based on labels, and Pattern recognition phases. In the midst of data separation, the maximum occurring data is optimally selected using a new algorithm that hybridizes the FireFly (FF) algorithm and Grey Wolf Optimization (GWO). This proposed Firefly induced Grey Wolf optimization (F-GWO) algorithm automatically selects the maximum occurring information as per the PSP support. The proposed model is compared over other conventional methods with varied measures. Especially, the computation cost of our model is 46.87%, 6.27%, 9.37%, 2.76%, and 66.62% better than the existing GA, ABC, PSO, FF, and GWO models respectively. |
---|---|
ISSN: | 1380-7501 1573-7721 |
DOI: | 10.1007/s11042-021-11773-4 |