Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
18,802 | Characterization of Dynamic Bayesian Network | cs.AI | In this report, we will be interested at Dynamic Bayesian Network (DBNs) as a
model that tries to incorporate temporal dimension with uncertainty. We start
with basics of DBN where we especially focus in Inference and Learning concepts
and algorithms. Then we will present different levels and methods of creating
DBNs a... | computer science |
18,803 | Machine Cognition Models: EPAM and GPS | cs.AI | Through history, the human being tried to relay its daily tasks to other
creatures, which was the main reason behind the rise of civilizations. It
started with deploying animals to automate tasks in the field of
agriculture(bulls), transportation (e.g. horses and donkeys), and even
communication (pigeons). Millenniums ... | computer science |
18,804 | A Probabilistic Logic Programming Event Calculus | cs.AI | We present a system for recognising human activity given a symbolic
representation of video content. The input of our system is a set of
time-stamped short-term activities (STA) detected on video frames. The output
is a set of recognised long-term activities (LTA), which are pre-defined
temporal combinations of STA. Th... | computer science |
18,805 | Applications of fuzzy logic to Case-Based Reasoning | cs.AI | The article discusses some applications of fuzzy logic ideas to formalizing
of the Case-Based Reasoning (CBR) process and to measuring the effectiveness of
CBR systems | computer science |
18,806 | Lower Complexity Bounds for Lifted Inference | cs.AI | One of the big challenges in the development of probabilistic relational (or
probabilistic logical) modeling and learning frameworks is the design of
inference techniques that operate on the level of the abstract model
representation language, rather than on the level of ground, propositional
instances of the model. Nu... | computer science |
18,807 | On how percolation threshold affects PSO performance | cs.AI | Statistical evidence of the influence of neighborhood topology on the
performance of particle swarm optimization (PSO) algorithms has been shown in
many works. However, little has been done about the implications could have the
percolation threshold in determining the topology of this neighborhood. This
work addresses ... | computer science |
18,808 | Solution Representations and Local Search for the bi-objective Inventory
Routing Problem | cs.AI | The solution of the biobjective IRP is rather challenging, even for
metaheuristics. We are still lacking a profound understanding of appropriate
solution representations and effective neighborhood structures. Clearly, both
the delivery volumes and the routing aspects of the alternatives need to be
reflected in an encod... | computer science |
18,809 | Automatic Sampling of Geographic objects | cs.AI | Today, one's disposes of large datasets composed of thousands of geographic
objects. However, for many processes, which require the appraisal of an expert
or much computational time, only a small part of these objects can be taken
into account. In this context, robust sampling methods become necessary. In
this paper, w... | computer science |
18,810 | Using Belief Theory to Diagnose Control Knowledge Quality. Application
to cartographic generalisation | cs.AI | Both humans and artificial systems frequently use trial and error methods to
problem solving. In order to be effective, this type of strategy implies having
high quality control knowledge to guide the quest for the optimal solution.
Unfortunately, this control knowledge is rarely perfect. Moreover, in
artificial system... | computer science |
18,811 | A Fuzzy Model for Analogical Problem Solving | cs.AI | In this paper we develop a fuzzy model for the description of the process of
Analogical Reasoning by representing its main steps as fuzzy subsets of a set
of linguistic labels characterizing the individuals' performance in each step
and we use the Shannon- Wiener diversity index as a measure of the individuals'
abiliti... | computer science |
18,812 | Hybrid systems modeling for gas transmission network | cs.AI | Gas Transmission Networks are large-scale complex systems, and corresponding
design and control problems are challenging. In this paper, we consider the
problem of control and management of these systems in crisis situations. We
present these networks by a hybrid systems framework that provides required
analysis models... | computer science |
18,813 | Comparison of different T-norm operators in classification problems | cs.AI | Fuzzy rule based classification systems are one of the most popular fuzzy
modeling systems used in pattern classification problems. This paper
investigates the effect of applying nine different T-norms in fuzzy rule based
classification systems. In the recent researches, fuzzy versions of confidence
and support merits ... | computer science |
18,814 | A Novel Fuzzy Logic Based Adaptive Supertwisting Sliding Mode Control
Algorithm for Dynamic Uncertain Systems | cs.AI | This paper presents a novel fuzzy logic based Adaptive Super-twisting Sliding
Mode Controller for the control of dynamic uncertain systems. The proposed
controller combines the advantages of Second order Sliding Mode Control, Fuzzy
Logic Control and Adaptive Control. The reaching conditions, stability and
robustness of... | computer science |
18,815 | Elimination of ISI Using Improved LMS Based Decision Feedback Equalizer | cs.AI | This paper deals with the implementation of Least Mean Square (LMS) algorithm
in Decision Feedback Equalizer (DFE) for removal of Inter Symbol Interference
(ISI) at the receiver. The channel disrupts the transmitted signal by spreading
it in time. Although, the LMS algorithm is robust and reliable, it is slow in
conver... | computer science |
18,816 | The Complexity of Planning Revisited - A Parameterized Analysis | cs.AI | The early classifications of the computational complexity of planning under
various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have
influenced following research in planning in many ways. We go back and
reanalyse their subclasses, but this time using the more modern tool of
parameterized complex... | computer science |
18,817 | Explaining Time-Table-Edge-Finding Propagation for the Cumulative
Resource Constraint | cs.AI | Cumulative resource constraints can model scarce resources in scheduling
problems or a dimension in packing and cutting problems. In order to
efficiently solve such problems with a constraint programming solver, it is
important to have strong and fast propagators for cumulative resource
constraints. One such propagator... | computer science |
18,818 | Evaluating Ontology Matching Systems on Large, Multilingual and
Real-world Test Cases | cs.AI | In the field of ontology matching, the most systematic evaluation of matching
systems is established by the Ontology Alignment Evaluation Initiative (OAEI),
which is an annual campaign for evaluating ontology matching systems organized
by different groups of researchers. In this paper, we report on the results of
an in... | computer science |
18,819 | OntoAna: Domain Ontology for Human Anatomy | cs.AI | Today, we can find many search engines which provide us with information
which is more operational in nature. None of the search engines provide domain
specific information. This becomes very troublesome to a novice user who wishes
to have information in a particular domain. In this paper, we have developed an
ontology... | computer science |
18,820 | Lifted Variable Elimination: A Novel Operator and Completeness Results | cs.AI | Various methods for lifted probabilistic inference have been proposed, but
our understanding of these methods and the relationships between them is still
limited, compared to their propositional counterparts. The only existing
theoretical characterization of lifting is for weighted first-order model
counting (WFOMC), w... | computer science |
18,821 | A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based
Approaches for E-GTSP | cs.AI | The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard
combinatorial optimization problems. A variant of GTSP is E-GTSP where E,
meaning equality, has the constraint: exactly one node from a cluster of a
graph partition is visited. The main objective of the E-GTSP is to find a
minimum cost tour passing... | computer science |
18,822 | Parallel ACO with a Ring Neighborhood for Dynamic TSP | cs.AI | The current paper introduces a new parallel computing technique based on ant
colony optimization for a dynamic routing problem. In the dynamic traveling
salesman problem the distances between cities as travel times are no longer
fixed. The new technique uses a parallel model for a problem variant that
allows a slight m... | computer science |
18,823 | Proceedings of the Twenty-Fourth Conference on Uncertainty in Artificial
Intelligence (2008) | cs.AI | This is the Proceedings of the Twenty-Fourth Conference on Uncertainty in
Artificial Intelligence, which was held in Helsinki, Finland, July 9 - 12 2008. | computer science |
18,824 | Proceedings of the Twenty-Third Conference on Uncertainty in Artificial
Intelligence (2007) | cs.AI | This is the Proceedings of the Twenty-Third Conference on Uncertainty in
Artificial Intelligence, which was held in Vancouver, British Columbia, July 19
- 22 2007. | computer science |
18,825 | Proceedings of the Twenty-First Conference on Uncertainty in Artificial
Intelligence (2005) | cs.AI | This is the Proceedings of the Twenty-First Conference on Uncertainty in
Artificial Intelligence, which was held in Edinburgh, Scotland July 26 - 29
2005. | computer science |
18,826 | Proceedings of the Twenty-Second Conference on Uncertainty in Artificial
Intelligence (2006) | cs.AI | This is the Proceedings of the Twenty-Second Conference on Uncertainty in
Artificial Intelligence, which was held in Cambridge, MA, July 13 - 16 2006. | computer science |
18,827 | Proceedings of the Twentieth Conference on Uncertainty in Artificial
Intelligence (2004) | cs.AI | This is the Proceedings of the Twentieth Conference on Uncertainty in
Artificial Intelligence, which was held in Banff, Canada, July 7 - 11 2004. | computer science |
18,828 | Distributed Pharaoh System for Network Routing | cs.AI | In this paper it is introduced a biobjective ant algorithm for constructing
low cost routing networks. The new algorithm is called the Distributed Pharaoh
System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh
Ant System (PAS) with an extra-exploration phase and a 'no-entry' condition in
order t... | computer science |
18,829 | Soft Computing approaches on the Bandwidth Problem | cs.AI | The Matrix Bandwidth Minimization Problem (MBMP) seeks for a simultaneous
reordering of the rows and the columns of a square matrix such that the nonzero
entries are collected within a band of small width close to the main diagonal.
The MBMP is a NP-complete problem, with applications in many scientific
domains, linear... | computer science |
18,830 | Automatic firewall rules generator for anomaly detection systems with
Apriori algorithm | cs.AI | Network intrusion detection systems have become a crucial issue for computer
systems security infrastructures. Different methods and algorithms are
developed and proposed in recent years to improve intrusion detection systems.
The most important issue in current systems is that they are poor at detecting
novel anomaly ... | computer science |
18,831 | On Solving the Oriented Two-Dimensional Bin Packing Problem under Free
Guillotine Cutting: Exploiting the Power of Probabilistic Solution
Construction | cs.AI | Two-dimensional bin packing problems are highly relevant combinatorial
optimization problems. They find a large number of applications, for example,
in the context of transportation or warehousing, and for the cutting of
different materials such as glass, wood or metal. In this work we deal with the
oriented two-dimens... | computer science |
18,832 | Direct computation of diagnoses for ontology debugging | cs.AI | Modern ontology debugging methods allow efficient identification and
localization of faulty axioms defined by a user while developing an ontology.
The ontology development process in this case is characterized by rather
frequent and regular calls to a reasoner resulting in an early user awareness
of modeling errors. In... | computer science |
18,833 | A matrix approach for computing extensions of argumentation frameworks | cs.AI | The matrices and their sub-blocks are introduced into the study of
determining various extensions in the sense of Dung's theory of argumentation
frameworks. It is showed that each argumentation framework has its matrix
representations, and the core semantics defined by Dung can be characterized by
specific sub-blocks o... | computer science |
18,834 | On firm specific characteristics of pharmaceutical generics and
incentives to permanence under fuzzy conditions | cs.AI | The aim of this paper is to develop a methodology that is useful for
analysing from a microeconomic perspective the incentives to entry, permanence
and exit in the market for pharmaceutical generics under fuzzy conditions. In
an empirical application of our proposed methodology, the potential towards
permanence of labs... | computer science |
18,835 | Tractable Optimization Problems through Hypergraph-Based Structural
Restrictions | cs.AI | Several variants of the Constraint Satisfaction Problem have been proposed
and investigated in the literature for modelling those scenarios where
solutions are associated with some given costs. Within these frameworks
computing an optimal solution is an NP-hard problem in general; yet, when
restricted over classes of i... | computer science |
18,836 | RIO: Minimizing User Interaction in Ontology Debugging | cs.AI | Efficient ontology debugging is a cornerstone for many activities in the
context of the Semantic Web, especially when automatic tools produce (parts of)
ontologies such as in the field of ontology matching. The best currently known
interactive debugging systems rely upon some meta information in terms of fault
probabil... | computer science |
18,837 | Textual Features for Programming by Example | cs.AI | In Programming by Example, a system attempts to infer a program from input
and output examples, generally by searching for a composition of certain base
functions. Performing a naive brute force search is infeasible for even mildly
involved tasks. We note that the examples themselves often present clues as to
which fun... | computer science |
18,838 | Hybrid technique for effective knowledge representation & a comparative
study | cs.AI | Knowledge representation (KR) and inference mechanism are most desirable
thing to make the system intelligent. System is known to an intelligent if its
intelligence is equivalent to the intelligence of human being for a particular
domain or general. Because of incomplete ambiguous and uncertain information
the task of ... | computer science |
18,839 | Cognitive Bias for Universal Algorithmic Intelligence | cs.AI | Existing theoretical universal algorithmic intelligence models are not
practically realizable. More pragmatic approach to artificial general
intelligence is based on cognitive architectures, which are, however,
non-universal in sense that they can construct and use models of the
environment only from Turing-incomplete ... | computer science |
18,840 | Speech Signal Filters based on Soft Computing Techniques: A Comparison | cs.AI | The paper presents a comparison of various soft computing techniques used for
filtering and enhancing speech signals. The three major techniques that fall
under soft computing are neural networks, fuzzy systems and genetic algorithms.
Other hybrid techniques such as neuro-fuzzy systems are also available. In
general, s... | computer science |
18,841 | Applicability of Crisp and Fuzzy Logic in Intelligent Response
Generation | cs.AI | This paper discusses the merits and demerits of crisp logic and fuzzy logic
with respect to their applicability in intelligent response generation by a
human being and by a robot. Intelligent systems must have the capability of
taking decisions that are wise and handle situations intelligently. A direct
relationship ex... | computer science |
18,842 | Application of Fuzzy Mathematics to Speech-to-Text Conversion by
Elimination of Paralinguistic Content | cs.AI | For the past few decades, man has been trying to create an intelligent
computer which can talk and respond like he can. The task of creating a system
that can talk like a human being is the primary objective of Automatic Speech
Recognition. Various Speech Recognition techniques have been developed in
theory and have be... | computer science |
18,843 | Formal Definition of AI | cs.AI | A definition of Artificial Intelligence was proposed in [1] but this
definition was not absolutely formal at least because the word "Human" was
used. In this paper we will formalize the definition from [1]. The biggest
problem in this definition was that the level of intelligence of AI is compared
to the intelligence o... | computer science |
18,844 | Matroidal structure of rough sets based on serial and transitive
relations | cs.AI | The theory of rough sets is concerned with the lower and upper approximations
of objects through a binary relation on a universe. It has been applied to
machine learning, knowledge discovery and data mining. The theory of matroids
is a generalization of linear independence in vector spaces. It has been used
in combinat... | computer science |
18,845 | Covering matroid | cs.AI | In this paper, we propose a new type of matroids, namely covering matroids,
and investigate the connections with the second type of covering-based rough
sets and some existing special matroids. Firstly, as an extension of
partitions, coverings are more natural combinatorial objects and can sometimes
be more efficient t... | computer science |
18,846 | Relation matroid and its relationship with generalized rough set based
on relation | cs.AI | Recently, the relationship between matroids and generalized rough sets based
on relations has been studied from the viewpoint of linear independence of
matrices. In this paper, we reveal more relationships by the predecessor and
successor neighborhoods from relations. First, through these two neighborhoods,
we propose ... | computer science |
18,847 | Matroidal structure of generalized rough sets based on symmetric and
transitive relations | cs.AI | Rough sets are efficient for data pre-process in data mining. Lower and upper
approximations are two core concepts of rough sets. This paper studies
generalized rough sets based on symmetric and transitive relations from the
operator-oriented view by matroidal approaches. We firstly construct a
matroidal structure of g... | computer science |
18,848 | Some characteristics of matroids through rough sets | cs.AI | At present, practical application and theoretical discussion of rough sets
are two hot problems in computer science. The core concepts of rough set theory
are upper and lower approximation operators based on equivalence relations.
Matroid, as a branch of mathematics, is a structure that generalizes linear
independence ... | computer science |
18,849 | Condition for neighborhoods in covering based rough sets to form a
partition | cs.AI | Neighborhood is an important concept in covering based rough sets. That under
what condition neighborhoods form a partition is a meaningful issue induced by
this concept. Many scholars have paid attention to this issue and presented
some necessary and sufficient conditions. However, there exists one common
trait among ... | computer science |
18,850 | Rough sets and matroidal contraction | cs.AI | Rough sets are efficient for data pre-processing in data mining. As a
generalization of the linear independence in vector spaces, matroids provide
well-established platforms for greedy algorithms. In this paper, we apply rough
sets to matroids and study the contraction of the dual of the corresponding
matroid. First, f... | computer science |
18,851 | Condition for neighborhoods induced by a covering to be equal to the
covering itself | cs.AI | It is a meaningful issue that under what condition neighborhoods induced by a
covering are equal to the covering itself. A necessary and sufficient condition
for this issue has been provided by some scholars. In this paper, through a
counter-example, we firstly point out the necessary and sufficient condition is
false.... | computer science |
18,852 | Closed-set lattice of regular sets based on a serial and transitive
relation through matroids | cs.AI | Rough sets are efficient for data pre-processing in data mining. Matroids are
based on linear algebra and graph theory, and have a variety of applications in
many fields. Both rough sets and matroids are closely related to lattices. For
a serial and transitive relation on a universe, the collection of all the
regular s... | computer science |
18,853 | Lattice structures of fixed points of the lower approximations of two
types of covering-based rough sets | cs.AI | Covering is a common type of data structure and covering-based rough set
theory is an efficient tool to process this data. Lattice is an important
algebraic structure and used extensively in investigating some types of
generalized rough sets. In this paper, we propose two family of sets and study
the conditions that th... | computer science |
18,854 | Semi-automatic annotation process for procedural texts: An application
on cooking recipes | cs.AI | Taaable is a case-based reasoning system that adapts cooking recipes to user
constraints. Within it, the preparation part of recipes is formalised as a
graph. This graph is a semantic representation of the sequence of instructions
composing the cooking process and is used to compute the procedure adaptation,
conjointly... | computer science |
18,855 | Efficient Natural Evolution Strategies | cs.AI | Efficient Natural Evolution Strategies (eNES) is a novel alternative to
conventional evolutionary algorithms, using the natural gradient to adapt the
mutation distribution. Unlike previous methods based on natural gradients, eNES
uses a fast algorithm to calculate the inverse of the exact Fisher information
matrix, thu... | computer science |
18,856 | Examples of Artificial Perceptions in Optical Character Recognition and
Iris Recognition | cs.AI | This paper assumes the hypothesis that human learning is perception based,
and consequently, the learning process and perceptions should not be
represented and investigated independently or modeled in different simulation
spaces. In order to keep the analogy between the artificial and human learning,
the former is assu... | computer science |
18,857 | Multi-Agents Dynamic Case Based Reasoning and The Inverse Longest Common
Sub-Sequence And Individualized Follow-up of Learners in The CEHL | cs.AI | In E-learning, there is still the problem of knowing how to ensure an
individualized and continuous learner's follow-up during learning process,
indeed among the numerous tools proposed, very few systems concentrate on a
real time learner's follow-up. Our work in this field develops the design and
implementation of a M... | computer science |
18,858 | Applying Strategic Multiagent Planning to Real-World Travel Sharing
Problems | cs.AI | Travel sharing, i.e., the problem of finding parts of routes which can be
shared by several travellers with different points of departure and
destinations, is a complex multiagent problem that requires taking into account
individual agents' preferences to come up with mutually acceptable joint plans.
In this paper, we ... | computer science |
18,859 | A constraint satisfaction approach to the robust spanning tree problem
with interval data | cs.AI | Robust optimization is one of the fundamental approaches to deal with
uncertainty in combinatorial optimization. This paper considers the robust
spanning tree problem with interval data, which arises in a variety of
telecommunication applications. It proposes a constraint satisfaction approach
using a combinatorial low... | computer science |
18,860 | On the Construction of the Inclusion Boundary Neighbourhood for Markov
Equivalence Classes of Bayesian Network Structures | cs.AI | The problem of learning Markov equivalence classes of Bayesian network
structures may be solved by searching for the maximum of a scoring metric in a
space of these classes. This paper deals with the definition and analysis of
one such search space. We use a theoretically motivated neighbourhood, the
inclusion boundary... | computer science |
18,861 | Bipolar Possibilistic Representations | cs.AI | Recently, it has been emphasized that the possibility theory framework allows
us to distinguish between i) what is possible because it is not ruled out by
the available knowledge, and ii) what is possible for sure. This distinction
may be useful when representing knowledge, for modelling values which are not
impossible... | computer science |
18,862 | Qualitative MDPs and POMDPs: An Order-Of-Magnitude Approximation | cs.AI | We develop a qualitative theory of Markov Decision Processes (MDPs) and
Partially Observable MDPs that can be used to model sequential decision making
tasks when only qualitative information is available. Our approach is based
upon an order-of-magnitude approximation of both probabilities and utilities,
similar to epsi... | computer science |
18,863 | Introducing Variable Importance Tradeoffs into CP-Nets | cs.AI | The ability to make decisions and to assess potential courses of action is a
corner-stone of many AI applications, and usually this requires explicit
information about the decision-maker s preferences. IN many applications,
preference elicitation IS a serious bottleneck.The USER either does NOT have
the time, the knowl... | computer science |
18,864 | Planning under Continuous Time and Resource Uncertainty: A Challenge for
AI | cs.AI | We outline a class of problems, typical of Mars rover operations, that are
problematic for current methods of planning under uncertainty. The existing
methods fail because they suffer from one or more of the following limitations:
1) they rely on very simple models of actions and time, 2) they assume that
uncertainty i... | computer science |
18,865 | Generalized Instrumental Variables | cs.AI | This paper concerns the assessment of direct causal effects from a
combination of: (i) non-experimental data, and (ii) qualitative domain
knowledge. Domain knowledge is encoded in the form of a directed acyclic graph
(DAG), in which all interactions are assumed linear, and some variables are
presumed to be unobserved. ... | computer science |
18,866 | Finding Optimal Bayesian Networks | cs.AI | In this paper, we derive optimality results for greedy Bayesian-network
search algorithms that perform single-edge modifications at each step and use
asymptotically consistent scoring criteria. Our results extend those of Meek
(1997) and Chickering (2002), who demonstrate that in the limit of large
datasets, if the gen... | computer science |
18,867 | Iterative Join-Graph Propagation | cs.AI | The paper presents an iterative version of join-tree clustering that applies
the message passing of join-tree clustering algorithm to join-graphs rather
than to join-trees, iteratively. It is inspired by the success of Pearl's
belief propagation algorithm as an iterative approximation scheme on one hand,
and by a recen... | computer science |
18,868 | Causes and Explanations in the Structural-Model Approach: Tractable
Cases | cs.AI | In this paper, we continue our research on the algorithmic aspects of Halpern
and Pearl's causes and explanations in the structural-model approach. To this
end, we present new characterizations of weak causes for certain classes of
causal models, which show that under suitable restrictions deciding causes and
explanati... | computer science |
18,869 | Factorization of Discrete Probability Distributions | cs.AI | We formulate necessary and sufficient conditions for an arbitrary discrete
probability distribution to factor according to an undirected graphical model,
or a log-linear model, or other more general exponential models. This result
generalizes the well known Hammersley-Clifford Theorem. | computer science |
18,870 | Statistical Decisions Using Likelihood Information Without Prior
Probabilities | cs.AI | This paper presents a decision-theoretic approach to statistical inference
that satisfies the likelihood principle (LP) without using prior information.
Unlike the Bayesian approach, which also satisfies LP, we do not assume
knowledge of the prior distribution of the unknown parameter. With respect to
information that ... | computer science |
18,871 | Distributed Planning in Hierarchical Factored MDPs | cs.AI | We present a principled and efficient planning algorithm for collaborative
multiagent dynamical systems. All computation, during both the planning and the
execution phases, is distributed among the agents; each agent only needs to
model and plan for a small part of the system. Each of these local subsystems
is small, b... | computer science |
18,872 | Expectation Propogation for approximate inference in dynamic Bayesian
networks | cs.AI | We describe expectation propagation for approximate inference in dynamic
Bayesian networks as a natural extension of Pearl s exact belief
propagation.Expectation propagation IS a greedy algorithm, converges IN many
practical cases, but NOT always.We derive a DOUBLE - loop algorithm, guaranteed
TO converge TO a local mi... | computer science |
18,873 | Unconstrained Influence Diagrams | cs.AI | We extend the language of influence diagrams to cope with decision scenarios
where the order of decisions and observations is not determined. As the
ordering of decisions is dependent on the evidence, a step-strategy of such a
scenario is a sequence of dependent choices of the next action. A strategy is a
step-strategy... | computer science |
18,874 | A Bayesian Network Scoring Metric That Is Based On Globally Uniform
Parameter Priors | cs.AI | We introduce a new Bayesian network (BN) scoring metric called the Global
Uniform (GU) metric. This metric is based on a particular type of default
parameter prior. Such priors may be useful when a BN developer is not willing
or able to specify domain-specific parameter priors. The GU parameter prior
specifies that eve... | computer science |
18,875 | Value Function Approximation in Zero-Sum Markov Games | cs.AI | This paper investigates value function approximation in the context of
zero-sum Markov games, which can be viewed as a generalization of the Markov
decision process (MDP) framework to the two-agent case. We generalize error
bounds from MDPs to Markov games and describe generalizations of reinforcement
learning algorith... | computer science |
18,876 | Monitoring a Complez Physical System using a Hybrid Dynamic Bayes Net | cs.AI | The Reverse Water Gas Shift system (RWGS) is a complex physical system
designed to produce oxygen from the carbon dioxide atmosphere on Mars. If sent
to Mars, it would operate without human supervision, thus requiring a reliable
automated system for monitoring and control. The RWGS presents many challenges
typical of r... | computer science |
18,877 | Formalizing Scenario Analysis | cs.AI | We propose a formal treatment of scenarios in the context of a dialectical
argumentation formalism for qualitative reasoning about uncertain propositions.
Our formalism extends prior work in which arguments for and against uncertain
propositions were presented and compared in interaction spaces called Agoras.
We now de... | computer science |
18,878 | Real-valued All-Dimensions search: Low-overhead rapid searching over
subsets of attributes | cs.AI | This paper is about searching the combinatorial space of contingency tables
during the inner loop of a nonlinear statistical optimization. Examples of this
operation in various data analytic communities include searching for nonlinear
combinations of attributes that contribute significantly to a regression
(Statistics)... | computer science |
18,879 | Factored Particles for Scalable Monitoring | cs.AI | Exact monitoring in dynamic Bayesian networks is intractable, so approximate
algorithms are necessary. This paper presents a new family of approximate
monitoring algorithms that combine the best qualities of the particle filtering
and Boyen-Koller methods. Our algorithms maintain an approximate representation
the belie... | computer science |
18,880 | Continuous Time Bayesian Networks | cs.AI | In this paper we present a language for finite state continuous time Bayesian
networks (CTBNs), which describe structured stochastic processes that evolve
over continuous time. The state of the system is decomposed into a set of local
variables whose values change over time. The dynamics of the system are
described by ... | computer science |
18,881 | MAP Complexity Results and Approximation Methods | cs.AI | MAP is the problem of finding a most probable instantiation of a set of
nvariables in a Bayesian network, given some evidence. MAP appears to be a
significantly harder problem than the related problems of computing the
probability of evidence Pr, or MPE a special case of MAP. Because of the
complexity of MAP, and the l... | computer science |
18,882 | From Qualitative to Quantitative Probabilistic Networks | cs.AI | Quantification is well known to be a major obstacle in the construction of a
probabilistic network, especially when relying on human experts for this
purpose. The construction of a qualitative probabilistic network has been
proposed as an initial step in a network s quantification, since the
qualitative network can be ... | computer science |
18,883 | Inference with Seperately Specified Sets of Probabilities in Credal
Networks | cs.AI | We present new algorithms for inference in credal networks --- directed
acyclic graphs associated with sets of probabilities. Credal networks are here
interpreted as encoding strong independence relations among variables. We first
present a theory of credal networks based on separately specified sets of
probabilities. ... | computer science |
18,884 | Real-Time Inference with Large-Scale Temporal Bayes Nets | cs.AI | An increasing number of applications require real-time reasoning under
uncertainty with streaming input. The temporal (dynamic) Bayes net formalism
provides a powerful representational framework for such applications. However,
existing exact inference algorithms for dynamic Bayes nets do not scale to the
size of models... | computer science |
18,885 | Loopy Belief Propogation and Gibbs Measures | cs.AI | We address the question of convergence in the loopy belief propagation (LBP)
algorithm. Specifically, we relate convergence of LBP to the existence of a
weak limit for a sequence of Gibbs measures defined on the LBP s associated
computation tree.Using tools FROM the theory OF Gibbs measures we develop
easily testable s... | computer science |
18,886 | Anytime State-Based Solution Methods for Decision Processes with
non-Markovian Rewards | cs.AI | A popular approach to solving a decision process with non-Markovian rewards
(NMRDP) is to exploit a compact representation of the reward function to
automatically translate the NMRDP into an equivalent Markov decision process
(MDP) amenable to our favorite MDP solution method. The contribution of this
paper is a repres... | computer science |
18,887 | On the Testable Implications of Causal Models with Hidden Variables | cs.AI | The validity OF a causal model can be tested ONLY IF the model imposes
constraints ON the probability distribution that governs the generated data. IN
the presence OF unmeasured variables, causal models may impose two types OF
constraints : conditional independencies, AS READ through the d - separation
criterion, AND f... | computer science |
18,888 | Exploiting Functional Dependence in Bayesian Network Inference | cs.AI | We propose an efficient method for Bayesian network inference in models with
functional dependence. We generalize the multiplicative factorization method
originally designed by Takikawa and D Ambrosio(1999) FOR models WITH
independence OF causal influence.Using a hidden variable, we transform a
probability potential IN... | computer science |
18,889 | Decision Principles to justify Carnap's Updating Method and to Suggest
Corrections of Probability Judgments (Invited Talks) | cs.AI | This paper uses decision-theoretic principles to obtain new insights into the
assessment and updating of probabilities. First, a new foundation of
Bayesianism is given. It does not require infinite atomless uncertainties as
did Savage s classical result, AND can therefore be applied TO ANY finite
Bayesian network.It ne... | computer science |
18,890 | Inductive Policy Selection for First-Order MDPs | cs.AI | We select policies for large Markov Decision Processes (MDPs) with compact
first-order representations. We find policies that generalize well as the
number of objects in the domain grows, potentially without bound. Existing
dynamic-programming approaches based on flat, propositional, or first-order
representations eith... | computer science |
18,891 | Translating NP-SPEC into ASP | cs.AI | NP-SPEC is a language for specifying problems in NP in a declarative way.
Despite the fact that the semantics of the language was given by referring to
Datalog with circumscription, which is very close to ASP, so far the only
existing implementations are by means of ECLiPSe Prolog and via Boolean
satisfiability solvers... | computer science |
18,892 | Language ASP{f} with Arithmetic Expressions and Consistency-Restoring
Rules | cs.AI | In this paper we continue the work on our extension of Answer Set Programming
by non-Herbrand functions and add to the language support for arithmetic
expressions and various inequality relations over non-Herbrand functions, as
well as consistency-restoring rules from CR-Prolog. We demonstrate the use of
this latest ve... | computer science |
18,893 | Utilizing ASP for Generating and Visualizing Argumentation Frameworks | cs.AI | Within the area of computational models of argumentation, the
instantiation-based approach is gaining more and more attention, not at least
because meaningful input for Dung's abstract frameworks is provided in that
way. In a nutshell, the aim of instantiation-based argumentation is to form,
from a given knowledge base... | computer science |
18,894 | Planning and Scheduling in Hybrid Domains Using Answer Set Programming | cs.AI | In this paper we present an Action Language-Answer Set Programming based
approach to solving planning and scheduling problems in hybrid domains -
domains that exhibit both discrete and continuous behavior. We use action
language H to represent the domain and then translate the resulting theory into
an A-Prolog program.... | computer science |
18,895 | Answer Set Programming for Stream Reasoning | cs.AI | The advance of Internet and Sensor technology has brought about new
challenges evoked by the emergence of continuous data streams. Beyond rapid
data processing, application areas like ambient assisted living, robotics, or
dynamic scheduling involve complex reasoning tasks. We address such scenarios
and elaborate upon a... | computer science |
18,896 | A Distance-based Paraconsistent Semantics for DL-Lite | cs.AI | DL-Lite is an important family of description logics. Recently, there is an
increasing interest in handling inconsistency in DL-Lite as the constraint
imposed by a TBox can be easily violated by assertions in ABox in DL-Lite. In
this paper, we present a distance-based paraconsistent semantics based on the
notion of fea... | computer science |
18,897 | A Forgetting-based Approach to Merging Knowledge Bases | cs.AI | This paper presents a novel approach based on variable forgetting, which is a
useful tool in resolving contradictory by filtering some given variables, to
merging multiple knowledge bases. This paper first builds a relationship
between belief merging and variable forgetting by using dilation. Variable
forgetting is app... | computer science |
18,898 | A Paraconsistent Tableau Algorithm Based on Sign Transformation in
Semantic Web | cs.AI | In an open, constantly changing and collaborative environment like the
forthcoming Semantic Web, it is reasonable to expect that knowledge sources
will contain noise and inaccuracies. It is well known, as the logical
foundation of the Semantic Web, description logic is lack of the ability of
tolerating inconsistent or ... | computer science |
18,899 | Proceedings of Answer Set Programming and Other Computing Paradigms
(ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest,
Hungary | cs.AI | This volume contains the papers presented at the fifth workshop on Answer Set
Programming and Other Computing Paradigms (ASPOCP 2012) held on September 4th,
2012 in Budapest, co-located with the 28th International Conference on Logic
Programming (ICLP 2012). It thus continues a series of previous events
co-located with... | computer science |
18,900 | Markov Chain Monte Carlo using Tree-Based Priors on Model Structure | cs.AI | We present a general framework for defining priors on model structure and
sampling from the posterior using the Metropolis-Hastings algorithm. The key
idea is that structure priors are defined via a probability tree and that the
proposal mechanism for the Metropolis-Hastings algorithm operates by traversing
this tree, ... | computer science |
18,901 | Graphical readings of possibilistic logic bases | cs.AI | Possibility theory offers either a qualitive, or a numerical framework for
representing uncertainty, in terms of dual measures of possibility and
necessity. This leads to the existence of two kinds of possibilistic causal
graphs where the conditioning is either based on the minimum, or the product
operator. Benferhat e... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.