


default search action
Multi-Objective Evolutionary Algorithms for Knowledge Discovery from Databases 2008
- Ashish Ghosh, Satchidananda Dehuri, Susmita Ghosh:
Multi-Objective Evolutionary Algorithms for Knowledge Discovery from Databases. Studies in Computational Intelligence 98, Springer 2008, ISBN 978-3-540-77466-2 - Satchidananda Dehuri
, Susmita Ghosh
, Ashish Ghosh
:
Genetic Algorithm for Optimization of Multiple Objectives in Knowledge Discovery from Large Databases. 1-22 - Ricardo Landa Becerra, Luis V. Santana-Quintero, Carlos A. Coello Coello
:
Knowledge Incorporation in Multi-objective Evolutionary Algorithms. 23-46 - Hisao Ishibuchi
, Isao Kuwajima, Yusuke Nojima
:
Evolutionary Multi-objective Rule Selection for Classification Rule Mining. 47-70 - Yaochu Jin
, Bernhard Sendhoff
, Edgar Körner:
Rule Extraction from Compact Pareto-optimal Neural Networks. 71-90 - Rafael Alcalá
, Jesús Alcalá-Fdez, María José Gacto, Francisco Herrera:
On the Usefulness of MOEAs for Getting Compact FRBSs Under Parameter Tuning and Rule Selection. 91-107 - Christian Setzkorn:
Classification and Survival Analysis Using Multi-objective Evolutionary Algorithms. 109-135 - M. Narasimha Murty, Rashmin Babaria, Chiranjib Bhattacharyya:
Clustering Based on Genetic Algorithms. 137-159

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.