A reformative kernel Fisher discriminant method is proposed, which is directly derived from the naive kernel Fisher discriminant analysis with superiority in classi1cation e2ciency. In the novel method only a part of training patterns, called “signi1cant nodes”, are necessary to be adopted in classifying one test pattern. A recursive algorithm for selecting “signi1cant nodes”, which is the key ...

Automatic processes on seismic data using pattern recognition is one of the interesting fields in geophysical data interpretation. One part is the seismic object detection using different supervised classification methods that finally has an output as a probability cube. Object detection process starts with generating a pickset of two classes labeled as object and non-object and then selecting ...

In this paper, an imprecise data classification is considered using new version of Fisher discriminator, namely interval Fisher. In the conventional formulation of Fisher, elements of within-class scatter matrix (related to covariance matrix between clusters) and between-class scatter matrix (related to covariance matrix of centers of clusters) have single values; but in the interval Fisher, th...

Laplace transform and new homotopy perturbation methods are adopted to study Fisher-type equations analytically. The solutions introduced in this study can be used to obtain the closed form of the solutions if they are required. The combined method needs less work in comparison with the other homotopy perturbation methods and decreases volume of calculations considerably. The method is tested o...

The basic idea behind the Fisher kernel method is to train a (generative) hidden Markov model (HMM) on data to derive a Fisher kernel for a (discriminative) support vector machine (SVM). The Fisher kernel gives a ‘natural’ similarity measure that takes into account the underlying probability distribution. If each data item is a (possibly varying length) sequence, each may be used to train a HMM...

BACKGROUND Rehabilitation of normal function and form is essential in cleft lip repair. In 2005, Dr. David M. Fisher introduced an innovative method, named "an anatomical subunit approximation technique" in unilateral cleft lip repair. According to this method, circumferential incision along the columella on cleft side of the medial flap is continued to the planned top of the Cupid's bow in str...

As the multimedia content of the Web increases techniques to automatically classify this content become more important. In this paper we present a system to classify audio les collected from the Web. The system classi es any audio le as belonging to one of three categories: `speech', `music' and `other'. To classify the audio les, we use the technique of Fisher kernels. The technique as propose...

A new method, called the Fisher kernel method, for detecting remote protein homologies is introduced and shown to perform well in classifying protein domains by SCOP superfamily. The method is a variant of support vector machines using a new kernel function. The kernel function is derived from a hidden Markov model. The general approach of combining generative models like HMMs with discriminati...

This paper aims to compare three collocation point methods associated with the odd order stochastic response surface method (SRSM) in a systematical and quantitative way. The SRSM with the Hermite polynomial chaos is briefly introduced first. Then, three collocation point methods, namely the point method, the root method and the without origin method underlying the odd order SRSMs are highlight...