We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors and the number of half-spaces it achieves on the training data. We show that it provides a favorable alternative to data-dependent balls on some natural data sets. Compared to the support vector machine, the set covering...

In recent years, several frameworks and systems have been proposed that extend Inductive Logic Programming (ILP) to the Answer Set Programming (ASP) paradigm. In ILP, examples must all be explained by a hypothesis together with a given background knowledge. In existing systems, the background knowledge is the same for all examples; however, examples may be context-dependent. This means that som...

    M. and M.   Abstract: Existence and uniqueness of solution for singular 2-D systems depends on regularity condition. Simple regularity implies regularity and under this assumption, the generalized wave model (GWM) is introduced to cast singular 2-D system of equations as a family of non-singular 1-D models with variable structure.These index dependent models, along with a set of boundary co...

We have searched for chemical transformations that improve drug development-relevant properties within a given class of active compounds, regardless of the compounds they are applied to. For different compound data sets, varying numbers of frequently occurring data set-dependent transformations were identified that consistently induced favorable changes of selected molecular properties. Sequenc...

Voice biometrics for user authentication is a task in which the object is to perform convenient, robust and secure authentication of speakers. Recently we have investigated the use of state-of-the-art text-independent and text-dependent speaker verification technology for user authentication and obtained satisfactory results within a framework of a proof of technology. However, the use we have ...

While optical character recognition is field where machine learning algorithms are easily applied, it might not always be cost effective to do so. While Viola and Jones explored Haar features in their face detection algorithm, selecting from the thousands of features is quite time consuming. This paper compares their feature set with a baseline of pixel learners as well as another set of Haar f...

We study the asymptotic properties of the conditional empirical process based on b F n (Cjx) = n X t=1 ! n (X t ? x)I fYt2Cg indexed by C 2 C, where f(X t ; Y t); t = 1; : : :; ng are observations from a strong mixing stochas-tic process, f! n (X t ? x)g denote some kernel weights, and C is a class of sets. Under the assumption on the richness of the index class C in terms of metric entropy wit...

In this manuscript, we consider the inverse problem for non self-adjoint Sturm--Liouville operator $-D^2+q$ with eigenparameter dependent boundary and discontinuity conditions inside a finite closed interval. We prove by defining a new Hilbert space and using spectral data of a kind, the potential function can be uniquely determined by a set of value of eigenfunctions at an interior point and p...

1 Preliminaries 2 1.1 Vector spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Complexity of optimization problems . . . . . . . . . . . . . . . . 2 1.2.1 Single-objective optimization problems . . . . . . . . . . . 2 1.2.2 Multi-objective optimization problems . . . . . . . . . . . 2 1.3 Parameterized complexity . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Largest low...