Genre
From Data Mining to Knowledge Discovery in Databases
Fayyad, Usama, Piatetsky-Shapiro, Gregory, Smyth, Padhraic
Data mining and knowledge discovery in databases have been attracting a significant amount of research, industry, and media attention of late. What is all the excitement about? This article provides an overview of this emerging field, clarifying how data mining and knowledge discovery in databases are related both to each other and to related fields, such as machine learning, statistics, and databases. The article mentions particular real-world applications, specific data-mining techniques, challenges involved in real-world applications of knowledge discovery, and current and future research directions in the field.
The 1996 Simon Newcomb Award
Ford, Kenneth M., Hayes, Patrick J.
Simon Newcomb was a distinguished astronomer and computer who "proved" that heavier- than-air flight was impossible. His proofs are ingenious, cleverly argued, quite convincing to many of his contemporaries, and utterly wrong. The Simon Newcomb Award is given annually for the silliest published argument attacking AI. Our subject may be unique in the virulence and frequency with which it is attacked, both in the popular media and among the cultured intelligentsia. Recent articles have argued that the very idea of AI reflects a cancer in the heart of our culture and have proven (yet again) that it is impossible. While many of these attacks are cited widely, most of them are ridiculous to anyone with an appropriate technical education.
Using Anytime Algorithms in Intelligent Systems
Anytime algorithms give intelligent systems the capability to trade deliberation time for quality of results. This capability is essential for successful operation in domains such as signal interpretation, real-time diagnosis and repair, and mobile robot control. What characterizes these domains is that it is not feasible (computationally) or desirable (economically) to compute the optimal answer. This article surveys the main control problems that arise when a system is composed of several anytime algorithms. These problems relate to optimal management of uncertainty and precision. After a brief introduction to anytime computation, I outline a wide range of existing solutions to the metalevel control problem and describe current work that is aimed at increasing the applicability of anytime computation.
Life in the Fast Lane: The Evolution of an Adaptive Vehicle Control System
Giving robots the ability to operate in the real world has been, and continues to be, one of the most difficult tasks in AI research. Since 1987, researchers at Carnegie Mellon University have been investigating one such task. Their research has been focused on using adaptive, vision-based systems to increase the driving performance of the Navlab line of on-road mobile robots. This research has led to the development of a neural network system that can learn to drive on many road types simply by watching a human teacher. This article describes the evolution of this system from a research project in machine learning to a robust driving system capable of executing tactical driving maneuvers such as lane changing and intersection navigation.
Eighth Workshop on the Validation and Verification of Knowledge-Based Systems
The Workshop on the Validation and Verification of Knowledge-Based Systems gathers researchers from government, industry, and academia to present the most recent information about this important development aspect of knowledge-based systems (KBSs). The 1995 workshop focused on nontraditional KBSs that are developed using more than just the simple rule-based paradigm. This new focus showed how researchers are adjusting to the shift in KBS technology from stand-alone rule-based expert systems to embedded systems that use object-oriented technology, uncertainty, and nonmonotonic reasoning.
Citation-Based Journal Rankings for AI Research A Business Perspective
Cheng, Chun Hung, Holsapple, Clyde W., Lee, Anita
A significant and growing area of business-computing research is concerned with AI. Knowledge about which journals are the most influential forums for disseminating AI research is important for business school faculty, students, administrators, and librarians. To date, there has been only one study attempting to rank AI journals from a business-computing perspective. It used a subjective methodology, surveying opinions of business faculty about a prespecified list of 30 journals. Here, we report the results of a more objective study. We conducted a citation analysis covering a time period of 5 years to compile 15,600 citations to 1,244 different journals. Based on these data, the journals are ranked in two ways involving the magnitude and the duration of scientific impact each has had in the field of AI.
Hybrid Connectionist-Symbolic Modules: A Report from the IJCAI-95 Workshop on Connectionist-Symbolic Integration
The Workshop on Connectionist-Symbolic Integration: From Unified to Hybrid Approaches was held on 19 to 20 August 1995 in Montreal, Canada, in conjunction with the Fourteenth International Joint Conference on Artificial Intelligence. The focus of the workshop was on learning and architectures that feature hybrid representations and support hybrid learning. The general consensus was that hybrid connectionist-symbolic models constitute a promising avenue to the development of more robust, more powerful, and more versatile architectures for both cognitive modeling and intelligent systems.
The 1996 AAAI Spring Symposia Reports
Gil, Yolanda, Sen, Sandip, Kohane, Isaac, Olivier, Patrick, Nakata, Keiichi, Eugenio, Barbara Di, Green, Nancy, Dean, Thomas, Hearst, Marti, Nourbakhsh, Illah R.
The Association for the Advancement of Artificial Intelligence held its 1996 Spring Symposia Series on March 27 to 29 at Stanford University. This article contains summaries of the eight symposia that were conducted: (1) Acquisition, Learning, and Demonstration: Automating Tasks for Users; (2) Adaptation, Coevolution, and Learning in Multiagent Systems; (3) Artificial Intelligence in Medicine: Applications of Current Technologies; (4) Cognitive and Computational Models of Spatial Representation; (5) Computational Implicature: Computational Approaches to Interpreting and Generating Conversational Implicature; (6) Computational Issues in Learning Models of Dynamic Systems; (7) Machine Learning in Information Access; and (8) Planning with Incomplete Information for Robot Problems.
Adaptive Problem-solving for Large-scale Scheduling Problems: A Case Study
Although most scheduling problems are NP-hard, domain specific techniques perform well in practice but are quite expensive to construct. In adaptive problem-solving solving, domain specific knowledge is acquired automatically for a general problem solver with a flexible control architecture. In this approach, a learning system explores a space of possible heuristic methods for one well-suited to the eccentricities of the given domain and problem distribution. In this article, we discuss an application of the approach to scheduling satellite communications. Using problem distributions based on actual mission requirements, our approach identifies strategies that not only decrease the amount of CPU time required to produce schedules, but also increase the percentage of problems that are solvable within computational resource limitations.
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., Moore, A. W.
This paper surveys the field of reinforcement learning from a computer-science perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning is the problem faced by an agent that learns behavior through trial-and-error interactions with a dynamic environment. The work described here has a resemblance to work in psychology, but differs considerably in the details and in the use of the word ``reinforcement.'' The paper discusses central issues of reinforcement learning, including trading off exploration and exploitation, establishing the foundations of the field via Markov decision theory, learning from delayed reinforcement, constructing empirical models to accelerate learning, making use of generalization and hierarchy, and coping with hidden state. It concludes with a survey of some implemented systems and an assessment of the practical utility of current methods for reinforcement learning.