Andere Kunden interessierten sich auch für
![A Graph Theoretic Approach to Heterogeneous Data Clustering]( "A Graph Theoretic Approach to Heterogeneous Data Clustering")
A Graph Theoretic Approach to Heterogeneous Data Clustering38,99 €![Grounded Situation Models for Situated Conversational Assistants]( "Grounded Situation Models for Situated Conversational Assistants")
Grounded Situation Models for Situated Conversational Assistants51,99 €![Game-theoretic Interference Coordination Approaches for Dynamic Spectrum Access]( "Game-theoretic Interference Coordination Approaches for Dynamic Spectrum Access")
Game-theoretic Interference Coordination Approaches for Dynamic Spectrum Access37,99 €![Robust Recognition via Information Theoretic Learning]( "Robust Recognition via Information Theoretic Learning")
Robust Recognition via Information Theoretic Learning37,99 €![Medical Image Registration using a Graph Theoretic Method]( "Medical Image Registration using a Graph Theoretic Method")
Medical Image Registration using a Graph Theoretic Method51,99 €![Computing Network Model for Intelligent Systems]( "Computing Network Model for Intelligent Systems")
Computing Network Model for Intelligent Systems51,99 €![Better Decision Tree from Intelligent Instance Selection]( "Better Decision Tree from Intelligent Instance Selection")
Better Decision Tree from Intelligent Instance Selection38,99 €
Building intelligent computer assistants has been a
long-cherished goal of
AI. Many intelligent assistant systems were built
and fine-tuned to specific
application domains. In this work,
we develop a general model of assistance that
combines
three powerful ideas: decision theory, hierarchical
task models and
probabilistic relational languages. We use the
principles of decision theory
to model the general problem of intelligent
assistance. We use a
combination of hierarchical task models and
probabilistic relational
languages to specify prior knowledge of the computer
assistant. The
assistant exploits its prior knowledge to infer the
user's
goals and takes actions to assist the user. We
evaluate the decision
theoretic assistance model in three different
domains including a real-world domain
to demonstrate its generality. We show through
experiments that both the
hierarchical structure of the goals and the
parameter sharing facilitated by
relational models significantly improve the learning
speed of the agent.
Finally, we present
the results of deploying our relational hierarchical
model in a real-world
activity recognition task.
long-cherished goal of
AI. Many intelligent assistant systems were built
and fine-tuned to specific
application domains. In this work,
we develop a general model of assistance that
combines
three powerful ideas: decision theory, hierarchical
task models and
probabilistic relational languages. We use the
principles of decision theory
to model the general problem of intelligent
assistance. We use a
combination of hierarchical task models and
probabilistic relational
languages to specify prior knowledge of the computer
assistant. The
assistant exploits its prior knowledge to infer the
user's
goals and takes actions to assist the user. We
evaluate the decision
theoretic assistance model in three different
domains including a real-world domain
to demonstrate its generality. We show through
experiments that both the
hierarchical structure of the goals and the
parameter sharing facilitated by
relational models significantly improve the learning
speed of the agent.
Finally, we present
the results of deploying our relational hierarchical
model in a real-world
activity recognition task.