Search results for "Probability Theory"

showing 10 items of 269 documents

Probabilistic entailment in the setting of coherence: The role of quasi conjunction and inclusion relation

2013

In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F.…

FOS: Computer and information sciencesClass (set theory)Goodman–Nguyen’s inclusion relationQAND ruleSettore MAT/06 - Probabilita' E Statistica MatematicaComputer Science - Artificial IntelligenceMathematics - Statistics TheoryStatistics Theory (math.ST)Logical consequencegoodman-nguyen's inclusion relationTheoretical Computer ScienceArtificial IntelligenceQuasi conjunctionFOS: MathematicsEquivalence (measure theory)MathematicsEvent (probability theory)Discrete mathematicsSettore INF/01 - InformaticaApplied MathematicsProbability (math.PR)quasi conjunction; goodman-nguyen inclusion relation; qand rule; coherence; probabilistic default reasoning; p-entailment; goodman-nguyen's inclusion relationProbabilistic logicCoherence (statistics)Conjunction (grammar)Greatest elementArtificial Intelligence (cs.AI)Probabilistic default reasoninggoodman-nguyen inclusion relationp-EntailmentCoherenceSoftwareMathematics - Probability
researchProduct

Kernel methods and their derivatives: Concept and perspectives for the earth system sciences.

2020

Kernel methods are powerful machine learning techniques which implement generic non-linear functions to solve complex tasks in a simple way. They Have a solid mathematical background and exhibit excellent performance in practice. However, kernel machines are still considered black-box models as the feature mapping is not directly accessible and difficult to interpret.The aim of this work is to show that it is indeed possible to interpret the functions learned by various kernel methods is intuitive despite their complexity. Specifically, we show that derivatives of these functions have a simple mathematical formulation, are easy to compute, and can be applied to many different problems. We n…

FOS: Computer and information sciencesComputer Science - Machine LearningSupport Vector MachineTheoretical computer scienceComputer scienceEntropyKernel FunctionsNormal Distribution0211 other engineering and technologies02 engineering and technologyMachine Learning (cs.LG)Machine LearningStatistics - Machine LearningSimple (abstract algebra)0202 electrical engineering electronic engineering information engineeringOperator TheoryData ManagementMultidisciplinaryGeographyApplied MathematicsSimulation and ModelingQRDensity estimationKernel methodKernel (statistics)Physical SciencessymbolsMedicine020201 artificial intelligence & image processingAlgorithmsResearch ArticleComputer and Information SciencesScienceMachine Learning (stat.ML)Research and Analysis MethodsKernel MethodsKernel (linear algebra)symbols.namesakeArtificial IntelligenceSupport Vector MachinesHumansEntropy (information theory)Computer SimulationGaussian process021101 geological & geomatics engineeringData VisualizationCorrectionRandom VariablesFunction (mathematics)Probability TheorySupport vector machineAlgebraPhysical GeographyLinear AlgebraEarth SciencesEigenvectorsRandom variableMathematicsEarth SystemsPLoS ONE
researchProduct

A Quantum Lovasz Local Lemma

2012

The Lovasz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of "weakly dependent" criteria. We show that the LLL extends to a much more general geometric setting, where events are replaced with subspaces and probability is replaced with relative dimension, which allows to lower bound the dimension of the intersection of vector spaces under certain independence conditions. Our result immediately applies to the k-QSAT problem: For instance we show that any collection of rank 1 projectors with the property that each qubit appears in at most $2^k/(e \cdot k)$ of them, has a joint satisfiable state. We then …

FOS: Computer and information sciencesRank (linear algebra)FOS: Physical sciences0102 computer and information sciencesComputational Complexity (cs.CC)01 natural sciencesUpper and lower boundsCombinatoricsIntersectionProbability theoryArtificial Intelligence0103 physical sciences010306 general physicsLovász local lemmaIndependence (probability theory)Quantum computerMathematicsDiscrete mathematicsQuantum PhysicsComputer Science - Computational ComplexityHardware and ArchitectureControl and Systems Engineering010201 computation theory & mathematicsQubitQuantum Physics (quant-ph)SoftwareInformation SystemsVector space
researchProduct

Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects

2013

We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on $n$ conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are rules for which any finite family of conditional events p-entails the associated quasi conjunction and quasi disjunction. We examine some cases of logical de…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaInformation Systems and ManagementComputer Science - Artificial Intelligencet-Norms/conormDuality (mathematics)goodman-nguyen inclusion relation; lower/upper probability bounds; t-norms/conorms; generalized loop rule; coherence; quasi conjunction/disjunctionComputer Science::Artificial IntelligenceTheoretical Computer ScienceArtificial IntelligenceFOS: MathematicsProbabilistic analysis of algorithmsNon-monotonic logicRule of inferenceLower/upper probability boundGoodman–Nguyen inclusion relationMathematicsEvent (probability theory)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniDiscrete mathematicsInterpretation (logic)Probability (math.PR)Probabilistic logicCoherence (philosophical gambling strategy)Generalized Loop ruleComputer Science ApplicationsAlgebraArtificial Intelligence (cs.AI)Control and Systems EngineeringQuasi conjunction/disjunctionCoherenceMathematics - ProbabilitySoftwareInformation Sciences
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

KFAS : Exponential Family State Space Models in R

2017

State space modelling is an efficient and flexible method for statistical inference of a broad class of time series and other data. This paper describes an R package KFAS for state space modelling with the observations from an exponential family, namely Gaussian, Poisson, binomial, negative binomial and gamma distributions. After introducing the basic theory behind Gaussian and non-Gaussian state space models, an illustrative example of Poisson time series forecasting is provided. Finally, a comparison to alternative R packages suitable for non-Gaussian time series modelling is presented.

FOS: Computer and information sciencesStatistics and ProbabilityaikasarjatGaussianNegative binomial distributionforecastingPoisson distribution01 natural sciencesStatistics - ComputationMethodology (stat.ME)010104 statistics & probability03 medical and health sciencessymbols.namesake0302 clinical medicineExponential familyexponential familyGamma distributionStatistical inferenceState spaceApplied mathematicsSannolikhetsteori och statistik030212 general & internal medicine0101 mathematicsProbability Theory and Statisticslcsh:Statisticslcsh:HA1-4737Computation (stat.CO)Statistics - MethodologyMathematicsR; exponential family; state space models; time series; forecasting; dynamic linear modelsta112state space modelsSeries (mathematics)RStatistics; Computer softwaresymbolsStatistics Probability and Uncertaintytime seriesSoftwaredynamic linear models
researchProduct

Epistemic uncertainty in fault tree analysis approached by the evidence theory

2012

Abstract Process plants may be subjected to dangerous events. Different methodologies are nowadays employed to identify failure events, that can lead to severe accidents, and to assess the relative probability of occurrence. As for rare events reliability data are generally poor, leading to a partial or incomplete knowledge of the process, the classical probabilistic approach can not be successfully used. Such an uncertainty, called epistemic uncertainty, can be treated by means of different methodologies, alternative to the probabilistic one. In this work, the Evidence Theory or Dempster–Shafer theory (DST) is proposed to deal with this kind of uncertainty. In particular, the classical Fau…

Fault tree analysisEpistemic uncertaintyGeneral Chemical EngineeringProbabilistic logicEnergy Engineering and Power TechnologyInterval (mathematics)Management Science and Operations Researchcomputer.software_genreIndustrial and Manufacturing EngineeringFTARisk analysiEvidence theoryControl and Systems EngineeringSettore ING-IND/17 - Impianti Industriali MeccaniciRare eventsSensitivity analysisData miningUncertainty quantificationSafety Risk Reliability and QualitycomputerUncertainty analysisFood ScienceEvent (probability theory)Mathematics
researchProduct

Estimation of flood design hydrographs using bivariate analysis (copula) and distributed hydrological modelling

2014

Abstract. In this paper a procedure to derive Flood Design Hydrographs (FDH) using a bivariate representation of rainfall forcing (rainfall duration and intensity) using copulas, which describe and model the correlation between these two variables independently of the marginal laws involved, coupled with a distributed rainfall-runoff model is presented. Rainfall-runoff modelling for estimating the hydrological response at the outlet of a watershed used a conceptual fully distributed procedure based on the soil conservation service – curve number method as excess rainfall model and a distributed unit hydrograph with climatic dependencies for the flow routing. Travel time computation, based o…

Flood mythHydrological modellingStatisticsEconometricsHydrographBivariate analysisCopula (probability theory)Mathematics
researchProduct

Stability in a System subject to Noise with Regulated Periodicity

2011

The stability of a simple dynamical system subject to multiplicative one-side pulse noise with hidden periodicity is investigated both analytically and numerically. The stability analysis is based on the exact result for the characteristic functional of the renewal pulse process. The influence of the memory effects on the stability condition is analyzed for two cases: (i) the dead-time-distorted poissonian process, and (ii) the renewal process with Pareto distribution. We show that, for fixed noise intensity, the system can be stable when the noise is characterized by high periodicity and unstable at low periodicity.

Fluctuation phenomena random processes noise and Brownian motionPeriodicityStochastic processProbability theory stochastic processes and statisticStochastic analysis methodsOrnstein–Uhlenbeck processModels TheoreticalStability (probability)Settore FIS/03 - Fisica Della MateriaStable processsymbols.namesakeStochastic differential equationNoiseControl theorysymbolsPareto distributionRenewal theoryStatistical physicsMathematics
researchProduct

Two competing species in super-diffusive dynamical regimes

2010

The dynamics of two competing species within the framework of the generalized Lotka-Volterra equations, in the presence of multiplicative alpha-stable Lévy noise sources and a random time dependent interaction parameter, is studied. The species dynamics is characterized by two different dynamical regimes, exclusion of one species and coexistence of both, depending on the values of the interaction parameter, which obeys a Langevin equation with a periodically fluctuating bistable potential and an additive alpha-stable Lévy noise. The stochastic resonance phenomenon is analyzed for noise sources asymmetrically distributed. Finally, the effects of statistical dependence between multiplicative …

Fluctuation phenomena random processes noise and Brownian motionPhysicsSettore FIS/02 - Fisica Teorica Modelli E Metodi MatematiciBistabilityStochastic resonanceDifferential equationLotka–Volterra equationsProbability theory stochastic processes and statisticStochastic analysis methods (Fokker-Planck Langevin etc.)Population dynamicCondensed Matter PhysicsNoise (electronics)Multiplicative noiseElectronic Optical and Magnetic MaterialsBackground noiseLangevin equationRandom walks and Levy flightQuantitative Biology::Populations and EvolutionStatistical physicsThe European Physical Journal B
researchProduct