Bounded Coordinate-Descent for Biological Sequence Classification in High Dimensional Predictor Space [PDF]
We present a framework for discriminative sequence classification where the learner works directly in the high dimensional predictor space of all subsequences in the training set.
Ifrim, Georgiana, Wiuf, Carsten
core +1 more source
Quality-related fault diagnosis based on -nearest neighbor rule for non-linear industrial processes
The fault diagnosis approaches based on k -nearest neighbor rule have been widely researched for industrial processes and achieve excellent performance. However, for quality-related fault diagnosis, the approaches using k -nearest neighbor rule have been
Zelin Ren +2 more
doaj +1 more source
A sufficient condition for the existence of k-kernels in digraphs
Let \(k\) \((\geq 2)\) be a fixed integer. Let \(D\) be a digraph with the following properties: (i) the spanning subdigraph determined by the asymmetrical arcs of \(D\) is strongly connected; (ii) every directed 3-cycle of \(D\) has at least two symmetrical arcs; (iii) if \(C\) is a directed cycle whose length is not a multiple of \(k\) then either ...
Galeana-Sánchez, H. +1 more
openaire +2 more sources
Kernel Density Estimators for Gaussian Mixture Models
The problem of nonparametric estimation of probability density function is considered. The performance of kernel estimators based on various common kernels and a new kernel K (see (14)) with both fixed and adaptive smoothing bandwidth is compared in ...
Tomas Ruzgas, Indrė Drulytė
doaj +1 more source
Decomposition of Gaussian processes, and factorization of positive definite kernels [PDF]
We establish a duality for two factorization questions, one for general positive definite (p.d.) kernels \(K\), and the other for Gaussian processes, say \(V\). The latter notion, for Gaussian processes is stated via Ito-integration.
Palle Jorgensen, Feng Tian
doaj +1 more source
Multitriangulations, pseudotriangulations and primitive sorting networks [PDF]
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips.
Pilaud, Vincent, Pocchiola, Michel
core +7 more sources
On the Complexity of the 3-Kernel Problem in Some Classes of Digraphs
Let D be a digraph with the vertex set V (D) and the arc set A(D). A subset N of V (D) is k-independent if for every pair of vertices u, v ∈ N, we have d(u, v), d(v, u) ≥ k; it is l-absorbent if for every u ∈ V (D) − N there exists v ∈ N such that d(u, v)
Hell Pavol, Hernández-Cruz César
doaj +1 more source
Hierarchical Multiple Kernel K-Means Algorithm Based on Sparse Connectivity [PDF]
Multiple kernel learning(MKL) aims to find an optimal consistent kernel function.In the hierarchical multiple kernel clustering(HMKC) algorithm,the sample features are extracted layer by layer from high-dimensional space to maximize the retention of ...
WANG Lei, DU Liang, ZHOU Peng
doaj +1 more source
Decoding Sequence Classification Models for Acquiring New Biological Insights [PDF]
Classifying biological sequences is one of the most important tasks in computational biology. In the last decade, support vector machines (SVMs) in combination with sequence kernels have emerged as a de-facto standard.
Andreas Kothmeier +5 more
core +2 more sources
Free-Breathing and Ungated Cardiac MRI Reconstruction Using a Deep Kernel Representation
Free-breathing and ungated cardiac MRI is a challenging problem due to the cardiac motion and respiration motion, which are not tracked. In this work, we propose an unsupervised deep kernel method for reconstructing real-time free-breathing and ungated ...
Qing Zou +3 more
doaj +1 more source

