Search results for "Probability Distribution"

showing 3 items of 263 documents

Context–content systems of random variables : The Contextuality-by-Default theory

2016

Abstract This paper provides a systematic yet accessible presentation of the Contextuality-by-Default theory. The consideration is confined to finite systems of categorical random variables, which allows us to focus on the basics of the theory without using full-scale measure-theoretic language. Contextuality-by-Default is a theory of random variables identified by their contents and their contexts, so that two variables have a joint distribution if and only if they share a context. Intuitively, the content of a random variable is the entity the random variable measures or responds to, while the context is formed by the conditions under which these measurements or responses are obtained. A …

ta113Theoretical computer scienceComputer scienceApplied Mathematicscouplings05 social sciencesta111Probabilistic logicContext (language use)01 natural sciencesMeasure (mathematics)050105 experimental psychologyconnectednessKochen–Specker theoremrandom variablesJoint probability distribution0103 physical sciences0501 psychology and cognitive sciencescontextualityNegative number010306 general physicsCategorical variableRandom variableGeneral PsychologyJournal of Mathematical Psychology
researchProduct

Listwise Collaborative Filtering

2015

Recently, ranking-oriented collaborative filtering (CF) algorithms have achieved great success in recommender systems. They obtained state-of-the-art performances by estimating a preference ranking of items for each user rather than estimating the absolute ratings on unrated items (as conventional rating-oriented CF algorithms do). In this paper, we propose a new ranking-oriented CF algorithm, called ListCF. Following the memory-based CF framework, ListCF directly predicts a total order of items for each user based on similar users' probability distributions over permutations of the items, and thus differs from previous ranking-oriented memory-based CF algorithms that focus on predicting th…

ta113business.industryComputer scienceRecommender systemMachine learningcomputer.software_genreRankingcollaborative filteringBenchmark (computing)Collaborative filteringProbability distributionPairwise comparisonData miningArtificial intelligencerecommender systemsbusinessFocus (optics)computerranking-oriented collaborative filtering
researchProduct

Modelling Recurrent Events for Improving Online Change Detection

2016

The task of online change point detection in sensor data streams is often complicated due to presence of noise that can be mistaken for real changes and therefore affecting performance of change detectors. Most of the existing change detection methods assume that changes are independent from each other and occur at random in time. In this paper we study how performance of detectors can be improved in case of recurrent changes. We analytically demonstrate under which conditions and for how long recurrence information is useful for improving the detection accuracy. We propose a simple computationally efficient message passing procedure for calculating a predictive probability distribution of …

ta113noiseComputer scienceData stream miningMessage passingDetectordata streamsonline change detection02 engineering and technologycomputer.software_genreTask (computing)recurrent eventschange points020204 information systems0202 electrical engineering electronic engineering information engineeringProbability distribution020201 artificial intelligence & image processingNoise (video)Data miningBaseline (configuration management)computerChange detectionProceedings of the 2016 SIAM International Conference on Data Mining
researchProduct