Central Library

Normal view MARC view ISBD view

Data-driven Generation of Policies [electronic resource] / by Austin Parker, Gerardo I. Simari, Amy Sliva, V.S. Subrahmanian.

By: Parker, Austin [author.].
Contributor(s): Simari, Gerardo I [author.] | Sliva, Amy [author.] | Subrahmanian, V.S [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: SpringerBriefs in Computer Science: Publisher: New York, NY : Springer New York : Imprint: Springer, 2014Description: X, 50 p. 15 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781493902743.Subject(s): Computer science | Mathematical statistics | Database management | Data mining | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Data Mining and Knowledge Discovery | Database Management | Probability and Statistics in Computer ScienceAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
Introduction and Related Work -- Optimal State Change Attempts -- Different Kinds of Effect Estimators -- A Comparison with Planning under Uncertainty -- Experimental Evaluation -- Conclusions.
In: Springer eBooksSummary: This Springer Brief presents a basic algorithm that provides a correct solution to finding an optimal state change attempt, as well as an enhanced algorithm that is built on top of the well-known trie data structure. It explores correctness and algorithmic complexity results for both algorithms and experiments comparing their performance on both real-world and synthetic data. Topics addressed include optimal state change attempts, state change effectiveness, different kind of effect estimators, planning under uncertainty and experimental evaluation. These topics will help researchers analyze tabular data, even if the data contains states (of the world) and events (taken by an agent) whose effects are not well understood. Event DBs are omnipresent in the social sciences and may include diverse scenarios from political events and the state of a country to education-related actions and their effects on a school system. With a wide range of applications in computer science and the social sciences, the information in this Springer Brief is valuable for professionals and researchers dealing with tabular data, artificial intelligence and data mining. The applications are also useful for advanced-level students of computer science.
    average rating: 0.0 (0 votes)
No physical items for this record

Introduction and Related Work -- Optimal State Change Attempts -- Different Kinds of Effect Estimators -- A Comparison with Planning under Uncertainty -- Experimental Evaluation -- Conclusions.

This Springer Brief presents a basic algorithm that provides a correct solution to finding an optimal state change attempt, as well as an enhanced algorithm that is built on top of the well-known trie data structure. It explores correctness and algorithmic complexity results for both algorithms and experiments comparing their performance on both real-world and synthetic data. Topics addressed include optimal state change attempts, state change effectiveness, different kind of effect estimators, planning under uncertainty and experimental evaluation. These topics will help researchers analyze tabular data, even if the data contains states (of the world) and events (taken by an agent) whose effects are not well understood. Event DBs are omnipresent in the social sciences and may include diverse scenarios from political events and the state of a country to education-related actions and their effects on a school system. With a wide range of applications in computer science and the social sciences, the information in this Springer Brief is valuable for professionals and researchers dealing with tabular data, artificial intelligence and data mining. The applications are also useful for advanced-level students of computer science.

There are no comments for this item.

Log in to your account to post a comment.