Search results for "Markov"

showing 10 items of 628 documents

Bayesian inference for the extremal dependence

2016

A simple approach for modeling multivariate extremes is to consider the vector of component-wise maxima and their max-stable distributions. The extremal dependence can be inferred by estimating the angular measure or, alternatively, the Pickands dependence function. We propose a nonparametric Bayesian model that allows, in the bivariate case, the simultaneous estimation of both functional representations through the use of polynomials in the Bernstein form. The constraints required to provide a valid extremal dependence are addressed in a straightforward manner, by placing a prior on the coefficients of the Bernstein polynomials which gives probability one to the set of valid functions. The…

FOS: Computer and information sciencesStatistics and ProbabilityInferenceBernstein polynomialsBivariate analysisBayesian inference01 natural sciencesMethodology (stat.ME)Bayesian nonparametrics010104 statistics & probabilitysymbols.namesakeGeneralised extreme value distribution0502 economics and business62G07Applied mathematics62G05Degree of a polynomial0101 mathematicsStatistics - Methodology050205 econometrics MathematicsAngular measureMax-stable distributionGENERALISED EXTREME VALUE DISTRIBUTION EXTREMAL DEPENDENCE ANGULAR MEASURE MAX-STABLE DISTRIBUTION BERNSTEIN POLYNOMIALS BAYESIAN NONPARAMETRICS TRANS-DIMENSIONAL MCMC EXCHANGE RATEExchange rates05 social sciencesNonparametric statisticsMarkov chain Monte CarloBernstein polynomialGENERALISED EXTREME VALUE DISTRIBUTION; EXTREMAL DEPENDENCE; ANGULAR MEASURE; MAX-STABLE DISTRIBUTION; BERNSTEIN POLYNOMIALS; BAYESIAN NONPARAMETRICS; TRANS-DIMENSIONAL MCMC; EXCHANGE RATETrans-dimensional MCMCEXCHANGE RATEsymbolsStatistics Probability and UncertaintySettore SECS-S/01 - StatisticaMaximaExtremal dependence62G32Electronic Journal of Statistics
researchProduct

Grapham: Graphical models with adaptive random walk Metropolis algorithms

2008

Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementation covering several such methods, with emphasis on graphical models for directed acyclic graphs. The implemented algorithms include the seminal Adaptive Metropolis algorithm adjusting the proposal covariance according to the history of the chain and a Metropolis algorithm adjusting the proposal scale based on the observed acceptance probability. Different variants of the algorithms allow one, for example, to use these two algorithms together, employ delayed rejection and adjust several parameters of the algorithm…

FOS: Computer and information sciencesStatistics and ProbabilityMarkov chainAdaptive algorithmApplied MathematicsRejection samplingMarkov chain Monte CarloMultiple-try MetropolisStatistics - ComputationStatistics::ComputationComputational Mathematicssymbols.namesakeMetropolis–Hastings algorithmComputational Theory and MathematicssymbolsGraphical modelAlgorithmComputation (stat.CO)MathematicsGibbs samplingComputational Statistics & Data Analysis
researchProduct

Mixture Hidden Markov Models for Sequence Data: The seqHMM Package in R

2019

Sequence analysis is being more and more widely used for the analysis of social sequences and other multivariate categorical time series data. However, it is often complex to describe, visualize, and compare large sequence data, especially when there are multiple parallel sequences per subject. Hidden (latent) Markov models (HMMs) are able to detect underlying latent structures and they can be used in various longitudinal settings: to account for measurement error, to detect unobservable states, or to compress information across several types of observations. Extending to mixture hidden Markov models (MHMMs) allows clustering data into homogeneous subsets, with or without external covariate…

FOS: Computer and information sciencesStatistics and ProbabilityMultivariate statisticssequence analysisaikasarjatComputer sciencerMarkov modelStatistics - ComputationStatistics - Applications01 natural sciencesUnobservablecategorical time seriesR-kieli010104 statistics & probabilitymulti-channel sequences; categorical time series; visualizing sequence data; visualizing models; latent Markov models; latent class models; RCovariateApplications (stat.AP)Sannolikhetsteori och statistikComputer software0101 mathematicsTime seriesProbability Theory and StatisticsHidden Markov modelCluster analysislcsh:Statisticslcsh:HA1-4737Categorical variableComputation (stat.CO)ta112business.industryvisualizing sequence dataR (programming languages)Pattern recognitionmulti-channel sequencesvisualizing modelslatent class modelssekvenssianalyysiArtificial intelligencelatent markov modelstime seriesStatistics Probability and UncertaintybusinessSoftwareJournal of Statistical Software
researchProduct

Efficient Bayesian generalized linear models with time-varying coefficients : The walker package in R

2020

The R package walker extends standard Bayesian general linear models to the case where the effects of the explanatory variables can vary in time. This allows, for example, to model the effects of interventions such as changes in tax policy which gradually increases their effect over time. The Markov chain Monte Carlo algorithms powering the Bayesian inference are based on Hamiltonian Monte Carlo provided by Stan software, using a state space representation of the model to marginalise over the regression coefficients for efficient low-dimensional sampling.

FOS: Computer and information sciencesaikasarjatbayesilainen menetelmäBayesian inferenceMarkovin ketjutRStatistics - Computationlineaariset mallitR-kieliMarkov chain Monte CarloMonte Carlo -menetelmätregressioanalyysiComputation (stat.CO)time-varying regression
researchProduct

The Max-Product Algorithm Viewed as Linear Data-Fusion: A Distributed Detection Scenario

2019

In this paper, we disclose the statistical behavior of the max-product algorithm configured to solve a maximum a posteriori (MAP) estimation problem in a network of distributed agents. Specifically, we first build a distributed hypothesis test conducted by a max-product iteration over a binary-valued pairwise Markov random field and show that the decision variables obtained are linear combinations of the local log-likelihood ratios observed in the network. Then, we use these linear combinations to formulate the system performance in terms of the false-alarm and detection probabilities. Our findings indicate that, in the hypothesis test concerned, the optimal performance of the max-product a…

FOS: Computer and information sciencesfactor graphsComputer scienceComputer Science - Information TheoryMarkovin ketjut02 engineering and technologyMarkov random fieldsalgoritmit0202 electrical engineering electronic engineering information engineeringMaximum a posteriori estimationmax-product algorithmElectrical and Electronic EngineeringLinear combinationStatistical hypothesis testingdistributed systemsMarkov random fieldspectrum sensingApplied MathematicsNode (networking)Information Theory (cs.IT)linear data-fusionApproximation algorithm020206 networking & telecommunicationsComputer Science Applicationssum-product algorithmPairwise comparisonRandom variableAlgorithmstatistical inference
researchProduct

Designing a framework for assisting depression severity assessment from facial image analysis

2015

Depression is one of the most common mental disorders affecting millions of people worldwide. Developing adjunct tools aiding depression assessment is expected to impact overall health outcomes and treatment cost reduction. To this end, platforms designed for automatic and non-invasive depression assessment could help in detecting signs of the disease on a regular basis, without requiring the physical presence of a mental health professional. Despite the different approaches that can be found in the literature, both in terms of methods and algorithms, a fully satisfactory system for the automatic assessment of depression severity has not been presented as yet. This paper describes a propose…

Facial expressionComputer scienceProcess (engineering)business.industryFeature extractionFeature selectionMachine learningcomputer.software_genreMental healthCurveletArtificial intelligencebusinessHidden Markov modelcomputerDepression (differential diagnoses)2015 IEEE International Conference on Signal and Image Processing Applications (ICSIPA)
researchProduct

A multi-layer method to study genome-scale positions of nucleosomes

2009

AbstractThe basic unit of eukaryotic chromatin is the nucleosome, consisting of about 150 bp of DNA wrapped around a protein core made of histone proteins. Nucleosomes position is modulated in vivo to regulate fundamental nuclear processes. To measure nucleosome positions on a genomic scale both theoretical and experimental approaches have been recently reported. We have developed a new method, Multi-Layer Model (MLM), for the analysis of nucleosome position data obtained with microarray-based approach. The MLM is a feature extraction method in which the input data is processed by a classifier to distinguish between several kinds of patterns. We applied our method to simulated-synthetic and…

Feature extractionNucleosome positioningGenomicsSaccharomyces cerevisiaeComputational biologyHidden Markov Modelchemistry.chemical_compoundSettore BIO/10 - BiochimicaNucleosome positioning Hidden Markov Model Classification Multi-layer methodGeneticsHumansNucleosomeMulti-layer methodHidden Markov modelBase PairingMulti layerOligonucleotide Array Sequence AnalysisGeneticsBase SequenceSettore INF/01 - InformaticabiologyGenome HumanClassificationMarkov ChainsNucleosomesChromatinHistonechemistrybiology.proteinDNAGenomics
researchProduct

Cartels Uncovered

2018

How many cartels are there? The answer is important in assessing the efficiency of competition policy. We present a Hidden Markov Model that answers the question, taking into account that often we do not know whether a cartel exists in an industry or not. Our model identifies key policy parameters from data generated under different competition policy regimes and may be used with time-series or panel data. We take the model to data from a period of legal cartels - Finnish manufacturing industries 1951 - 1990. Our estimates suggest that by the end of the period, almost all industries were cartelized.

Finnish-Soviet tradekilpailupolitiikkajel:L4001 natural sciencesjel:L41jel:L0jel:L60competition lawjel:L00010104 statistics & probabilitykartellit0502 economics and business050207 economics0101 mathematicsta511lainsäädäntöidänkauppa05 social scienceskorporativismiantitrust policykilpailuoikeuslaitAntitrust; cartel; competition; detection; Hidden Markov models; illegal; legal; leniency; policy; registry.jel:L4antitrust; cartel; competition; detection; Hidden Markov models; illegal; legal; leniency; policy; registrykilpailuGeneral Economics Econometrics and Financecartelscorporatism
researchProduct

Obstacle Detection in an Unstructured Industrial Robotic System: Comparison of Hidden Markov Model and Expert System

2012

Abstract This paper presents a comparison of two approaches for detecting unknown obstacles inside the workspace of an industrial robot using a laser rangefinder for 2-D measurements. The two approaches are based on Expert System (ES) and Hidden Markov Model (HMM). The results presented in the paper demonstrate that both approaches are able to correctly detect and classify unknown objects. The ES is characterised by low computational requirements and an easy setup when relatively few known objects are to be included inside the workspace. HMMs are characterised by a higher flexibility and the ability to handle a larger amount of known objects inside the workspace. Another significant benefit…

Flexibility (engineering)Engineeringbusiness.industryContrast (statistics)General MedicineWorkspacecomputer.software_genreExpert systemlaw.inventionIndustrial robotlawObstacleCollision detectionComputer visionArtificial intelligencebusinessHidden Markov modelcomputerIFAC Proceedings Volumes
researchProduct

Prediction and Surveillance Sampling Assessment in Plant Nurseries and Fields

2022

In this paper, we propose a structured additive regression (STAR) model for modeling the occurrence of a disease in fields or nurseries. The methodological approach involves a Gaussian field (GF) affected by a spatial process represented by an approximation to a Gaussian Markov random field (GMRF). This modeling allows the building of maps with prediction probabilities regarding the presence of a disease in plants using Bayesian kriging. The advantage of this modeling is its computational benefit when compared with known spatial hierarchical models and with the Bayesian inference based on Markov chain Monte Carlo (MCMC) methods. Inference through the use of the integrated nested Laplace app…

Fluid Flow and Transfer ProcessesEstadística bayesianaProcess Chemistry and TechnologyGeneral EngineeringModels matemàticsGeneral Materials ScienceBayesian kriging; Bayesian hierarchical models; Gaussian Markov random field (GMRF); integrated nested Laplace approximation (INLA); stochastic partial differential equation (SPDE)InstrumentationComputer Science ApplicationsApplied Sciences
researchProduct