Results 31 to 40 of about 111,097 (310)
A Dimension Reduction Framework for HSI Classification Using Fuzzy and Kernel NFLE Transformation
Remote Sensing, 2015 In this paper, a general nearest feature line (NFL) embedding (NFLE) transformation called fuzzy-kernel NFLE (FKNFLE) is proposed for hyperspectral image (HSI) classification in which kernelization and fuzzification are simultaneously considered.
Ying-Nong Chen +4 more
doaj +1 more source
IEEE Access, 2021 For finding keys to understand and elucidate a phenomenon, it is essential to detect dependences among variables, and so measures for that have been proposed.
Miho Ohsaki +7 more
doaj +1 more source
Scalable Kernelization for Maximum Independent Sets [PDF]
, 2019 The most efficient algorithms for finding maximum independent sets in both theory and practice use reduction rules to obtain a much smaller problem instance called a kernel.
Hespe, Demian +2 more
core +3 more sources
Cross-Composition: A New Technique for Kernelization Lower Bounds [PDF]
, 2010 We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance of Q with polynomially bounded parameter value can express the logical OR of
Bodlaender, Hans L. +2 more
core +5 more sources
, 2023 This chapter introduces a powerful class of machine learning approaches called kernel methods, which present an alternative to arguably more widely known neural network approaches. Kernel methods can learn even highly nonlinear problems by making an implicit transformation from a low-dimensional input space into a higher-dimensional feature space. This
Pinheiro Jr, Max, Dral, Pavlo
openaire +1 more source
A Kernelized Unified Framework for Domain Adaptation
IEEE Access, 2019 The performance of the supervised learning algorithms such as k-nearest neighbor (k-NN) depends on the labeled data. For some applications (Target Domain), obtaining such labeled data is very expensive and labor-intensive.
Rakesh Kumar Sanodiya +3 more
doaj +1 more source
FPT is Characterized by Useful Obstruction Sets [PDF]
, 2013 Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one way of ...
Fellows, Michael R., Jansen, Bart M. P.
core +1 more source
Efficient Kernel Cook's Distance for Remote Sensing Anomalous Change Detection
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2020 Detecting anomalous changes in remote sensing images is a challenging problem, where many approaches and techniques have been presented so far. We rely on the standard field of multivariate statistics of diagnostic measures, which are concerned about the
Jose Antonio Padron-Hidalgo +4 more
doaj +1 more source
An Approximate Kernel for Connected Feedback Vertex Set [PDF]
, 2019 The Feedback Vertex Set problem is a fundamental computational problem which has been the subject of intensive study in various domains of algorithmics. In this problem, one is given an undirected graph G and an integer k as input.
Ramanujan, M. S.
core +1 more source
Subsampling Realised Kernels [PDF]
SSRN Electronic Journal, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barndorff-Nielsen, Ole Eiler +3 more
openaire +6 more sources