Results 11 to 20 of about 131,785 (256)

Multiple Kernel k-Means With Low-Rank Neighborhood Kernel

open access: yesIEEE Access, 2021
Multiple kernel clustering algorithms achieve promising performances by exploring the complementary information from kernel matrices corresponding to each data view.
Qiyuan Ou, Long Gao, En Zhu
doaj   +1 more source

Mechanical properties of Bertholletia Excelsa H. B. K. kernels stored in different packagings

open access: yesFood Science and Technology, 2022
Abstract Evaluate texture in relation to the hardness, fracturability, cohesiveness, elasticity and chewiness parameters of Brazil nut kernels stored in different packagings over time of 240 days. The experimental compression tests were conducted in 15 kernels for each treatment using a texturometer equipped with a load cell of 25 kg.
Kênia Borges de OLIVEIRA   +4 more
openaire   +2 more sources

Efficient High-Dimensional Kernel k-Means++ with Random Projection

open access: yesApplied Sciences, 2021
Using random projection, a method to speed up both kernel k-means and centroid initialization with k-means++ is proposed. We approximate the kernel matrix and distances in a lower-dimensional space Rd before the kernel k-means clustering motivated by ...
Jan Y. K. Chan, Alex Po Leung, Yunbo Xie
doaj   +1 more source

A KERNEL METHOD BASED ON TOPIC MODEL FOR VERY HIGH SPATIAL RESOLUTION (VHSR) REMOTE SENSING IMAGE CLASSIFICATION [PDF]

open access: yesThe International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016
A kernel-based method for very high spatial resolution remote sensing image classification is proposed in this article. The new kernel method is based on spectral-spatial information and structure information as well, which is acquired from topic model,
L. Wu, L. Shen, L. Shen, Z. Li
doaj   +1 more source

On the Existence of (k,l)-Kernels in Infinite Digraphs: A Survey

open access: yesDiscussiones Mathematicae Graph Theory, 2014
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively.
Galeana-Sánchez H., Hernández-Cruz C.
doaj   +1 more source

A feasible k-means kernel trick under non-Euclidean feature space

open access: yesInternational Journal of Applied Mathematics and Computer Science, 2020
This paper poses the question of whether or not the usage of the kernel trick is justified. We investigate it for the special case of its usage in the kernel k-means algorithm.
Kłopotek Robert   +2 more
doaj   +1 more source

The Nyström Kernel Conjugate Gradient Algorithm Based on $k$ -Means Sampling

open access: yesIEEE Access, 2020
The kernel conjugate gradient (KCG) algorithms have been proposed to improve the convergence rate and the filtering accuracy of kernel adaptive filters (KAFs) efficiently.
Fuliang He, Kui Xiong, Shiyuan Wang
doaj   +1 more source

A 9k Kernel for Nonseparating Independent Set in Planar Graphs [PDF]

open access: yesTheoretical Computer Science, 2012
An extended abstract was presented at WG ...
Kowalik, Łukasz, Mucha, Marcin
openaire   +2 more sources

Enumeration and Decidable Properties of Automatic Sequences [PDF]

open access: yes, 2011
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or k-regular.
A. Carpi   +21 more
core   +2 more sources

Some Results on 4-Transitive Digraphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
Let D be a digraph with set of vertices V and set of arcs A. We say that D is k-transitive if for every pair of vertices u, v ∈ V, the existence of a uv-path of length k in D implies that (u, v) ∈ A.
García-Vázquez Patricio Ricardo   +1 more
doaj   +1 more source

Home - About - Disclaimer - Privacy