𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data point selection for piecewise trilinear approximation

✍ Scribed by Bernd Hamann; Jiann-Liang Chen

Book ID
103595947
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
580 KB
Volume
11
Category
Article
ISSN
0167-8396

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Selective sampling for approximate clust
Selective sampling for approximate clustering of very large data sets
✍ Liang Wang; James C. Bezdek; Christopher Leckie; Ramamohanarao Kotagiri πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 506 KB

A key challenge in pattern recognition is how to scale the computational efficiency of clustering algorithms on large data sets. The extension of non-Euclidean relational fuzzy c-means (NERF) clustering to very large (VL = unloadable) relational data is called the extended NERF (eNERF) clustering al

Fixed points, selections and best approx
Fixed points, selections and best approximation for multivalued mappings in -trees
✍ Jack T. Markin πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 175 KB

In an R-tree we consider multivalued mappings with convex values and develop fixed point, selection, and best approximation theorems for nonexpansive and almost lower semicontinuous mappings.