Case-Based Reasoning
Calendar of Events
The seventh biennial Bar-Ilan International Symposium on the Foundations of Artificial Intelligence, will be held on June 25-27, 2001 in Ramat Gan, Israel. The meeting will honor the research and accomplishments of Yaacov Choueka and will therefore place special emphasis on natural language processing and computational linguistics, in addition to the usual topics of the symposium. Moshe Vardi The BISFAI-01 program, schedule and registration information will be available at the BISFAI website: www.cs.biu.ac.il/ bisfai, along with abstracts of invited and accepted papers and pointers to online versions.For further information or requests, contact: bisfai@cs.biu.ac.il. Contact: Joaquim Filipe School of Technology of the Polytechnic Institute of Setubal EST Setubal, Campus do IPS / R. Vale Chaves - Estefanilha Setubal 2910 Portugal Voice: 351-265 790040 Fax: 351-265 721 869 Email: jfilipe@est.ips.pt Faculty Positions for Intelligent Aerospace Systems Program The College of Engineering at the University of Oklahoma invites applications for 3 to 5 new faculty positions at all levels in the area of Intelligent Systems.
1993 Index
Czerwinski, Mary, see Nguyen, Trung 1992 AAAI Robot Exhibition and Competition see Dean, Thomas 1992 Workshop on Design Rationale Capture and Use, The, see Lee, Jintae Advances in Real-Time Expert System Technologies, see Barachini, Franz AI and Creativity: 1993 Spring Symposium Report, see Kim, Steven AI and N&Hard Problems: 1993 Spring Symposium Report, see Crawford, James AI Research and Application Development at Boeing's Huntsville Laboratories see Tanner, Steve Anick, Peter; and Simoudis, Evange-10s. Agent Architectures, see Hanks, Steve Berman, Jay I. see Wright, Jon R. Bonasso, R. Peter see Dean, Thomas Bookman, Lawrence, see Sun, Ron Brown, Karen E. see Wright, Jon R. Building Lexicons Two Winner see Congdon, Clare Carnes, Ray, see Tanner, Steve Case-Based Reasoning and Information Retrieval: 1993 Spring Symposium Report, see Anick, Peter Chandrasekaran, B.; Narayanan, N. Hari; and Iwasaki, Yumi. Charniak, Eugene, see Goldman, Robert l? Chien, Steve, see Gat, Erann. Cohen, Paul R., see Hanks, Steve Compaq Quicksource: Providing the Consumer with the Power Drummond, Mark, see Lansky, Amy Engineering Design through Constraint-Based Reasoning, see Murtagh, Niall Etzioni, Oren. Goal-Driven Learning: Fundamental Issues: A Symposium Report, see Leake, David Goldman, Robert l?; Charniak, Eugene; Gale, William; and Norvig, Peter.
AI and Creativity
This article contains summaries of the eight symposia that were conducted: AI and Creativity, AI and NP-Hard Problems, Building Lexicons for Machine Translation, Case-Based Reasoning and Information Retrieval, Foundations of Automatic Planning, Innovative Applications of Massive Parallelism, Reasoning about Mental States, and Training Issues in Incremental Learning. Technical reports of the symposia AI and Creativity, Building Lexicons for Machine Translation, Case-Based Reasoning and Information Retrieval, Foundations of Automatic Planning, Innovative Applications of Massive Parallelism, Reasoning about Mental States, and Training Issues in Incremental Learning are available from AAAI. Instructions and an order form for purchasing electronic and hardcopy versions can be found elsewhere in this issue. The symposium AI and Creativity attracted participants from widely differing backgrounds, including philosophy, science, education, engineering, and even computer science. The major themes of the meeting were the nature of creativity, computational models of creativity, and computational support for creativity.
Contributors
Hojjat Adeli, coauthor of "A Novel Approach to Expert Systems for the Design of Large Structures, " is currently a professor of civil engineering at The Ohio State University, 470 Hitchcock Hall, 2070 Neil Avenue, Columbus, Ohio 43210. He received his Ph.D. from Stanford University in 1976 and is editor-inchief of the International Journal of Microcomputers in Civil Engineering. A contributor to 20 journals, he is the author or editor of over 160 publications in various fields of computer-aided engineering and is the editor of the forthcoming book series Knowledge Engineering, to be published by McGraw-Hill The first two volumes are scheduled for publication in mid-1989. Dean Allemang, coauthor of "Connectionism and Information Processing Abstractions: The Message Still Counts More Than the Medium," is a graduate research fellow at the Laboratory for Artificial Intelligence Research in the Department of Computer and Information Science at The Ohio State University, Columbus, Ohio 43210. He is currently writing his Ph.D. dissertation on a devicebased understanding of software.
The General Motors Variation-Reduction Adviser
The General Motors Variation-Reduction Adviser is a knowledge system built on case-based reasoning principles that is currently in use in eighteen General Motors asssembly centers. This article reviews the overall characteristics of the system and then focuses on various AI elements critical to support its deployment to a production system. A key AI enabler is ontology-guided search using domainspecific ontologies. The primary use of VRA is to improve communication in the plants and between plants to assist with problem solving necessary to keep the line producing the highest quality products. Our original prototype was tested by a "dimensional management" team working on "variation reduction" problems in a plant.
AAAI Conferences Calendar
This page includes forthcoming AAAI sponsored conferences, conferences presented by AAAI Affiliates, and conferences held in cooperation with AAAI. AI Magazine also maintains a calendar listing that includes nonaffiliated conferences at www.aaai.org/Magazine/calendar.php. HCOMP 2014 will be held November 2-4 in Pittsburgh, PA USA. The AAAI Fall Symposium Series will be held November 13-15 in Arlington, VA USA. AAAI-15 will be held January 25-29 in Austin, Texas, USA.
Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions
Kontorovich, Aryeh, Sabato, Sivan, Weiss, Roi
We examine the Bayes-consistency of a recently proposed 1-nearest-neighbor-based multiclass learning algorithm. This algorithm is derived from sample compression bounds and enjoys the statistical advantages of tight, fully empirical generalization bounds, as well as the algorithmic advantages of a faster runtime and memory savings. We prove that this algorithm is strongly Bayes-consistent in metric spaces with finite doubling dimension --- the first consistency result for an efficient nearest-neighbor sample compression scheme. Rather surprisingly, we discover that this algorithm continues to be Bayes-consistent even in a certain infinite-dimensional setting, in which the basic measure-theoretic conditions on which classic consistency proofs hinge are violated. This is all the more surprising, since it is known that k-NN is not Bayes-consistent in this setting. We pose several challenging open problems for future research.