An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
MK Vanahalli, N Patil - Information Sciences, 2019 - Elsevier
Mining colossal itemsets from high dimensional datasets have gained focus in recent times.
The conventional algorithms expend most of the time in mining small and mid-sized …
The conventional algorithms expend most of the time in mining small and mid-sized …
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
MK Vanahalli, N Patil - 2019 - dl.acm.org
Mining colossal itemsets from high dimensional datasets have gained focus in recent times.
The conventional algorithms expend most of the time in mining small and mid-sized …
The conventional algorithms expend most of the time in mining small and mid-sized …
An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets
MK Vanahalli, N Patil - 2019 - idr.l3.nitk.ac.in
Mining colossal itemsets from high dimensional datasets have gained focus in recent times.
The conventional algorithms expend most of the time in mining small and mid-sized …
The conventional algorithms expend most of the time in mining small and mid-sized …