๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nonlinear integrals with polynomial kernel and its applications

โœ Scribed by JinFeng Wang; KwongSak Leung; KinHong Lee; ZhenYuan Wang; WenZhong Wang; Jun Xu


Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
297 KB
Volume
27
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

โœฆ Synopsis


Nonlinear integrals (NIs) are useful integration tools. It can get a set of virtual values by projecting original data onto a virtual space for classification purpose using NIs. The classical NIs implement projection along a line with respect to the features. But, in many cases, the linear projection cannot achieve good performance for classification or regression due to the limitation of the integrand. The linear function used for the integrand is just a special type of function with respect to the features. In this paper, we propose a nonlinear integrals with polynomial kernel (NIPK). A polynomial function with respect to the features is used as the integrand of NIs. It enables the projection to be along different types of curves to the virtual space so that the virtual values gotten by NIs can be better regularized and have higher separation power for classification. We use genetic algorithm to learn the fuzzy measures so that a larger solution space can be searched. To test the capability of the NIPK, we apply it to classification on several benchmark datasets and a bioinformatics project. Experiments show that there is evident improvement on performance for the NIPK compared to classical NIs.


๐Ÿ“œ SIMILAR VOLUMES


Matching polynomials: A matrix approach
โœ E.J. Farrell; S.A. Wahid ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 426 KB

A new approach is formuiatedfor the matching polynomial m(G) of a graph G. A matrix A(G) is associated with G. A certain function de$ned on A(G) yields the matching polynomial of G. This approach leads to a simple characterization of m(G). It also facilitates a technique for constructing graphs with

Kernel mutual subspace method and its ap
โœ Hitoshi Sakano; Naoki Mukawa; Taichi Nakamura ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 308 KB

In this paper, the authors propose a new object recognition algorithm called the kernel mutual subspace method. The mutual subspace method proposed by Maeda is a superior technique for implementing robust object recognition by performing a principal component analysis on multiple input images. Howev