2012
DOI: 10.1007/978-3-642-29038-1_20
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Mining Regularly Frequent Patterns in Transactional Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 37 publications
(20 citation statements)
references
References 12 publications
0
20
0
Order By: Relevance
“…We assumed the missed readings from sensors as undetected events which are beneficial in generating patterns despite lost readings. In absence of any regularly frequent sensor pattern mining technique in literature for sensor dataset, we compared the performance of RFSP-tree with RF-Tree [23], which was proposed to mine regularly frequent patterns in transactional database and shown to outperform other related techniques.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We assumed the missed readings from sensors as undetected events which are beneficial in generating patterns despite lost readings. In absence of any regularly frequent sensor pattern mining technique in literature for sensor dataset, we compared the performance of RFSP-tree with RF-Tree [23], which was proposed to mine regularly frequent patterns in transactional database and shown to outperform other related techniques.…”
Section: Resultsmentioning
confidence: 99%
“…Recently, Rashid et al [23] have introduced a method of finding regularly frequent patterns in transactional databases that follow a temporal regularity in their occurrence characteristics by using a tree structure, called a Regularly Frequent Pattern tree (RF-tree). However, the requirement of two database scans for RF-tree is inefficient in mining regularly frequent sensor patterns from sensor datasets.…”
Section: Related Workmentioning
confidence: 99%
“…For instance, the periodicity measure in [27], which is susceptible to noise in the database, might often report the noised maximal period of a pattern as its regular period. Additionally, as we mentioned earlier, the methods in [25] and [26] often generate regular (periodic) frequent patterns that occur in the whole database with totally distinct periods.…”
Section: Related Workmentioning
confidence: 99%
“…An-other calculation has been proposed RFRP to locate the general successive examples of a thing set. In this paper [15] event recurrence of the de-sign is estimated as a critical factor and is utilized for estimating the intriguing quality of the example in numerous applications. Considering min support client given edge esteem a consistent continuous example is found.…”
Section: Introductionmentioning
confidence: 99%