Abstract

Bladder cancer is one of the most common malignancies of the urinary tract. It is characterized by high metastatic potential and a high recurrence rate, which significantly complicates diagnosis and treatment. In order to increase the accuracy of the diagnostic procedure, algorithms based on artificial intelligence are introduced. This paper presents the principle of selection of convolutional neural network (CNN) models based on a multi-objective approach that maximizes classification and generalization performance. Model selection is performed on two standard CNN architectures, AlexNet and VGG-16. Classification performances are measured by using ROC analysis and the resulting AUC value. On the other hand, generalization performances are evaluated by using a 5-fold cross-validation procedure. By using these two metrics, a multi-objective fitness function, used in meta-heuristic algorithms, is designed. The multi-objective search was performed using a Genetic algorithm (GA) and a Discrete Particle Swarm (D-PS) algorithm. From obtained results, it can be noticed that such an approach has resulted in CNN models that are defined with high classification and generalization performances. When a GA-based approach is used, fitness values up to 0.97 are achieved. On the other hand, by using the D-PS approach, fitness values up to 0.99 are achieved pointing towards the conclusion that such an approach has provided models with higher classification and generalization performances.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.