{"title":"Constraint satisfaction for production system match","authors":"M. Perlin","doi":"10.1109/TAI.1992.246376","DOIUrl":"https://doi.org/10.1109/TAI.1992.246376","url":null,"abstract":"An attempt is made to improve production system match by incorporating the arc consistency (AC) algorithm, in the RETE algorithm. This approach combines the constraint graphs of RETE and AC into a single network, which is then incrementally updated. Empirical studies show the technique to be most efficacious with expensive rules. Thus, by using the lookahead from AC preprocessing, in many cases costly RETE computation can be effectively reduced.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121902077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hybrid architecture for text classification","authors":"M. S. Register, Narasimham Kannan","doi":"10.1109/TAI.1992.246417","DOIUrl":"https://doi.org/10.1109/TAI.1992.246417","url":null,"abstract":"SKIS, a prototype system that allows for the construction and use of text classification applications, is discussed. SKIS uses a combination of knowledge-based techniques, statistical techniques, morphological processing, and relevance feedback learning techniques to perform text classification. SKIS has been used to construct a prototype text classification application for the routing of customer service requests within customer support centers. The SKIS run-time architecture, the development and knowledge maintenance environment, and how SKIS is used are described. The benefits of combining knowledge-based and statistical techniques for text classification are discussed. SKIS is compared with other text classification systems.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124812865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IKD: a knowledge-based tool for integrating a knowledge base and a database","authors":"Hideaki Ito, T. Fukumura","doi":"10.1109/TAI.1992.246451","DOIUrl":"https://doi.org/10.1109/TAI.1992.246451","url":null,"abstract":"In order to integrate a knowledge-based system (KBS) and relational database system (RDBS) more naturally and flexibly, it is necessary to work with these two systems cooperatively. The IKD system functions as an interface between the KBS and RDBS by representing their conceptual structures in frames. Two types of frames are distinguished from one another: one defines the data structure of an integrating database (DB) and the other represents conceptual objects dealing with a KBS. Several types of operations on the DB are processed based on message passing among frames.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233795","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extending inductive methods to create practical tools for building expert systems","authors":"B. Leng, B. Buchanan","doi":"10.1109/TAI.1992.246445","DOIUrl":"https://doi.org/10.1109/TAI.1992.246445","url":null,"abstract":"Induction programs make several assumptions that limit their practical utility. Research to overcome the limitation of working within a fixed vocabulary is reported. A recently reported phenomenon in machine learning is that there is a tradeoff between the simplicity of concept descriptions and coverage of training instances, and a learning system cannot have both. It is argued that if a learning system can generate new terms, it can achieve both simplicity and coverage. A method for generating one new kind of terms, comparative terms, is given. The experimental results on a mushroom classification task show that a single comparative term can achieve 90% predictive accuracy.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129245092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fault diagnosis of power distribution lines by using discrimination tree","authors":"M. Togami, N. Abe, T. Kitahashi, H. Ogawa","doi":"10.1109/TAI.1992.246452","DOIUrl":"https://doi.org/10.1109/TAI.1992.246452","url":null,"abstract":"A method for creating a discrimination tree and its application in a machine-learning-based power fault diagnosis system are discussed. An algorithm for diagnosing a single distribution line that is developed automatically by the machine learning system is presented. The performance of machine learning for fault diagnosis using a discrimination tree, an artificial neural network, and an expert system are compared.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"68 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tools for automating experiment design: a machine learning approach","authors":"Yongwon Lee, S. Clearwater","doi":"10.1109/TAI.1992.246423","DOIUrl":"https://doi.org/10.1109/TAI.1992.246423","url":null,"abstract":"Work that uses an inductive learning tool, HEP-RL (high-energy-physics rule learner), in the design of a very complex artifact, a high-energy-physics experiment, is reported. The important contribution is the observation that the results of learning provide a more complete and robust design. This is because there were end users of the learning able to suggest constraints beyond the usual simple coverage metrics. This allowed for more confidence in the design.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133273087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A neuro-expert system architecture with application to alarm processing in a power system control centre","authors":"R. Khosla, T. Dillon","doi":"10.1109/TAI.1992.246457","DOIUrl":"https://doi.org/10.1109/TAI.1992.246457","url":null,"abstract":"A generic neuro-expert system architecture which can overcome difficulties faced by stand-alone expert systems and artificial neural networks is proposed. It can be applied in various problem domains, such as engineering and fault diagnosis, which require problem decomposition. It is recommended for use in real-time systems. The neuro-expert system architecture can be used at different levels of a power system hierarchy for alarm interpretation and fault diagnosis.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"344 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115675393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A new decision-tree classification algorithm for machine learning","authors":"Pei-Lei Tu, J.-Y. Chung","doi":"10.1109/TAI.1992.246431","DOIUrl":"https://doi.org/10.1109/TAI.1992.246431","url":null,"abstract":"Although decision-tree classification algorithms have been widely used for machine learning in artificial intelligence, there has been little research toward evaluating the performance or quality of the current classification algorithms and investigating the time and computational complexity of constructing the smallest size decision tree which best distinguishes characteristics of multiple distinct groups. A known NP-complete problem, 3-exact cover, is used to prove that this problem is NP-complete. One prevalent classification algorithm in machine learning, ID3, is evaluated. The greedy search procedure used by ID3 is found to create anomalous behavior with inferior decision trees on a lot of occasions. A decision-tree classification algorithm, the intelligent decision-tree algorithm (IDA), that overcomes these anomalies with better classification performance is presented. A time analysis shows that IDA is more computationally efficient than ID3, and a simulation study indicates that IDA outperforms ID3.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124126971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic version spaces in machine learning","authors":"William Sverdlik, R. Reynolds","doi":"10.1109/TAI.1992.246421","DOIUrl":"https://doi.org/10.1109/TAI.1992.246421","url":null,"abstract":"A hybrid learning algorithm for discovering concepts with multiple disjuncts is presented. The algorithm, HYBAL, in incorporating both version spaces and genetic algorithms, extends the work of R.G. Reynolds (1990) to learning of Boolean concepts from an exponentially growing hypothesis space. Learning is accomplished via factoring the underlying version space into tractable subspaces, and then dynamically deriving concepts for the corresponding S set and G sets. In delaying the specification of a concept language until run time, it is demonstrated that HYBAL is capable of solving a larger class of Boolean functions than with traditional version spaces, where concepts are specified at compile time.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116832307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}