2018
DOI: 10.1007/s40815-018-0520-5
|View full text |Cite
|
Sign up to set email alerts
|

Efficiently Updating the Discovered Multiple Fuzzy Frequent Itemsets with Transaction Insertion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 31 publications
0
5
0
Order By: Relevance
“…scan fuzzy semantic trajectory database FD (4) calculate the support P of each sequence (5) calculate the fuzzy stay time membership S(Δt) of each sequence accord to the time membership function (6) if P < σ and μ A j (Δt) < ρ (7) the sequence is less than the minimum support threshold and fuzzy stay time membership threshold (8) define the sequence as an infrequent itemset and delete it (9) create a new sequence database Q i and add frequent itemsets with length i to the database (10) for each frequent itemset T in the sequence database Q i (11) construct the projection database C w of frequent itemset T (12) get the frequent itemset T k of C w (13) T and T k are constructed as frequent sequences T i with length i (14) FTFP � FTFP ∪ T i (15) if projection database C w is not empty (16) repeat steps 8-12, i � i + 1 (17) else output frequent sequence FTFP (18) end for (19) end if (20) return FTFP ALGORITHM 2: FST-FPM algorithm.…”
Section: Fst-fpm Algorithm Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…scan fuzzy semantic trajectory database FD (4) calculate the support P of each sequence (5) calculate the fuzzy stay time membership S(Δt) of each sequence accord to the time membership function (6) if P < σ and μ A j (Δt) < ρ (7) the sequence is less than the minimum support threshold and fuzzy stay time membership threshold (8) define the sequence as an infrequent itemset and delete it (9) create a new sequence database Q i and add frequent itemsets with length i to the database (10) for each frequent itemset T in the sequence database Q i (11) construct the projection database C w of frequent itemset T (12) get the frequent itemset T k of C w (13) T and T k are constructed as frequent sequences T i with length i (14) FTFP � FTFP ∪ T i (15) if projection database C w is not empty (16) repeat steps 8-12, i � i + 1 (17) else output frequent sequence FTFP (18) end for (19) end if (20) return FTFP ALGORITHM 2: FST-FPM algorithm.…”
Section: Fst-fpm Algorithm Descriptionmentioning
confidence: 99%
“…Finally, fuzzy association rules are derived by using these fuzzy values. Lin et al [15] proposed an incremental multiple fuzzy frequent item mining algorithm based on transaction insertion (IMF-INS) to effectively update multiple fuzzy frequent itemsets of quantitative datasets. IMF-INS uses fuzzy FUP concept to divide the converted language terms into four cases.…”
Section: Introductionmentioning
confidence: 99%
“…Researchers have focused on the fuzzification of any one of the parameters such as time [24,26,27], or quantity [28,29,30]. HUFI-Miner algorithm performed quantity fuzzification in the domain of utility mining [28].…”
Section: Introductionmentioning
confidence: 99%
“…Anuradha et al [21] used type-2 fuzzy sets to mine multi-level association rules. Lin et al [22] used type-2 fuzzy sets to discover fuzzy frequent item sets efficiently. Kalia et al [23] used type-2 fuzzy sets and genetic algorithms to mine fuzzy rules in highdimensional classification tasks.…”
Section: Introductionmentioning
confidence: 99%