![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Eduardo R. Hruschka Estevam R. Hruschka Jr. , Eduardo R. Hruschka, Nelson F. F. Ebecken : Feature Selection by Bayesian Networks. Canadian Conference on AI 2004 : 370-379 Fabrício Alves Barbosa da Silva , Sílvia Carvalho , Hermes Senger , Eduardo R. Hruschka, Cléver Ricardo Guareis de Farias : Running Data Mining Applications on the Grid: A Bag-of-Tasks Approach. ICCSA (2) 2004 : 168-177 Eduardo R. Hruschka, Estevam R. Hruschka Jr. , Nelson F. F. Ebecken : Evaluating a Nearest-Neighbor Method to Substitute Continuous Missing Values. Australian Conference on Artificial Intelligence 2003 : 723-734 Eduardo R. Hruschka, Estevam R. Hruschka Jr. , Nelson F. F. Ebecken : A Nearest-Neighbor Method as a Data Preparation Tool for a Clustering Genetic Algorithm. SBBD 2003 : 319-327 Estevam R. Hruschka Jr. , Eduardo R. Hruschka, Nelson F. F. Ebecken : A Feature Selection Bayesian Approach for Extracting Classification Rules with a Clustering Genetic Algorithm. Applied Artificial Intelligence 17 (5-6): 489-506 (2003) Eduardo R. Hruschka, Nelson F. F. Ebecken : A genetic algorithm for cluster analysis. Intell. Data Anal. 7 (1): 15-25 (2003) Estevam R. Hruschka Jr. , Eduardo R. Hruschka, Nelson F. F. Ebecken : A Data Preparation Bayesian Approach for a Clustering Genetic Algorithm. HIS 2002 : 453-461 Eduardo R. Hruschka, Nelson F. F. Ebecken : Applying a Clustering Genetic Algorithm for Extracting Rules from a Supervised Neural Network. IJCNN (3) 2000 : 407-412 Eduardo R. Hruschka, Nelson F. F. Ebecken : A clustering algorithm for extracting rules from supervised neural network models in data mining tasks. Int. J. Comput. Syst. Signal 1 (1): 17-29 (2000) 1 [ 8 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] 3 [ 8 ] 4 [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 9 ] 5 [ 8 ] 6 [ 8 ] ![]() ©2004 Association for Computing Machinery |