Feature selection has been explored extensively for use in several real-world applications. In this paper, we propose a new method to select a salient subset of features from unlabeled data, and the selected features are then adaptively used to identify natural clusters in the cluster analysis. Unlike previous methods that select salient features for clustering, our method does not require a pr...

The nearest neighbour (NN) classifier is often known as a ‘lazy’ approach but it is still widely used particularly in the systems that require pattern matching. Many algorithms have been developed based on NN in an attempt to improve classification accuracy and to reduce the time taken, especially in large data sets. This paper proposes a new classification technique based on kNearest Neighbour...

Objective. The purpose of this work is to optimize the functioning automated control system heat supply system. connection between flow rate flue gases at inlet waste boiler and temperature carrier far point consumer subject adjustment. Method. methodological basis study is: balance equation for combined cycle plant; principles ensuring specified parameters consumer; mass transfer sanitary stan...

Given a set of n colored points in some d-dimensional Euclidean space, a bichromatic closest (resp. farthest) pair is a closest (resp. farthest) pair of points of different colors. We present efficient algorithms to maintain both a bichromatic closest pair and a bichromatic farthest pair when the the points are fixed but they dynamically change color. We do this by solving the more general prob...

The purpose of this paper is to discuss some recent generalizations of the basic covering radius problem in coding theory. In particular we discuss multiple coverings, multiple coverings of the farthest-o points and weighted coverings.

A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low. The objective may be to minimise maximum distance or cycle length and the solution may have further constraints. Most classes of central cycle problems are NP-hard. This paper investigates insertion heuristics for cent...

William Hamilton argued that even species inhabiting the farthest flung corners of the universe should age. However, a recent study shows that to find a species that escapes ageing, you only need to look as far as your local pond.