LEADER 03072oam 2200505 450 001 9910298563603321 005 20190911103515.0 010 $a1-4939-0274-1 024 7 $a10.1007/978-1-4939-0274-3 035 $a(OCoLC)869219446 035 $a(MiFhGG)GVRL6WZR 035 $a(EXLCZ)993710000000083324 100 $a20131129d2014 uy 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aData-driven generation of policies /$fAustin Parker [and three others] 205 $a1st ed. 2014. 210 1$aNew York :$cSpringer,$d2014. 215 $a1 online resource (x, 50 pages) $cillustrations 225 1 $aSpringerBriefs in Computer Science,$x2191-5768 300 $a"ISSN: 2191-5768." 311 $a1-4939-0273-3 320 $aIncludes bibliographical references and index. 327 $aIntroduction and Related Work -- Optimal State Change Attempts -- Different Kinds of Effect Estimators -- A Comparison with Planning under Uncertainty -- Experimental Evaluation -- Conclusions. 330 $aThis 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. 410 0$aSpringerBriefs in computer science. 606 $aComputer algorithms 606 $aArtificial intelligence 615 0$aComputer algorithms. 615 0$aArtificial intelligence. 676 $a004 676 $a005.55 700 $aParker$b Austin$4aut$4http://id.loc.gov/vocabulary/relators/aut$0886493 702 $aSimari$b Gerardo I$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aSliva$b Amy$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aSubrahmanian$b V.S$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910298563603321 996 $aData-driven Generation of Policies$91979645 997 $aUNINA