Description:
The classical Remez algorithm was developed for constructing the best polynomial approximations for continuous and discrete functions in an interval [a, b]. In this paper, the classical Remez algorithm is generalized to the problem of linear spline approximation with certain conditions on the spline parameters. Namely, the spline parameters have to be nonnegative and the values of the splines at one of the borders (or both borders) of the approximation intervals may be fixed. This type of constraint occurs in some practical applications, e.g. the problem of taxation tables restoration. The results of the numerical experiments with a Remez-like algorithm developed for this class of conditional optimization problems, are presented.
Description:
The classical Remez algorithm was developed for constructing the best polynomial approximations for continuous and discrete functions in an interval. In this paper the classical Remez algorithm is generalised to the problem of polynomial spline (piece-wise polynomial) approximation with the spline defect equal to the spline degree. Also, the values of the splines in the end points of the approximation interval may be fixed Polynomial splines combine simplicity of polynomials and flexibility, which allows one to significantly decrease the degree of the corresponding polynomials and oscillations of deviation functions. Therefore polynomial splines are a powerful tool for function and data approximation. The generalisation of the Remez algorithm developed in this research has been tested on several approximation problems. The results of the numerical experiments are presented.
Description:
Several clustering methods based on optimisation have been developed recently. One of them is based on minimisation of the cluster function. This function is nonsmooth, nonconvex and extremely multi extremal. Minimisation of such functions is a challenging task. This process can be also very time consuming, especially if the dimension of the corresponding optimisation problem and the size of the dataset are large. In this paper we propose an approach which allows one to run programs in parallel using several CPUs simultaneously. We discuss several possible ways for design parallel implementations for the program and present results of numerical experiments.
Description:
The problem of data approximation is of great interest. There are a lot of approaches to solve this problem. One of them is a polynomial spline approximation. In this paper we propose a new algorithm for polynomial spline approximation based on nonsmooth optimization techniques. Numerical experiments using this algorithm have been carried out. The results are presented and discussed.
Description:
In this paper, we study the problem of best Chebyshev approximation by linear splines. We construct linear splines as a max - min of linear functions. Then we apply nonsmooth optimisation techniques to analyse and solve the corresponding optimisation problems. This approach allows us to identify and introduce a new important property of linear spline knots (regular and irregular). Using this property, we derive a necessary optimality condition for the case of regular knots. This condition is stronger than those existing in the literature. We also present a numerical example which demonstrates the difference between the old and the new optimality conditions.
Description:
Very often in data classification problems we have to determine a shape of a finite set of points within datasets. One of the most common approaches to represent such sets is to determine them as collections of several groups of points. The goal of this project is to develop some algorithms to find a shape for each group. Numerical experiments using the Discrete Gradient method have been done. The results are presented.
Description:
Very often in data classification problems we have to determine a shape of a finite set of points within datasets. One of the most common approaches to represent such sets is to determine them as collections of several groups of points. The goal of this project is to develop some algorithms to find a shape for each group. Numerical experiments using the Discrete Gradient method have been done. The results are presented.
Description:
The diagnosis of many sleep disorders is a labour intensive task that involves the specialised interpretation of numerous signals including brain wave, breath and heart rate captured in overnight polysomnogram sessions. The automation of diagnoses is challenging for data mining algorithms because the data sets are extremely large and noisy, the signals are complex and specialist's analyses vary. This work reports on the adaptation of approaches from four fields; neural networks, mathematical optimisation, financial forecasting and frequency domain analysis to the problem of automatically determing a patient's stage of sleep. Results, though preliminary, are promising and indicate that combined approaches may prove more fruitful than the reliance on a approach.
Description:
The diagnosis of many sleep disorders is a labour intensive task that involves the specialised interpretation of numerous signals including brain wave, breath and heart rate captured in overnight polysomnogram sessions. The automation of diagnoses is challenging for data mining algorithms because the data sets are extremely large and noisy, the signals are complex and specialist's analyses vary. This work reports on the adaptation of approaches from four fields; neural networks, mathematical optimisation, financial forecasting and frequency domain analysis to the problem of automatically determing a patient's stage of sleep. Results, though preliminary, are promising and indicate that combined approaches may prove more fruitful than the reliance on a approach.
Description:
We discuss the relation between classes and clusters in datasets with given classes. We examine the distribution of classes within obtained clusters, using different clustering methods which are based on different techniques. We also study the structure of the obtained clusters. One of the main conclusions, obtained in this research is that the notion purity cannot be always used for evaluation of accuracy of clustering techniques. (c) 2005 Elsevier B.V. All rights reserved.
Description:
We discuss the relation between classes and clusters in datasets with given classes. We examine the distribution of classes within obtained clusters, using different clustering methods which are based on different techniques. We also study the structure of the obtained clusters. One of the main conclusions, obtained in this research is that the notion purity cannot be always used for evaluation of accuracy of clustering techniques. (c) 2005 Elsevier B.V. All rights reserved.
Description:
In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions of varying degree from one interval to another. Based on these results, we obtain a characterization theorem for the polynomial splines with fixed tails, that is the value of the spline is fixed in one or more knots (external or internal). We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity in the sense of Demyanov-Rubinov. This paper is an extension of a paper where similar conditions were obtained for free tails splines. The main results of this paper are essential for the development of a Remez-type algorithm for free knot spline approximation.
Description:
In this paper, we derive a necessary condition for a best approximation by piecewise polynomial functions of varying degree from one interval to another. Based on these results, we obtain a characterization theorem for the polynomial splines with fixed tails, that is the value of the spline is fixed in one or more knots (external or internal). We apply nonsmooth nonconvex analysis to obtain this result, which is also a necessary and sufficient condition for inf-stationarity in the sense of Demyanov-Rubinov. This paper is an extension of a paper where similar conditions were obtained for free tails splines. The main results of this paper are essential for the development of a Remez-type algorithm for free knot spline approximation.
Description:
The problem of cluster analysis is formulated as a problem of non-smooth, non-convex optimization, and an algorithm for solving the cluster analysis problem based on non-smooth optimization techniques is developed. We discuss applications of this algorithm in large databases. Results of numerical experiments are presented to demonstrate the effectiveness of this algorithm.
Description:
In this paper, we extend a number of important results of the classical Chebyshev approximation theory to the case of simultaneous approximation of two or more functions. The need for this extension is application driven, since such kind of problems appears in the area of curve (signal) clustering. In this paper, we propose a new efficient algorithm for signal clustering and develop a procedure that allows one to reuse the results obtained at the previous iteration without recomputing the cluster centres from scratch. This approach is based on the extension of the classical de la Vallee-Poussin procedure originally developed for polynomial approximation. We also develop necessary and sufficient optimality conditions for two curve Chebyshev approximation, which is our core tool for curve clustering. These results are based on application of nonsmooth convex analysis. (C) 2019 Elsevier Inc. All rights reserved. In this paper, we extend a number of important results of the classical Chebyshev approximation theory to the case of simultaneous approximation of two or more functions. The need for this extension is application driven, since such kind of problems appears in the area of curve (signal) clustering. In this paper, we propose a new efficient algorithm for signal clustering and develop a procedure that allows one to reuse the results obtained at the previous iteration without recomputing the cluster centres from scratch. This approach is based on the extension of the classical de la Vallee-Poussin procedure originally developed for polynomial approximation. We also develop necessary and sufficient optimality conditions for two curve Chebyshev approximation, which is our core tool for curve clustering. These results are based on application of nonsmooth convex analysis. (C) 2019 Elsevier Inc. All rights reserved.
Description:
In this paper, we extend a number of important results of the classical Chebyshev approximation theory to the case of simultaneous approximation of two or more functions. The need for this extension is application driven, since such kind of problems appears in the area of curve (signal) clustering. In this paper, we propose a new efficient algorithm for signal clustering and develop a procedure that allows one to reuse the results obtained at the previous iteration without recomputing the cluster centres from scratch. This approach is based on the extension of the classical de la Vallee-Poussin procedure originally developed for polynomial approximation. We also develop necessary and sufficient optimality conditions for two curve Chebyshev approximation, which is our core tool for curve clustering. These results are based on application of nonsmooth convex analysis. (C) 2019 Elsevier Inc. All rights reserved. In this paper, we extend a number of important results of the classical Chebyshev approximation theory to the case of simultaneous approximation of two or more functions. The need for this extension is application driven, since such kind of problems appears in the area of curve (signal) clustering. In this paper, we propose a new efficient algorithm for signal clustering and develop a procedure that allows one to reuse the results obtained at the previous iteration without recomputing the cluster centres from scratch. This approach is based on the extension of the classical de la Vallee-Poussin procedure originally developed for polynomial approximation. We also develop necessary and sufficient optimality conditions for two curve Chebyshev approximation, which is our core tool for curve clustering. These results are based on application of nonsmooth convex analysis. (C) 2019 Elsevier Inc. All rights reserved.
Description:
We examine various methods for data clustering and data classification that are based on the minimization of the so-called cluster function and its modications. These functions are nonsmooth and nonconvex. We use Discrete Gradient methods for their local minimization. We consider also a combination of this method with the cutting angle method for global minimization. We present and discuss results of numerical experiments.
Description:
We examine various methods for data clustering and data classification that are based on the minimization of the so-called cluster function and its modications. These functions are nonsmooth and nonconvex. We use Discrete Gradient methods for their local minimization. We consider also a combination of this method with the cutting angle method for global minimization. We present and discuss results of numerical experiments.