{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69587"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69587","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"An Inductive Engine for the Acquisition of Temporal Knowledge","abstract":"The ability to predict the likely occurrence of certain events in the future permits one to make plans in advance in order to achieve a goal. This capability can be acquired empirically by discovering that certain temporal patterns repeat unerringly. Previous work in time-series analysis allows one to make quantitative predictions on the likely values of certain linear variables. Since certain types of knowledge are better expressed in symbolic form, making qualitative predictions based on symbolic representations requires a different approach. This thesis describes a domain-independent method, called TIM (Time-based Inductive Machine), for discovering symbolic temporal patterns from observations using the technique of inductive inference. The problem of discovering temporal patterns from observations can be viewed as a problem in concept acquisition, where the target event to be predicted can be viewed as a class designator, and the "causes" to be discovered can be viewed as the hypothesized descriptions for that class. Using this approach, the "causes" of the target event can be discovered with the application of generalization and specialization operators to partial hypotheses in an orderly way. Three issues that concern the utility of the method in real world domains are addressed. First, a representation based on a modification of first-order predicate logic for expressing temporal concepts/observations is proposed. Generalization/specialization operators and inductive heuristics based on this representation are also given. Second, due to the prevalence of uncertainty in real-world domains, the method is designed to learn probabilistic concepts, as well as concepts with fuzzy boundaries. And finally, the method is designed to learn incrementally in order to offset the penalties incurred by the use of this powerful representation.","abstract_html":"The ability to predict the likely occurrence of certain events in the future permits one to make plans in advance in order to achieve a goal. This capability can be acquired empirically by discovering that certain temporal patterns repeat unerringly. Previous work in time-series analysis allows one to make quantitative predictions on the likely values of certain linear variables. Since certain types of knowledge are better expressed in symbolic form, making qualitative predictions based on symbolic representations requires a different approach. This thesis describes a domain-independent method, called TIM (Time-based Inductive Machine), for discovering symbolic temporal patterns from observations using the technique of inductive inference. The problem of discovering temporal patterns from observations can be viewed as a problem in concept acquisition, where the target event to be predicted can be viewed as a class designator, and the "causes" to be discovered can be viewed as the hypothesized descriptions for that class. Using this approach, the "causes" of the target event can be discovered with the application of generalization and specialization operators to partial hypotheses in an orderly way. Three issues that concern the utility of the method in real world domains are addressed. First, a representation based on a modification of first-order predicate logic for expressing temporal concepts/observations is proposed. Generalization/specialization operators and inductive heuristics based on this representation are also given. Second, due to the prevalence of uncertainty in real-world domains, the method is designed to learn probabilistic concepts, as well as concepts with fuzzy boundaries. And finally, the method is designed to learn incrementally in order to offset the penalties incurred by the use of this powerful representation.","abstract_has_math":false,"creators":["Chen, Kaihu"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Michalski, Ryszard S.,"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:26:01Z","date_published":"2014-12-15T19:26:01Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8815328"],"render_values":[{"text":"(UMI)AAI8815328","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69587","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Michalski, Ryszard S.,"]},{"key":"dc:creator","label":"Author","values":["Chen, Kaihu"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:26:01Z","10000-01-01","1988"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69587","(UMI)AAI8815328"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["The ability to predict the likely occurrence of certain events in the future permits one to make plans in advance in order to achieve a goal. This capability can be acquired empirically by discovering that certain temporal patterns repeat unerringly. Previous work in time-series analysis allows one to make quantitative predictions on the likely values of certain linear variables. Since certain types of knowledge are better expressed in symbolic form, making qualitative predictions based on symbolic representations requires a different approach. This thesis describes a domain-independent method, called TIM (Time-based Inductive Machine), for discovering symbolic temporal patterns from observations using the technique of inductive inference. The problem of discovering temporal patterns from observations can be viewed as a problem in concept acquisition, where the target event to be predicted can be viewed as a class designator, and the "causes" to be discovered can be viewed as the hypothesized descriptions for that class. Using this approach, the "causes" of the target event can be discovered with the application of generalization and specialization operators to partial hypotheses in an orderly way. Three issues that concern the utility of the method in real world domains are addressed. First, a representation based on a modification of first-order predicate logic for expressing temporal concepts/observations is proposed. Generalization/specialization operators and inductive heuristics based on this representation are also given. Second, due to the prevalence of uncertainty in real-world domains, the method is designed to learn probabilistic concepts, as well as concepts with fuzzy boundaries. And finally, the method is designed to learn incrementally in order to offset the penalties incurred by the use of this powerful representation.","Made available in DSpace on 2014-12-15T19:26:01Z (GMT). No. of bitstreams: 1 8815328.pdf: 4722079 bytes, checksum: 25860982cad6c4a39df7e503ec4afc14 (MD5) Previous issue date: 1988","Embargo set by: Seth Robbins for item 69753 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988."]},{"key":"dc:title","label":"Title","values":["An Inductive Engine for the Acquisition of Temporal Knowledge"]}]}],"canonical_facts":{"dc:contributor":["Michalski, Ryszard S.,"],"dc:creator":["Chen, Kaihu"],"dc:date":["2014-12-15T19:26:01Z","10000-01-01","1988"],"dc:description":["The ability to predict the likely occurrence of certain events in the future permits one to make plans in advance in order to achieve a goal. This capability can be acquired empirically by discovering that certain temporal patterns repeat unerringly. Previous work in time-series analysis allows one to make quantitative predictions on the likely values of certain linear variables. Since certain types of knowledge are better expressed in symbolic form, making qualitative predictions based on symbolic representations requires a different approach. This thesis describes a domain-independent method, called TIM (Time-based Inductive Machine), for discovering symbolic temporal patterns from observations using the technique of inductive inference. The problem of discovering temporal patterns from observations can be viewed as a problem in concept acquisition, where the target event to be predicted can be viewed as a class designator, and the "causes" to be discovered can be viewed as the hypothesized descriptions for that class. Using this approach, the "causes" of the target event can be discovered with the application of generalization and specialization operators to partial hypotheses in an orderly way. Three issues that concern the utility of the method in real world domains are addressed. First, a representation based on a modification of first-order predicate logic for expressing temporal concepts/observations is proposed. Generalization/specialization operators and inductive heuristics based on this representation are also given. Second, due to the prevalence of uncertainty in real-world domains, the method is designed to learn probabilistic concepts, as well as concepts with fuzzy boundaries. And finally, the method is designed to learn incrementally in order to offset the penalties incurred by the use of this powerful representation.","Made available in DSpace on 2014-12-15T19:26:01Z (GMT). No. of bitstreams: 1 8815328.pdf: 4722079 bytes, checksum: 25860982cad6c4a39df7e503ec4afc14 (MD5) Previous issue date: 1988","Embargo set by: Seth Robbins for item 69753 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","139 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988."],"dc:identifier":["http://hdl.handle.net/2142/69587","(UMI)AAI8815328"],"dc:subject":["Computer Science"],"dc:title":["An Inductive Engine for the Acquisition of Temporal Knowledge"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}