2009
DOI: 10.1007/978-3-642-01307-2_24
|View full text |Cite
|
Sign up to set email alerts
|

Discovering Periodic-Frequent Patterns in Transactional Databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
59
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 150 publications
(77 citation statements)
references
References 9 publications
1
59
0
Order By: Relevance
“…However, these algorithms are not designed to discover Proceedings of the 2nd Czech-China Scientific Conference 2016periodic patterns. Inspired by the work on FIM, researchers have designed several algorithms to discover periodic frequent patterns (PFP) in transaction databases [4][5][6][7][8][9]. Several applications of mining periodic frequent patterns have been reported in previous work [9].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, these algorithms are not designed to discover Proceedings of the 2nd Czech-China Scientific Conference 2016periodic patterns. Inspired by the work on FIM, researchers have designed several algorithms to discover periodic frequent patterns (PFP) in transaction databases [4][5][6][7][8][9]. Several applications of mining periodic frequent patterns have been reported in previous work [9].…”
Section: Related Workmentioning
confidence: 99%
“…Several algorithms have been proposed to discover periodic frequent patterns (PFP) [4][5][6][7][8][9] in a transaction database (a sequence of transactions). Typically, periodic pattern mining algorithms will discard a pattern as being nonperiodic if it has a single period greater than a maximal periodicity threshold, defined by the user.…”
Section: Introductionmentioning
confidence: 99%
“…Tanbeer [3] has proposed the problem of frequent-regular itemset mining (FRIM) in order to observe occurrence behavior of itemsets in terms of frequency and regularity of occurrence. A set of itemsets with high frequency and regular occurrence that meets user-given support and regular thresholds is generated.…”
Section: Frequent-regular Itemset Mining (Frim)mentioning
confidence: 99%
“…Lastly, the remaining utility in each entry of NUL, total remaining utility, and total utility of each item are calculated (as shown in Figure 1 15 , 8,11,39,9 ). Since regularity is greater than (itemset ' ' does not regularly occur in the database), ' ' should be removed out of consideration (based on the downward closure property of regularity [3]). Next, item ' ' is merged with item ' ' and is intersected with 1,8,65,0 , 3,4,30,0 , 4,5,5,0 , 5, 1,12, 0 , 8,4 Since regularity is smaller than and is greater than , it can be concluded that itemset ' ' and its supersets are potentially HUIRs.…”
Section: Example Of Mhuira With Numentioning
confidence: 99%
See 1 more Smart Citation