Parallelization of frequent itemset mining methods with fp-tree: An experiment with prepost+ algorithm
- Title
- Parallelization of frequent itemset mining methods with fp-tree: An experiment with prepost+ algorithm
- Creator
- Jamsheela O.; Gopalakrishna R.
- Description
- Parallel processing has turn to be a common programming practice because of its efficiency and thus becomes an interesting field for researchers. With the introduction of multi-core processors as well as general purpose graphics processing units, parallel programming has become affordable. This leads to the parallelization of many of the complex data processing algorithms including algorithms in data mining. In this paper, a study on parallel PrePost+ is presented. PrePost+ is an efficient frequent itemset mining algorithm. The algorithm has been modified as a parallel algorithm and the obtained result is compared with the result of sequential PrePost+ algorithm. 2021, Zarka Private University. All rights reserved.
- Source
- International Arab Journal of Information Technology, Vol-18, No. 2, pp. 208-213.
- Date
- 2021-01-01
- Publisher
- Zarka Private University
- Subject
- Data Mining algorithm; Multicore; Parallel processing; Parallelization of PrePost+
- Coverage
- Jamsheela O., EMEA College of Arts and Science, Calicut University, India; Gopalakrishna R., Computer Science and Engineering, CHRIST (Deemed to be University), India
- Rights
- All Open Access; Gold Open Access
- Relation
- ISSN: 16833198
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Jamsheela O.; Gopalakrishna R., “Parallelization of frequent itemset mining methods with fp-tree: An experiment with prepost+ algorithm,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/16047.