Latest YouTube Video

Sunday, June 28, 2015

Orioles Highlight: Chris Tillman 7 scoreless IP, Orioles with shutouts both games of DH vs. Indians, 1st time since 1974 (ESPN)

from ESPN http://ift.tt/1eW1vUH
via IFTTT

Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief. (arXiv:1506.07990v1 [cs.AI])

Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe belief. With respect to these logics, plausibility models may contain too much information. A proper notion of bisimulation is required that characterises them. We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models (with respect to the plausibility relation), two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar. As a result, the information content of such a model can be similarly expressed in the logic of conditional belief, or the logic of degrees of belief, or that of safe belief. This, we found a surprising result. Still, that does not mean that the logics are equally expressive: the logics of conditional and degrees of belief are incomparable, the logics of degrees of belief and safe belief are incomparable, while the logic of safe belief is more expressive than the logic of conditional belief. In view of the result on bisimulation characterisation, this is an equally surprising result. We hope our insights may contribute to the growing community of formal epistemology and on the relation between qualitative and quantitative modelling.



from cs.AI updates on arXiv.org http://ift.tt/1g04MKm
via IFTTT

Exact discovery of the most interesting sequential patterns. (arXiv:1506.08009v1 [cs.AI])

This paper presents a framework for exact discovery of the most interesting sequential patterns. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact discovery of top-k sequential patterns under a given measure of interest. We carry out experiments on both synthetic data with known patterns and real-world datasets; both experiments confirm the consistency and relevance of our approach.



from cs.AI updates on arXiv.org http://ift.tt/1TYFP1s
via IFTTT

Dynamic Bayesian Ontology Languages. (arXiv:1506.08030v1 [cs.AI])

Many formalisms combining ontology languages with uncertainty, usually in the form of probabilities, have been studied over the years. Most of these formalisms, however, assume that the probabilistic structure of the knowledge remains static over time. We present a general approach for extending ontology languages to handle time-evolving uncertainty represented by a dynamic Bayesian network. We show how reasoning in the original language and dynamic Bayesian inferences can be exploited for effective reasoning in our framework.



from cs.AI updates on arXiv.org http://ift.tt/1CDeiHP
via IFTTT

Humor in Collective Discourse: Unsupervised Funniness Detection in the New Yorker Cartoon Caption Contest. (arXiv:1506.08126v1 [cs.CL])

The New Yorker publishes a weekly captionless cartoon. More than 5,000 readers submit captions for it. The editors select three of them and ask the readers to pick the funniest one. We describe an experiment that compares a dozen automatic methods for selecting the funniest caption. We show that negative sentiment, human-centeredness, and lexical centrality most strongly match the funniest captions, followed by positive sentiment. These results are useful for understanding humor and also in the design of more engaging conversational agents in text and multimodal (vision+text) systems. As part of this work, a large set of cartoons and captions is being made available to the community.



from cs.AI updates on arXiv.org http://ift.tt/1TYFNGG
via IFTTT