Mathias Goller, Markus Humer, Michael Schrefl,
"Beneficial Sequential Combination of Data Mining Algorithms"
, in Yannis Manolopoulos, Joaquim Filipe, Panos, Constantopoulos, José Eordeiro (eds.): Proceedings of the 8th International Conference on Enterprise Information Systems (ICEIS 2006), 23-27, May 2006 Paphos, Cyprus, Seite(n) 135-143, 5-2006, ISBN: 972-8865-41-4
Beneficial Sequential Combination of Data Mining Algorithms
Sprache des Titels:
Proceedings of the 8th International Conference on Enterprise Information Systems (ICEIS 2006), 23-27, May 2006 Paphos, Cyprus
Depending on the goal of an instance of the Knowledge Discovery in Databases (KDD) process, there are instances that require more than a single data mining algorithm to determine a solution. Sequences of data mining algorithms offer room for improvement that are yet unexploited.
If it is known that an algorithm is the first of a sequence of algorithms and there will be future runs of other algorithms, the first algorithm can determine intermediate results that the succeeding algorithms need. The anteceding algorithm can also determine helpful statistics for succeeding algorithms. As the anteceding algorithm has to scan the data anyway, computing intermediate results happens as a by-product of computing the anteceding algorithm's result. On the one hand, a succeeding algorithm can save time because several steps of that algorithm have already been pre-computed.
On the other hand, additional information about the analysed data can improve the quality of results such as the accuracy of classification, as demonstrated in experiments with synthetical and real data.
Sprache der Kurzfassung:
Anzahl der Seiten:
Notiz zur Publikation:
If you are interested in the paper, you may receive a copy (PDF) by sending an e-mail to our office (email@example.com). Please include the paper-no. (Eich06a) and agree to use the paper for scientific purposes and private use only!