2016
DOI: 10.1007/s10489-016-0799-6
|View full text |Cite
|
Sign up to set email alerts
|

An efficient algorithm for mining frequent weighted itemsets using interval word segments

Abstract: Mining frequent weighted itemsets (FWIs) from weighted-item transaction databases has recently received research interest. In real-world applications, sparse weighted-item transaction databases (SWITDs) are common. For example, supermarkets have many items, but each transaction has a small number of items. In this paper, we propose an interval word segment (IWS) structure to store and process tidsets for enhancing the effectiveness of mining FWIs from SWITDs. The IWS structure allows the intersection of tidset… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…The authors [4] developed some theorems to rapidly calculate weighted supports, giving WIT-FWI-DIFF impressive results in their experiments. After that, Nguyen et al [5] utilized the IWS structure to optimize the tidsets storage space for accelerating the computation of mining FWPs. Based on this structure, the IWS algorithm was introduced.…”
Section: A Mining Frequent Weighted Patternsmentioning
confidence: 99%
“…The authors [4] developed some theorems to rapidly calculate weighted supports, giving WIT-FWI-DIFF impressive results in their experiments. After that, Nguyen et al [5] utilized the IWS structure to optimize the tidsets storage space for accelerating the computation of mining FWPs. Based on this structure, the IWS algorithm was introduced.…”
Section: A Mining Frequent Weighted Patternsmentioning
confidence: 99%