Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Dynamic Version of the ACDT/ACDF Algorithm for H-Bond Data Set Analysis
verfasst von : Jan Kozak, Urszula Boryczka
Erschienen in: Computational Collective Intelligence. Technologies and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This article is devoted to the new application of the ACDT/ACDF algorithms. In this work we distinguish ant colony optimization and join it with decision tree construction algorithms, the proposed approach builds more stable decision forests. Additionally, we would like to mention that it is possible to analyze the overloaded data sets. Several methods are proposed in this study, each considered different pseudo-samples from training data sets. We combine ideas from ACO, Boosting and Random Forests. We show that our algorithms perform comparable to common approaches. Moreover, we demonstrate the suitability of our method to H-bonds detections in protein structures.