Diagnosis using action-based hierarchies for optimal real-time performance:
Abstract: "To respond effectively in real time, an agent needs to be able to deal effectively with differing availability of information. In particular, although the agent ideally would like to be able to diagnose one or more particular faults that may be present at a given time, a deadline may...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1993
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1498 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "To respond effectively in real time, an agent needs to be able to deal effectively with differing availability of information. In particular, although the agent ideally would like to be able to diagnose one or more particular faults that may be present at a given time, a deadline may prevent it from doing so because prior to the deadline it is required to act or face a catastrophic outcome. Thus an agent should have available to it a set of actions some of which are appropriate, but not optimal, for large classes of faults and some of which are appropriate for specific faults Tests are available to help the agent diagnose a fault; given this framework decision trees would provide one possible approach to this diagnosis problem. However this work shows that the information-theoretic heuristic commonly used to structure decision trees is not ideal in a real time domain because it concerns itself with reaching a leaf node as fast as possible, not with the value of the actions it might obtain along the way. My thesis presents an alternative heuristic, the action-based heuristic, which may be used to structure a decision tree; the resulting structure together with the actions themselves is called an action-based hierarchy. The approach is validated in several ways First a complexity analysis is undertaken to show that the complexity of a structuring algorithm is not prohibitive. Then some theoretical results are given; this is followed by experiments with abstract inputs and inputs from a real-time domain, surgical intensive care unit patient monitoring. The thesis concludes with a description of an implementation of these ideas in a system known as ReAct. |
| Beschreibung: | Stanford, Calif, Univ., Diss. |
| Beschreibung: | IX, 141 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009568014 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940427s1993 m||| 00||| eng d | ||
| 035 | |a (OCoLC)30464394 | ||
| 035 | |a (DE-599)BVBBV009568014 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Ash, David |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Diagnosis using action-based hierarchies for optimal real-time performance |c by David Ash |
| 246 | 1 | 3 | |a Reportnr.: KSL 93 69 |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a IX, 141 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1498 | |
| 500 | |a Stanford, Calif, Univ., Diss. | ||
| 520 | 3 | |a Abstract: "To respond effectively in real time, an agent needs to be able to deal effectively with differing availability of information. In particular, although the agent ideally would like to be able to diagnose one or more particular faults that may be present at a given time, a deadline may prevent it from doing so because prior to the deadline it is required to act or face a catastrophic outcome. Thus an agent should have available to it a set of actions some of which are appropriate, but not optimal, for large classes of faults and some of which are appropriate for specific faults | |
| 520 | 3 | |a Tests are available to help the agent diagnose a fault; given this framework decision trees would provide one possible approach to this diagnosis problem. However this work shows that the information-theoretic heuristic commonly used to structure decision trees is not ideal in a real time domain because it concerns itself with reaching a leaf node as fast as possible, not with the value of the actions it might obtain along the way. My thesis presents an alternative heuristic, the action-based heuristic, which may be used to structure a decision tree; the resulting structure together with the actions themselves is called an action-based hierarchy. The approach is validated in several ways | |
| 520 | 3 | |a First a complexity analysis is undertaken to show that the complexity of a structuring algorithm is not prohibitive. Then some theoretical results are given; this is followed by experiments with abstract inputs and inputs from a real-time domain, surgical intensive care unit patient monitoring. The thesis concludes with a description of an implementation of these ideas in a system known as ReAct. | |
| 650 | 4 | |a Real-time data processing | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1498 |w (DE-604)BV008928280 |9 1498 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006321073 | ||
Datensatz im Suchindex
| _version_ | 1804123908082761728 |
|---|---|
| any_adam_object | |
| author | Ash, David |
| author_facet | Ash, David |
| author_role | aut |
| author_sort | Ash, David |
| author_variant | d a da |
| building | Verbundindex |
| bvnumber | BV009568014 |
| ctrlnum | (OCoLC)30464394 (DE-599)BVBBV009568014 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02808nam a2200349 cb4500</leader><controlfield tag="001">BV009568014</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940427s1993 m||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30464394</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009568014</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ash, David</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Diagnosis using action-based hierarchies for optimal real-time performance</subfield><subfield code="c">by David Ash</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Reportnr.: KSL 93 69</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 141 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1498</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Stanford, Calif, Univ., Diss.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "To respond effectively in real time, an agent needs to be able to deal effectively with differing availability of information. In particular, although the agent ideally would like to be able to diagnose one or more particular faults that may be present at a given time, a deadline may prevent it from doing so because prior to the deadline it is required to act or face a catastrophic outcome. Thus an agent should have available to it a set of actions some of which are appropriate, but not optimal, for large classes of faults and some of which are appropriate for specific faults</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Tests are available to help the agent diagnose a fault; given this framework decision trees would provide one possible approach to this diagnosis problem. However this work shows that the information-theoretic heuristic commonly used to structure decision trees is not ideal in a real time domain because it concerns itself with reaching a leaf node as fast as possible, not with the value of the actions it might obtain along the way. My thesis presents an alternative heuristic, the action-based heuristic, which may be used to structure a decision tree; the resulting structure together with the actions themselves is called an action-based hierarchy. The approach is validated in several ways</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">First a complexity analysis is undertaken to show that the complexity of a structuring algorithm is not prohibitive. Then some theoretical results are given; this is followed by experiments with abstract inputs and inputs from a real-time domain, surgical intensive care unit patient monitoring. The thesis concludes with a description of an implementation of these ideas in a system known as ReAct.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Real-time data processing</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1498</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1498</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006321073</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV009568014 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:37:14Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006321073 |
| oclc_num | 30464394 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | IX, 141 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Ash, David Verfasser aut Diagnosis using action-based hierarchies for optimal real-time performance by David Ash Reportnr.: KSL 93 69 Stanford, Calif. 1993 IX, 141 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1498 Stanford, Calif, Univ., Diss. Abstract: "To respond effectively in real time, an agent needs to be able to deal effectively with differing availability of information. In particular, although the agent ideally would like to be able to diagnose one or more particular faults that may be present at a given time, a deadline may prevent it from doing so because prior to the deadline it is required to act or face a catastrophic outcome. Thus an agent should have available to it a set of actions some of which are appropriate, but not optimal, for large classes of faults and some of which are appropriate for specific faults Tests are available to help the agent diagnose a fault; given this framework decision trees would provide one possible approach to this diagnosis problem. However this work shows that the information-theoretic heuristic commonly used to structure decision trees is not ideal in a real time domain because it concerns itself with reaching a leaf node as fast as possible, not with the value of the actions it might obtain along the way. My thesis presents an alternative heuristic, the action-based heuristic, which may be used to structure a decision tree; the resulting structure together with the actions themselves is called an action-based hierarchy. The approach is validated in several ways First a complexity analysis is undertaken to show that the complexity of a structuring algorithm is not prohibitive. Then some theoretical results are given; this is followed by experiments with abstract inputs and inputs from a real-time domain, surgical intensive care unit patient monitoring. The thesis concludes with a description of an implementation of these ideas in a system known as ReAct. Real-time data processing (DE-588)4113937-9 Hochschulschrift gnd-content Computer Science Department: Report STAN CS Stanford University 1498 (DE-604)BV008928280 1498 |
| spellingShingle | Ash, David Diagnosis using action-based hierarchies for optimal real-time performance Real-time data processing |
| subject_GND | (DE-588)4113937-9 |
| title | Diagnosis using action-based hierarchies for optimal real-time performance |
| title_alt | Reportnr.: KSL 93 69 |
| title_auth | Diagnosis using action-based hierarchies for optimal real-time performance |
| title_exact_search | Diagnosis using action-based hierarchies for optimal real-time performance |
| title_full | Diagnosis using action-based hierarchies for optimal real-time performance by David Ash |
| title_fullStr | Diagnosis using action-based hierarchies for optimal real-time performance by David Ash |
| title_full_unstemmed | Diagnosis using action-based hierarchies for optimal real-time performance by David Ash |
| title_short | Diagnosis using action-based hierarchies for optimal real-time performance |
| title_sort | diagnosis using action based hierarchies for optimal real time performance |
| topic | Real-time data processing |
| topic_facet | Real-time data processing Hochschulschrift |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT ashdavid diagnosisusingactionbasedhierarchiesforoptimalrealtimeperformance AT ashdavid reportnrksl9369 |