This paper presents a Nearest-Neighbor Method to substitute missing values in continuous datasets and show that it can be useful for a Clustering Genetic Algorithm. The proposed method is evaluated by means of simulations performed in the Wisconsin Breast Cancer Dataset, which is a benchmark for data mining methods. In this sense, we verify the efficacy of the proposed method in the context of a Clustering Genetic Algorithm, comparing the average classification rates obtained in the original dataset with those obtained in a dataset formed by the substituted values. The simulation results show that the proposed method is promising. 1
This paper presents experiments of Nearest Neighbor (NN) classifier design using differ-ent evolutio...
AbstractData mining techniques have been widely used to mine knowledgeable information from medical ...
In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromos...
Abstract. This work proposes and evaluates a Nearest-Neighbor Method to substitute missing values in...
This paper describes the application of a genetic algorithm to nearest-neighbour based imputation of...
This paper discusses a genetic-algorithm-based approach for selecting a small number of representati...
In this paper the performance of genetic algorithms for solving some clustering problems is investig...
A nearest-neighbor classifier compares an unclassified object to a set of preclassified examples and...
In this paper a genetic algorithm for clustering is proposed. The algorithm is based on the variable...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
The Nearest Neighbor (NN) classifier uses all training instances in the generalization phase and cau...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
Many popular clustering techniques including K-means require various user inputs such as the number ...
Three approaches to partitional clustering using genetic algorithms (GA) are compared with k-means a...
Copyright © 2003 ACPSEM. All rights reserved. The document attached has been archived with permissio...
This paper presents experiments of Nearest Neighbor (NN) classifier design using differ-ent evolutio...
AbstractData mining techniques have been widely used to mine knowledgeable information from medical ...
In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromos...
Abstract. This work proposes and evaluates a Nearest-Neighbor Method to substitute missing values in...
This paper describes the application of a genetic algorithm to nearest-neighbour based imputation of...
This paper discusses a genetic-algorithm-based approach for selecting a small number of representati...
In this paper the performance of genetic algorithms for solving some clustering problems is investig...
A nearest-neighbor classifier compares an unclassified object to a set of preclassified examples and...
In this paper a genetic algorithm for clustering is proposed. The algorithm is based on the variable...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
The Nearest Neighbor (NN) classifier uses all training instances in the generalization phase and cau...
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and ...
Many popular clustering techniques including K-means require various user inputs such as the number ...
Three approaches to partitional clustering using genetic algorithms (GA) are compared with k-means a...
Copyright © 2003 ACPSEM. All rights reserved. The document attached has been archived with permissio...
This paper presents experiments of Nearest Neighbor (NN) classifier design using differ-ent evolutio...
AbstractData mining techniques have been widely used to mine knowledgeable information from medical ...
In this paper, we propose an unsupervised genetic clustering algorithm, which produces a new chromos...