On implementation theory

Download
1999
Celmanbet, Ömür

Suggestions

On numerical optimization theory of infinite kernel learning
Ozogur-Akyuz, S.; Weber, Gerhard Wilhelm (2010-10-01)
In Machine Learning algorithms, one of the crucial issues is the representation of the data. As the given data source become heterogeneous and the data are large-scale, multiple kernel methods help to classify "nonlinear data". Nevertheless, the finite combinations of kernels are limited up to a finite choice. In order to overcome this discrepancy, a novel method of "infinite" kernel combinations is proposed with the help of infinite and semi-infinite programming regarding all elements in kernel space. Look...
On generalized semi-infinite programming - Discussion
Weber, Gerhard Wilhelm; Tezel, A. (2006-06-01)
This paper surveys some basic properties of the class of generalized semi-infinite programming problems (GSIP) where the infinite index set of inequality constraints depends on the state variables and all emerging functions are assumed to be continuously differentiable. There exists a wide range of applications which can be modelled as a (GSIP). The paper discusses extensions of the Mangasarian-Fromovitz, Kuhn-Tucker and Abadie constraint qualification to (GSIP) and presents related first order optimality c...
On the concept of "field" in architectural theory and practice
Kuzlu, Emre; Aközer, Emel; Department of Architecture (2004)
This study aims at explaining the significance of the أfieldؤ concept in contemporary architecture and urbanism, in reference to the technical definitions of the term in different disciplines. In this context, it investigates the concepts of أfieldؤ in physics, psychology, art theory and criticism. It highlights the reinterpretation of the أfieldؤ concept in physics by eminent Gestalt psychologists, and its consequences for architecture and urbanism. Starting from the definitions of the concept of أfieldؤ b...
On Equivalence Relationships Between Classification and Ranking Algorithms
Ertekin Bolelli, Şeyda (2011-10-01)
We demonstrate that there are machine learning algorithms that can achieve success for two separate tasks simultaneously, namely the tasks of classification and bipartite ranking. This means that advantages gained from solving one task can be carried over to the other task, such as the ability to obtain conditional density estimates, and an order-of-magnitude reduction in computational time for training the algorithm. It also means that some algorithms are robust to the choice of evaluation metric used; the...
On the theory of conventional and high Tc superconductivity
Öğüt, Ali Serdar; Ellialtıoğlu, Şinasi; Department of Physics (1990)
Citation Formats
Ö. Celmanbet, “On implementation theory,” Middle East Technical University, 1999.