S-truncated Functions and Rough Sets in Approximation and Classification of Bottleneck Polygons
Elisabeth Rakus-Andersson · 2005
Abstract. Some collections of two-dimensional points form very irregular shapes, which cannot be approximated by standard curves without making large errors. We approximate the sets of points to introduce formal mathematical expressions giving rise for future predictions for other points, which are not placed in data sets. To accomplish the thorough approximation of finite point sets we test parametric struncated functions piecewise, which warrants a high accuracy of approximating. By operating with the functions, which represent samples of points obtained during experiments carried out, and by adopting the rough set technique, we attempt a classification of curves. Even if the curves are stretched and shaped differently we will divide them in classes gathering similar objects. To confirm availability and correctitude of the approximation and the classification proposed, we consider an examination of Internet packet streams, especially a bottleneck distribution based on throughput values. 1