A feasible algorithm for locating concave and convex zones of interval data and its use in statistics-based clustering

DOI10.1023/B:NUMA.0000049469.02043.24zbMath1114.91091MaRDI QIDQ2387767

Eric J. Pauwels, Scott A. Ferson, Lev R. Ginzburg, Vladik Ya. Kreinovich

Publication date: 5 September 2005

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

clusteringstatistical methodsKolmogorov-Smirnov statisticconvex segments of interval data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20) Sampling theory, sample surveys (62D05) Algorithms with automatic result verification (65G20)

Related Items (2)

Unimodality, independence lead to NP-hardness of interval probability problems ⋮ Checking if there exist a monotonic function that is consistent with the measurements: an efficient algorithm

This page was built for publication: A feasible algorithm for locating concave and convex zones of interval data and its use in statistics-based clustering