Technique of Building Parallel Data Mining Algorithms
Zaynidin Karshiev1, Mirzabek Sattarov2
1Karshiev Zaynidin*, Samarkand branch of the Tashkent University of Information Technologies named after Muhammad al-Khwarizmi, Uzbekistan.
2Sattarov Mirzabek, Samarkand branch of the Tashkent University of Information Technologies named after Muhammad al-Khwarizmi, Uzbekistan.
Manuscript received on November 15, 2019. | Revised Manuscript received on 20 November, 2019. | Manuscript published on December 10, 2019. | PP: 3331-3336 | Volume-9 Issue-2, December 2019. | Retrieval Number: B7930129219/2019©BEIESP | DOI: 10.35940/ijitee.B7930.129219
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Paper describes the technique of parallelization of data mining algorithms based on the block structure. The described technique takes into account the characteristics of the execution environment of parallel algorithms, such as the distribution of the analyzed data, as well as the features of the parallelized algorithm.
Keywords: Data Mining, Parallel Algorithms, block structure.
Scope of the Article: Building Energy