Ant Colony Algorithm in Fault Diagnosis
-
- Taschenbuch
- eBook ausgewählt
-
Form:Einzelkauf Download
-
Sprache:Deutsch
36,99 €
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Nein
Family Sharing
Nein
Text-to-Speech
Nein
Erscheinungsdatum
25.11.2016
Verlag
GRINSeitenzahl
140 (Printausgabe)
Dateigröße
2483 KB
Auflage
1. Auflage
Sprache
Deutsch
EAN
9783668350038
Fachbuch aus dem Jahr 2016 im Fachbereich Informatik - Angewandte Informatik, , Sprache: Deutsch, Abstract: In this book, we propose several modules of diagnosis for complex and dynamic systems. These modules are based on the three algorithms colony of ants, which are AntTreeStoch, Lumer & Faieta and Binary ant colony. These algorithms have been chosen for their simplicity and their vast field of application. However, these algorithms cannot be used under their basal form for the development of diagnostic modules since they have several limitations.
We have also proposed several adaptations in order that these algorithms can be used in diagnostic modules. We have proposed a parallel version of the algorithm AntTreeStoch based on a reactive multi-agents system. This version allows minimizing the influence of initial sort on the outcome of classification. We have also introduced a new parameter called Sid, which allows several ants to connect to the same position, and we have modified the movements of ants by promoting the path of the ant the most similar.
For the algorithm Lumer & Faieta, we have accelerated the speed of construction of classes by adding a speed setting different for each Ant. To reduce the number of movements, we have proposed a new variable that allows saving the identifiers of objects displaced by the same Ant. To improve the quality of classification, we have also added to the algorithm of the indices to report the classes trunks constructed. For the algorithm Binary ant colony, we have proposed a variant called "Hybrid wrapper/filter-based ACO-SVM".
This algorithm allows the selection of parameters. It combines the techniques of filters and enveloping methods in taking advantage of the rapidity of the Fisher report and the adaptation of selected settings to the classifier SVM. It improves the quality of classification according to the data nature in the database for learning and the type of the kernel function used. It also allows adjusting the hyperparameters of the kernel function. We tested these algorithms based on data from two industrial systems, which are the sintering system and the pasteurization system, as well on a few databases of UCI (University of California, Irvine).
We have also proposed several adaptations in order that these algorithms can be used in diagnostic modules. We have proposed a parallel version of the algorithm AntTreeStoch based on a reactive multi-agents system. This version allows minimizing the influence of initial sort on the outcome of classification. We have also introduced a new parameter called Sid, which allows several ants to connect to the same position, and we have modified the movements of ants by promoting the path of the ant the most similar.
For the algorithm Lumer & Faieta, we have accelerated the speed of construction of classes by adding a speed setting different for each Ant. To reduce the number of movements, we have proposed a new variable that allows saving the identifiers of objects displaced by the same Ant. To improve the quality of classification, we have also added to the algorithm of the indices to report the classes trunks constructed. For the algorithm Binary ant colony, we have proposed a variant called "Hybrid wrapper/filter-based ACO-SVM".
This algorithm allows the selection of parameters. It combines the techniques of filters and enveloping methods in taking advantage of the rapidity of the Fisher report and the adaptation of selected settings to the classifier SVM. It improves the quality of classification according to the data nature in the database for learning and the type of the kernel function used. It also allows adjusting the hyperparameters of the kernel function. We tested these algorithms based on data from two industrial systems, which are the sintering system and the pasteurization system, as well on a few databases of UCI (University of California, Irvine).
Noch keine Bewertungen vorhanden
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice