๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Geometrical bounding of data space and nonlinear classification of chemical data using MPGA algorithm

โœ Scribed by Nasser A.M. Barakat; Zeng-Ping Chen; Jiang-Hui Jiang; Ru-Qin Yu

Book ID
104440794
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
406 KB
Volume
27
Category
Article
ISSN
1476-9271

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Clustering algorithm using space filling
Clustering algorithm using space filling curves for the classification of high energy physics data
โœ Mostafa Mjahed ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB

According to a space filling curve, distances between points in a multidimensional space are replaced by distances along a Lebesgue measure-preserving curve. By using a neighbouring approach on the space filling curve, several clusters may emerge fkom data and configurations may be associated to the

Space-filling curves and their use in th
Space-filling curves and their use in the design of geometric data structures
โœ Tetsuo Asano; Desh Ranjan; Thomas Roos; Emo Welzl; Peter Widmayer ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 827 KB

We are given a two-dimensional square grid of size N x N, where N := 2" and n > 0. A space Ming curve (SFC) is a numbering of the cells of this grid with numbers from c + 1 to c +N2, for some c>,O. We call a SFC recursive (RSFC) if it can be recursively divided into four square RSFCs of equal size.