Decomposition of Data Mining Algorithms into Unified Functional BlocksReport as inadecuate

Decomposition of Data Mining Algorithms into Unified Functional Blocks - Download this document for free, or read online. Document in PDF available to download.

Mathematical Problems in Engineering - Volume 2016 2016, Article ID 8197349, 11 pages -

Research ArticleFaculty of Computer Science and Technology, Saint Petersburg Electrotechnical University -LETI-, Professora Popova Street 5, Saint Petersburg 197376, Russia

Received 8 October 2014; Accepted 24 April 2015

Academic Editor: Tarek Ahmed-Ali

Copyright © 2016 Ivan Kholod et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The present paper describes the method of creating data mining algorithms from unified functional blocks. This method splits algorithms into independently functioning blocks. These blocks must have unified interfaces and implement pure functions. The method allows us to create new data mining algorithms from existing blocks and improves the existing algorithms by optimizing single blocks or the whole structure of the algorithms. This becomes possible due to a number of important properties inherent in pure functions and hence functional blocks.

Author: Ivan Kholod, Mikhail Kupriyanov, and Andrey Shorov



Related documents