ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository
link.springer.com › chapter
Dec 29, 2016 · It aims at discovering correlations, frequent patterns, associations or casual structures among sets of items in the transaction databases or ...
This paper proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data structure and ...
It creates unique data instances and new projections for data having less dimensions thereby resulting in faster HUI mining. We also prove upper bounds on the ...
In this paper, we present a novel frequent pattern mining algorithm, called LPS-Miner, which bases the pattern growth principle and uses two new data structures ...
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository. Abdullah Z.¹, Ngah A.², Herawan T.³, Ahmad N.⁴, Mohamad S.Z.⁵, Hamdan A.R.⁵.
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository ... M2: efficient model for mining frequent patterns in transactional database.
Therefore, in this paper we proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data ...
Therefore, in this paper we proposed a complete model for mining least patterns known as Efficient Least Pattern Mining Model (ELP-M2) with LP-Tree data ...
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository. Most of the algorithm and data structure facing a computational problem when they ...
ELP-M2: An Efficient Model for Mining Least Patterns from Data Repository. Other Titles: Recent Advances on Soft Computing and Data Mining. Authors: Zailani ...
People also ask
What is the best model for mining?
Which type of data is used to build a data mining model?
Which data mining technique helps to find the association between two or more items?
What is the goal of data mining is to build _______ models?