Data mining deals with the extraction of hidden knowledge from large amounts of data. Nowadays, coarse-grained data mining modules are used. This traditional black box approach focuses on specific algorithm improvements and is not flexible enough to be used for more general optimization and beneficial component reuse. The work presented in this paper elaborates on decomposing data mining tasks as data mining execution process plans which are composed of finer-grained data mining operators. The cost of an operator can be analyzed and provides means for more holistic optimizations. This process-based data mining concept is evaluated via an OGSA-DAI based implementations for association rule mining which show the feasibility of our approach as well as the re-usability of some of the data mining operators. © 2010 Springer-Verlag.
CITATION STYLE
Zhang, Y., Li, H., Wöhrer, A., Brezany, P., & Dai, G. (2010). Decomposing data mining by a process-oriented execution plan. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6319 LNAI, pp. 97–106). https://doi.org/10.1007/978-3-642-16530-6_13
Mendeley helps you to discover research relevant for your work.