Two procedures are suggested to select a representative subset from a large data set. The first is based on the use of the estimate of the multivariate probability density distribution by means of the potential functions technique. The first object selected for the subset is that for which the proba
Representative subset selection using genetic algorithms
โ Scribed by Yukio Tominaga
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 215 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0169-7439
No coin nor oath required. For personal study only.
โฆ Synopsis
The selection of representative subsets was performed using genetic algorithms GAs . The dissimilarity Dis of selected ลฝ . samples within a subset and the mean of the product-moment correlation coefficients MP were used as fitness function of the GAs. We applied the GAs to select representative subsets from the dataset containing 5000 samples which were randomly selected from Maybridge catalog. Two fitness functions didn't always select corresponding subsets; higher Dis didn't always lead higher MP and vice versa. The data structures of selected subsets were compared by using box counting analysis. The comparison suggested that the data structures of the selected subsets with higher MP reflect original data structure more correctly.
๐ SIMILAR VOLUMES
In this paper, we solve the motion smoothing problem using genetic algorithms. Smooth motion generation is essential in the computer animation and virtual reality area. The motion of a rigid body in general consists of translation and orientation. The former is described by a space curve in three-di