We propose to learn multiple local Mahalanobis distance metrics to perform knearest neighbor (kNN) classification of temporal sequences. Temporal sequences are first aligned by dynamic time warping (DTW); given the alignment path, similarity between two sequences is measured by the DTW distance, which is computed as the accumulated distance between matched temporal point pairs along the alignme...

This paper describes a novel framework for the Open World face recognition problem, where one has to provide for the Reject option. Based upon algorithmic randomness and transduction, a particular form of induction, we describe the TCM-kNN (Transduction Confidence Machine – kNearest Neighbor) algorithm for Open World face recognition. The algorithm proposed performs much better than PCA and is ...

Patent processing is important in industry, business, and law. We participated in the classification subtask (at NTCIR-6 Patent Retrieval Task), in which, we classified patent documents into their F-terms using the knearest neighbor method. For document classification, F-term categories are both very precise and useful. We entered five systems in the classification subtask and obtained good res...

Recently, some non-coding small RNAs, known as microRNAs (miRNA), have drawn a lot of attention to identify their role in gene regulation and various biological processes. The miRNA profiles are surprisingly informative, reflecting the malignancy state of the tissues. In this paper, we attempt to explore extensive features and classifiers through a comparative study of the most promising featur...

Facial Expression is a key component in evaluating a person's feelings, intentions and characteristics. Facial Expression is an important part of human-computer interaction and has the potential to play an equal important role in humancomputer interaction. The aim of this paper is bring together two areas in which are Artificial Neural Network (ANN) and KNearest Neighbor (K-NN) applying for fac...

This paper describes the generation and utilisation of a pattern database for 19x19 go with the Knearest-neighbor representation. Patterns are generated by browsing recorded games of professional players. Meanwhile, their matching and playing probabilities are estimated. The database created is then integrated into an existing go program, INDIGO, either as an opening book or as an enrichment of...

A classification technique is an organized approach for building classification model from given input dataset. The learning algorithm of each technique is employed to build a model used to find the relationship between attribute set and class label of the given input data. Presence of irrelevant information in the data set reduces the speed and quality of learning. The technique of feature sel...

Many distance-related algorithms, such as knearest neighbor learning algorithms, locally weighted learning algorithms etc, depend upon a good distance metric to be successful. In this kind of algorithms, a key problem is how to measure the distance between each pair of instances. In this paper, we provide a survey on distance metrics for nominal attributes, including some basic distance metrics...

The sequential structure and variable length of speech data suggests the use of structural techniques such as Hidden Markov Models or Grammatical Inference systems. In contrast, geometric and classical (non-recurrent) connectionist methods deal with objects represented in a vector space. This means that some method has to be used to transform variable-length strings of parameters into d-dimensi...

In this paper, based on a simple genetic algorithm and combine the base ideology of orthogonal design method then applied it to the population initialization, using the intergenerational elite mechanism, as well as the introduction of adaptive local search operator to prevent trapped into the local minimum and improve the convergence speed to form a new genetic algorithm. Through the series of ...