nth-Nearest neighbour distribution functions of a binary fluid mixture

Coevolving Functions in Genetic Programming: Classification using K-nearest-neighbour

k-Nearest Neighbour Classifiers

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...

Enhanced Nearest Neighbour

Multimedia databases usually deal with huge amounts of data and it is necessary to have an indexing structure such that eecient retrieval of data can be provided. R-Tree with its variations, is a commonly cited indexing method. In this paper we propose an improved nearest neighbor search algorithm on the R-tree and its variants. The improvement lies in the removal of two hueristics that have be...

Random Binary Trees for Approximate Nearest Neighbour Search in Binary Space

Approximate nearest neighbour (ANN) search is one of the most important problems in computer science fields such as data mining or computer vision. In this paper, we focus on ANN for high-dimensional binary vectors and we propose a simple yet powerful search method that uses Random Binary Search Trees (RBST). We apply our method to a dataset of 1.25M binary local feature descriptors obtained fr...

Wetting of a symmetrical binary fluid mixture on a wall.

We study the wetting behavior of a symmetrical binary fluid below the demixing temperature at a nonselective attractive wall. Although it demixes in the bulk, a sufficiently thin liquid film remains mixed. On approaching liquid vapor coexistence, however, the thickness of the liquid film increases and it may demix and then wet the substrate. We show that the wetting properties are determined by...