2013
DOI: 10.1007/s10618-013-0304-3
|View full text |Cite
|
Sign up to set email alerts
|

A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(9 citation statements)
references
References 20 publications
0
8
0
Order By: Relevance
“…However, it may deplete the network resources in terms of memory footprint and energy consumptions. As for the sensor's memory footprint, the increased number of frequent patterns requires a large space of the memory as reported in 13,20 . For the energy consumption, each sensor node is energy-limited, so adding another task (i.e.…”
Section: Distributed Sensors Data Mining Processing Approachesmentioning
confidence: 99%
“…However, it may deplete the network resources in terms of memory footprint and energy consumptions. As for the sensor's memory footprint, the increased number of frequent patterns requires a large space of the memory as reported in 13,20 . For the energy consumption, each sensor node is energy-limited, so adding another task (i.e.…”
Section: Distributed Sensors Data Mining Processing Approachesmentioning
confidence: 99%
“…MINIT uses a recursive depth-first search with pruning, similarly to the SUDA2 algorithm developed by the same group, and is often used as the baseline algorithm against which the performance of other infrequent mining algorithms is compared. In [Troiano et al 2009;Troiano and Scibelli 2013] a breadth-first algorithm, Rarity, aiming at finding not necessarily minimal infrequent itemsets, is introduced. Whereas other algorithms start from small itemsets and increase the size as they search, Rarity takes the opposite approach and proceeds from large itemsets to smaller ones (referred to in [Troiano et al 2009;Troiano and Scibelli 2013] as a top-down strategy).…”
Section: Related Workmentioning
confidence: 99%
“…In [Troiano et al 2009;Troiano and Scibelli 2013] a breadth-first algorithm, Rarity, aiming at finding not necessarily minimal infrequent itemsets, is introduced. Whereas other algorithms start from small itemsets and increase the size as they search, Rarity takes the opposite approach and proceeds from large itemsets to smaller ones (referred to in [Troiano et al 2009;Troiano and Scibelli 2013] as a top-down strategy). In [Gupta et al 2011] a pattern-growth recursive depth-first approach is proposed for minimal infrequent itemset mining and two algorithms called IFP min and IFP MLMS (multiple level minimum support) are introduced.…”
Section: Related Workmentioning
confidence: 99%
“…The rare behaviors patterns are sometimes helpful to teachers to identify the learning problems of students. Therefore, rare behaviors mining is an important issue for the educational research (Weng, 2011;Hoque et al, 2012;Tsang et al, 2013;Troiano & Scibelli, 2014;Bhatt & Patel, 2015a;Bhatt & Patel, 2015b;Goyal et State of the literature  In the educational field, the most learning behaviors of students are normal and easy to find out the pattern from the educational database.  In fact, it needs more assistance for students who exhibit the negative behaviors.…”
Section: Introductionmentioning
confidence: 99%