Genre
Autoencoder, Principal Component Analysis and Support Vector Regression for Data Imputation
Marivate, Vukosi N., Nelwamodo, Fulufhelo V., Marwala, Tshilidzi
Data collection often results in records that have missing values or variables. This investigation compares 3 different data imputation models and identifies their merits by using accuracy measures. Autoencoder Neural Networks, Principal components and Support Vector regression are used for prediction and combined with a genetic algorithm to then impute missing variables. The use of PCA improves the overall performance of the autoencoder network while the use of support vector regression shows promising potential for future investigation. Accuracies of up to 97.4 % on imputation of some of the variables were achieved.
Introduction to the Special Issue on Innovative Applications of Artificial Intelligence
Porter, Bruce, Cheetham, William
We are very pleased to republish here extended versions of a sample of the papers drawn from the Innovative Applications of Artificial Intelligence Conference (IAAI-06), which was held July 17-20, 2006, in Boston, Massachusetts. Three of these articles describe deployed applications and two describe emerging applications.
The Second International Conference on Human-Robot Interaction
Schultz, Alan C., Breazeal, Cynthia, Fong, Terry, Kiesler, Sara
Hackman delivered a talk entitled "Humans, Robots, and Teams" that leveraged work in The conference's outstanding paper award went to "Humanoid Robots as a Passive-Social Medium: A Field Experiment at a Train Station" by Kotaro The best student paper award went to Guy Hoffman and Cynthia Breazeal for their paper, titled "Effects of Anticipatory HRI-2007 was the second step "Speed Adaptation for a Robot Walking Spurred by included teamwork, social robotics, momentum has been built for HRI-advances in robotics technologies and adaptation, observation and metrics, 2008, which will be held in Amsterdam, communications, many researchers attention, user experience, and The Netherlands, March 12-15, are studying how to use these field testing. The 21st International FLAIRS Conference (FLAIRS-21) will be held May 15 - 17, 2008 at the Grand Bay Miami Hotel in the village of Coconut Grove, Miami, Florida, USA. The conference hotel is on the waterfront of Biscayne Bay close to downtown Miami and South Beach. FLAIRS-21 will feature technical papers, special tracks, and General Chair invited speakers on artificial intelligence. Architectures: Agents and distributed AI, Intelligent user interfaces, Natural lane@ict.usc.edu
AAAI News
Symposia will be limited to between forty and sixty participants. Each participant will be expected to attend a single symposium. In addition to invited participants, a limited number of other interested parties will be allowed to register in each symposium on a first-come, first-served basis. Working notes will be prepared and distributed to participants in each symposium, but will not otherwise be available unless published as an AAAI Technical Report or edited collection. The final deadline for registration is October 12, 2007. For registration information, please contact AAAI at fss07@aaai.org or visit AAAI's web site (www.aaai.org/Symposia/Fall/fss07.
Heuristic Search and Information Visualization Methods for School Redistricting
desJardins, Marie, Bulka, Blazej, Carr, Ryan, Jordan, Eric, Rheingans, Penny
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a county or school district. This is a multicriteria optimization problem in which competing objectives, such as school capacity, busing costs, and socioeconomic distribution, must be considered. Because of the complexity of the decision-making problem, tools are needed to help end users generate, evaluate, and compare alternative school assignment plans. A key goal of our research is to aid users in finding multiple qualitatively different redistricting plans that represent different trade-offs in the decision space. We present heuristic search methods that can be used to find a set of qualitatively different plans, and give empirical results of these search methods on population data from the school district of Howard County, Maryland. We show the resulting plans using novel visualization methods that we have developed for summarizing and comparing alternative plans.
Machine Translation for Manufacturing: A Case Study at Ford Motor Company
Machine translation (MT) was one of the first applications of artificial intelligence technology that was deployed to solve real-world problems. Since the early 1960s, researchers have been building and utilizing computer systems that can translate from one language to another without requiring extensive human intervention. In the late 1990s, Ford Vehicle Operations began working with Systran Software Inc. to adapt and customize its machine-translation technology in order to translate Ford's vehicle assembly build instructions from English to German, Spanish, Dutch, and Portuguese. The use of machine translation was made necessary by the vast amount of dynamic information that needed to be translated in a timely fashion. The assembly build instructions at Ford contain text written in a controlled language as well as unstructured remarks and comments. The MT system has already translated more than 7 million instructions into these languages and is an integral part of the overall manufacturing process-planning system used to support Ford's assembly plants in Europe, Mexico and South America. In this paper, we focus on how AI techniques, such as knowledge representation and natural language processing can improve the accuracy of machine translation in a dynamic environment such as auto manufacturing.
An algorithmic and a geometric characterization of Coarsening At Random
Gill, Richard D., Grunwald, Peter D.
We show that the class of conditional distributions satisfying the coarsening at Random (CAR) property for discrete data has a simple and robust algorithmic description based on randomized uniform multicovers: combinatorial objects generalizing the notion of partition of a set. However, the complexity of a given CAR mechanism can be large: the maximal "height" of the needed multicovers can be exponential in the number of points in the sample space. The results stem from a geometric interpretation of the set of CAR distributions as a convex polytope and a characterization of its extreme points. The hierarchy of CAR models defined in this way could be useful in parsimonious statistical modelling of CAR mechanisms, though the results also raise doubts in applied work as to the meaningfulness of the CAR assumption in its full generality. This paper has been accepted for publication in the Annals of Statistics. It will appear later in 2007 or in 2008.
Toward Psycho-robots
We try to perform geometrization of psychology by representing mental states, <
Efficient Tabling Mechanisms for Transaction Logic Programs
In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Transaction Logic. The first method is based on tabling and we modified the proof theory to table calls and answers on states (practically, equivalent to dynamic programming). The call-answer table is indexed on the call and a signature of the state in which the call was made. The answer columns contain the answer unification and a signature of the state after the call was executed. The states are signed efficiently using a technique based on tries and counting. The second method is based on incremental evaluation and it applies when the data oracle contains derived relations. The deletions and insertions (executed in the transaction oracle) change the state of the database. Using the heuristic of inertia (only a part of the state changes in response to elementary updates), most of the time it is cheaper to compute only the changes in the state than to recompute the entire state from scratch. The two methods are complementary by the fact that the first method optimizes the evaluation when a call is repeated in the same state, and the second method optimizes the evaluation of a new state when a call-state pair is not found by the tabling mechanism (i.e. the first method). The proof theory of Transaction Logic with the application of tabling and incremental evaluation is sound and complete with respect to its model theory.
Enrichment of Qualitative Beliefs for Reasoning under Uncertainty
Li, Xinde, Huang, Xinhan, Smarandache, Florentin, Dezert, Jean
Qualitative methods for reasoning under uncertainty have gained more and more attention by Information Fusion community, especially by the researchers and system designers working in the development of modern multi-source systems for defense, robotics and so on. This is because traditional methods based only on quantitative representation and analysis are not able to completely satisfy adequately the need of the development of science and technology integrating at higher fusion levels human beliefs and reports in complex systems. Therefore qualitative knowledge representation becomes more and more important and necessary in next generations of (semi) intelligent automatic and autonomous systems. For example, Wagner et al. [16] consider that although recent robots have powerful sensors and actuators, their abilities to show intelligent behavior is often limited because of lacking of appropriate spatial representation. Ranganathan et al. [11] describe a navigation system for a mobile robot which must execute motions in a building, the environment is represented by a topological model based on a Generalized Voronoi Graph (GVG) and by a set of visual landmarks. A qualitative self-localization method for indoor environment using a belt of ultrasonic sensors and a camera is proposed. Moratz et al. [6] point out that qualitative spatial reasoning(QSR) abstracts metrical details of the physical world, of which two main directions are topological reasoning about regions and reasoning about orientations of point configurations. So, because concrete problems need a combination of qualitative knowledge of orientation and qualitative knowledge of distance, they present a calculus based on ternary relations where they introduce a qualitative distance measurement based on two of the three points.