Search results for "Kernel"

showing 10 items of 357 documents

A brief overview on the numerical behavior of an implicit meshless method and an outlook to future challenges

2015

In this paper recent results on a leapfrog ADI meshless formulation are reported and some future challenges are addressed. The method benefits from the elimination of the meshing task from the pre-processing stage in space and it is unconditionally stable in time. Further improvements come from the ease of implementation, which makes computer codes very flexible in contrast to mesh based solver ones. The method requires only nodes at scattered locations and a function and its derivatives are approximated by means of a kernel representation. A perceived obstacle in the implicit formulation is in the second order differentiations which sometimes are eccesively sensitive to the node configurat…

Regularized meshless methodMathematical optimizationComputer sciencemedia_common.quotation_subjectSPHKernel representationSolverMathematics::Numerical AnalysisTask (project management)ADI leapfrog methodPhysics and Astronomy (all)Settore MAT/08 - Analisi NumericaSettore ING-IND/31 - ElettrotecnicaObstaclemeshless methodNode (circuits)Function (engineering)numerical approximationmedia_commonAIP Conference Proceedings
researchProduct

Non-linear System Identification with Composite Relevance Vector Machines

2007

Nonlinear system identification based on relevance vector machines (RVMs) has been traditionally addressed by stacking the input and/or output regressors and then performing standard RVM regression. This letter introduces a full family of composite kernels in order to integrate the input and output information in the mapping function efficiently and hence generalize the standard approach. An improved trade-off between accuracy and sparsity is obtained in several benchmark problems. Also, the RVM yields confidence intervals for the predictions, and it is less sensitive to free parameter selection. Teoría de la Señal y Comunicaciones

Relevance Vector MachinesTelecomunicacionesNonlinear system identificationbusiness.industryRVMApplied MathematicsNonlinear System IdentificationRegression analysisPattern recognitionComposite kernelsFunction (mathematics)Support vector machineNonlinear systemStatistics::Machine LearningSignal ProcessingBenchmark (computing)3325 Tecnología de las TelecomunicacionesRelevance (information retrieval)Artificial intelligenceElectrical and Electronic EngineeringbusinessMathematicsFree parameter
researchProduct

Discrete Time Signal Processing Framework with Support Vector Machines

2007

Digital signal processing (DSP) of time series using SVM has been addressed in the literature with a straightforward application of the SVM kernel regression, but the assumption of independently distributed samples in regression models is not fulfilled by a time-series problem. Therefore, a new branch of SVM algorithms has to be developed for the advantageous application of SVM concepts when we process data with underlying time-series structure. In this chapter, we summarize our past, present, and future proposal for the SVM-DSP frame-work, which consists of several principles for creating linear and nonlinear SVM algorithms devoted to DSP problems. First, the statement of linear signal mod…

Relevance vector machineSupport vector machineMultidimensional signal processingDiscrete-time signalComputer Science::SoundComputer sciencebusiness.industryKernel regressionbusinessSignalAlgorithmDigital signal processingReproducing kernel Hilbert space
researchProduct

Kernel Spectral Angle Mapper

2016

This communication introduces a very simple generalization of the familiar spectral angle mapper (SAM) distance. SAM is perhaps the most widely used distance in chemometrics, hyperspectral imaging, and remote sensing applications. We show that a nonlinear version of SAM can be readily obtained by measuring the angle between pairs of vectors in a reproducing kernel Hilbert spaces. The kernel SAM generalizes the angle measure to higher-order statistics, it is a valid reproducing kernel, it is universal, and it has consistent geometrical properties that permit deriving a metric easily. We illustrate its performance in a target detection problem using very high resolution imagery. Excellent re…

Remote sensing applicationbusiness.industry010401 analytical chemistry0211 other engineering and technologiesHilbert spaceHyperspectral imagingHigher-order statistics02 engineering and technology01 natural sciencesMeasure (mathematics)0104 chemical sciencessymbols.namesakeSimple (abstract algebra)Kernel (statistics)Metric (mathematics)symbolsComputer visionArtificial intelligenceElectrical and Electronic EngineeringbusinessAlgorithm021101 geological & geomatics engineeringMathematics
researchProduct

A General Frame for Building Optimal Multiple SVM Kernels

2012

The aim of this paper is to define a general frame for building optimal multiple SVM kernels. Our scheme follows 5 steps: formal representation of the multiple kernels, structural representation, choice of genetic algorithm, SVM algorithm, and model evaluation. The computation of the optimal parameter values of SVM kernels is performed using an evolutionary method based on the SVM algorithm for evaluation of the quality of chromosomes. After the multiple kernel is found by the genetic algorithm we apply cross validation method for estimating the performance of our predictive model. We implemented and compared many hybrid methods derived from this scheme. Improved co-mutation operators are u…

Scheme (programming language)Multiple kernel learningbusiness.industryComputationPattern recognitionCross-validationSupport vector machineGenetic algorithmArtificial intelligenceGeneral framebusinesscomputerKernel (category theory)Mathematicscomputer.programming_language
researchProduct

Generalized wavelets design using Kernel methods. Application to signal processing

2013

Abstract Multiresolution representations of data are powerful tools in signal processing. In Harten’s framework, multiresolution transforms are defined by predicting finer resolution levels of information from coarser ones using an operator, called the prediction operator, and defining details (or wavelet coefficients) that are the difference between the exact values and the predicted values. In this paper we present a multiresolution scheme using local polynomial regression theory in order to design a more accurate prediction operator. The stability of the scheme is proved and the order of the method is calculated. Finally, some results are presented comparing our method with the classical…

Scheme (programming language)Polynomial regressionMathematical optimizationSignal processingApplied MathematicsStability (learning theory)Computational MathematicsWaveletKernel methodOperator (computer programming)AlgorithmcomputerMathematicsResolution (algebra)computer.programming_languageJournal of Computational and Applied Mathematics
researchProduct

Exploiting Numerical Behaviors in SPH.

2010

Smoothed Particle Hydrodynamics is a meshless particle method able to evaluate unknown field functions and relative differential operators. This evaluation is done by performing an integral representation based on a suitable smoothing kernel function which, in the discrete formulation, involves a set of particles scattered in the problem domain. Two fundamental aspects strongly characterizing the development of the method are the smoothing kernel function and the particle distribution. Their choice could lead to the so-called particle inconsistency problem causing a loose of accuracy in the approximation; several corrective strategies can be adopted to overcome this problem. This paper focu…

Series (mathematics)Applied MathematicsMeshless particle methodconsistency restoringfunction approximationGeneral ChemistryFunction (mathematics)smoothed particle hydrodinamics methodSmoothed-particle hydrodynamicsSettore MAT/08 - Analisi NumericaFunction approximationDistribution (mathematics)Kernel methodProblem domainCalculusApplied mathematicsparticle distributionSmoothingMathematics
researchProduct

Explicit Granger causality in kernel Hilbert spaces

2020

Granger causality (GC) is undoubtedly the most widely used method to infer cause-effect relations from observational time series. Several nonlinear alternatives to GC have been proposed based on kernel methods. We generalize kernel Granger causality by considering the variables cross-relations explicitly in Hilbert spaces. The framework is shown to generalize the linear and kernel GC methods, and comes with tighter bounds of performance based on Rademacher complexity. We successfully evaluate its performance in standard dynamical systems, as well as to identify the arrow of time in coupled R\"ossler systems, and is exploited to disclose the El Ni\~no-Southern Oscillation (ENSO) phenomenon f…

Series (mathematics)Dynamical systems theoryHilbert spaceFOS: Physical sciencesNonlinear Sciences - Chaotic Dynamics01 natural sciences010305 fluids & plasmassymbols.namesakeKernel methodGranger causalityPhysics - Data Analysis Statistics and ProbabilityKernel (statistics)Arrow of time0103 physical sciencesRademacher complexitysymbolsApplied mathematicsChaotic Dynamics (nlin.CD)010306 general physicsData Analysis Statistics and Probability (physics.data-an)Mathematics
researchProduct

Experimental approach for testing the uncoupling between cardiovascular variability series

2002

In cardiovascular variability analysis, the significance of the coupling between two series is commonly assessed by defining a zero level on the magnitude-squared coherence (MSC). Although the use of the conventional value of 0.5 does not consider the dependence of MSC estimates on the analysis parameters, a theoretical threshold Tt is available only for the weighted covariance (WC) estimator. In this study, an experimental threshold for zero coherence Te was derived by a statistical test from the sampling distribution of MSC estimated on completely uncoupled time series. MSC was estimated by the WC method (Parzen window, spectral bandwidth B = 0.015, 0.02, 0.025, 0.03 Hz) and by the parame…

Series (mathematics)Kernel density estimationModels CardiovascularMyocardial InfarctionBiomedical EngineeringEstimatorComputer Science Applications1707 Computer Vision and Pattern RecognitionSignal Processing Computer-AssistedCoherence (statistics)CovarianceFeedbackComputer Science ApplicationsSpectral analysiElectrocardiographySampling distributionAutoregressive modelCardiovascular variability serieStatisticsHumansMagnitude-squared coherenceParametric statisticsMathematicsMedical & Biological Engineering & Computing
researchProduct

An Observation Framework for Multi-agent Systems

2009

Existing middleware platforms for multi-agent systems (MAS) do not provide general support for observation. On the other hand, observation is considered to be an important mechanism needed for realizing effective and efficient coordination of agents. This paper describes a framework called Agent Observable Environment (AOE) for observation-based interaction in MAS. The framework provides 1) possibility to model MAS components with RDF-based observable soft-bodies, 2) support for both query and publish/subscribe style ontology-driven observation, and 3) ability to restrict the visibility of observable information using observation rules. Additionally, we report on an implementation of the fr…

Service (systems architecture)DatabaseComputer scienceMulti-agent systemReliability (computer networking)Distributed computingVisibility (geometry)JADE (programming language)computer.file_formatcomputer.software_genreComputingMethodologies_ARTIFICIALINTELLIGENCEKernel (linear algebra)Middleware (distributed applications)RDFcomputercomputer.programming_language2009 Fifth International Conference on Autonomic and Autonomous Systems
researchProduct