Proceedings of the Tenth International Conference on Information and Knowledge Management 2001
DOI: 10.1145/502585.502630
|View full text |Cite
|
Sign up to set email alerts
|

Sliding-window filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2003
2003
2023
2023

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 103 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…Focus is on patterns that might result in fraud two clients who just so happen to share the same characteristics will undoubtedly act the same John et al, (2016). [51] Lee, C., et al [42], explain characteristics of sliding window filtering, utilises the ideas of cumulative filtering and scan reduction techniques to lower I/O and CPU costs while also efficiently regulating memory usage through the use of sliding-window partition. An ongoing time-variant transaction database can benefit greatly from effective incremental mining with the SWF algorithm.…”
Section: Ata Et Al (2020) [50] 10mentioning
confidence: 99%
“…Focus is on patterns that might result in fraud two clients who just so happen to share the same characteristics will undoubtedly act the same John et al, (2016). [51] Lee, C., et al [42], explain characteristics of sliding window filtering, utilises the ideas of cumulative filtering and scan reduction techniques to lower I/O and CPU costs while also efficiently regulating memory usage through the use of sliding-window partition. An ongoing time-variant transaction database can benefit greatly from effective incremental mining with the SWF algorithm.…”
Section: Ata Et Al (2020) [50] 10mentioning
confidence: 99%
“…Gharib, Nassar, Taha, and Abraham (2010) present an incremental algorithm based on the sliding‐window filtering algorithm (C.‐H. Lee, Lin, & Chen, 2001), which maintains temporal frequent itemsets after the temporal transaction database has been updated in order to reduce the time needed for generating new candidates. Fouad and Mostafa (2017) present a method for the efficient mining of incremental TARs, making use of a new data structure and of previously discovered frequent temporal itemsets.…”
Section: Considering Time As An Integral Component In the Mining Processmentioning
confidence: 99%
“…The basic strategy of the traditional visual object detection algorithm is to first select the interested image region from the image, then extract the corresponding image features from the region, and then finally the extracted features are fed into the classifier. Such algorithms involve two aspects: feature extraction methods, such as the sliding window method [4], SIFT [5], HOG [6], etc., where the features are designed manually; and classifiers, such as SVM classifiers [7], Adaboost classifiers [8], etc. Because the traditional method needs to preselect the region, it will make the model time-consuming.…”
Section: Introductionmentioning
confidence: 99%