Decomposition of data mining algorithms into unified functional blocks
Summary: 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.
- Confluence of the coinductive \(\lambda\)-calculus
- scientific article; zbMATH DE number 3961577 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 2198871 (Why is no real title available?)
- Introduction to algorithms.
- Models for machine learning and data mining in functional programming
- Some Properties of Conversion
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
This page was built for publication: Decomposition of data mining algorithms into unified functional blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1793631)