0

Infinite Kernel Learning by Semi-infinte Optimization

Integrated with New Model Selection Algorithm

Erschienen am 11.12.2011, Auflage: 1/2011
59,00 €
(inkl. MwSt.)

Lieferbar innerhalb 1 - 2 Wochen

In den Warenkorb
Bibliografische Daten
ISBN/EAN: 9783845434988
Sprache: Englisch
Umfang: 172 S.
Format (T/L/B): 1.1 x 22 x 15 cm
Einband: kartoniertes Buch

Beschreibung

A subfield of artificial intelligence, machine learning (ML), is concerned with the development of algorithms that allow computers to learn. ML is the process of training a system with large number of examples, extracting rules and finding patterns in order to make predictions on new data points (examples). As a first motivation, we develop a model selection tool induced into SVM in order to solve a particular problem of computational biology which is prediction of eukaryotic pro-peptide cleavage site applied on the real data collected from NCBI data bank. Based on our biological example, a generalized model selection method is employed as a generalization for all kinds of learning problems. As the data become heterogeneous and large-scale, single kernel methods become insufficient to classify nonlinear data. Convex combinations of kernels were developed to classify this kind of data. Nevertheless, selection of the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, we propose a novel method of infinite kernel combinations for learning problems with the help of infinite and semi-infinite programming.

Autorenportrait

Dr. Sureyya Ozogur-Akyuz graduated from Mathematics at Middle East Technical University (METU),Turkey and she did her Msc and Phd in Applied Mathematics at METU. Her main research area is Numerical Optimization and Machine Learning She is currently an Assist. Prof at Department of Mathematics and Computer Science at Bahcesehir University, Turkey.