Drexel University
The AAAI-13 Conference Workshops
Agrawal, Vikas (IBM Research-India) | Archibald, Christopher (Mississippi State University) | Bhatt, Mehul (University of Bremen) | Bui, Hung (Nuance) | Cook, Diane J. (Washington State University) | Cortés, Juan (University of Toulouse) | Geib, Christopher (Drexel University) | Gogate, Vibhav (University of Texas at Dallas) | Guesgen, Hans W. (Massey University) | Jannach, Dietmar (TU Dortmund) | Johanson, Michael (University of Alberta) | Kersting, Kristian (University of Bonn) | Konidaris, George (Massachusetts Institute of Technology) | Kotthoff, Lars (University College Cork) | Michalowski, Martin (Adventium Labs) | Natarajan, Sriraam (Indiana University) | O'Sullivan, Barry (University College Cork) | Pickett, Marc (Naval Research Laboratory) | Podobnik, Vedran (University of Zagreb) | Poole, David (University of British Columbia) | Shastri, Lokendra (GM Research, India) | Shehu, Amarda (George Mason University) | Sukthankar, Gita (University of Central Florida)
Report on the 21st International Conference on Case-Based Reasoning
Ontanon, Santiago (Drexel University) | Delany, Sarah Jane (Dublin Institute of Technology) | Cheetham, William E. (Capital District Physicians')
In cooperation with the Association for the Advancement of Artificial Intelligence (AAAI), the twenty-first International Conference on Case-Based Reasoning (ICCBR), the premier international meeting on research and applications in Case-Based Reasoning (CBR), was held in July 2013 in Saratoga Springs, NY. ICCBR is the annual meeting of the CBR community and the leading conference on this topic. This year ICCBR featured the Industry Day, the fifth annual Doctoral Consortium and three workshops.
Report on the 21st International Conference on Case-Based Reasoning
Ontanon, Santiago (Drexel University) | Delany, Sarah Jane (Dublin Institute of Technology) | Cheetham, William E. (Capital District Physicians')
Springs, NY. ICCBR is the annual meeting of the CBR community and the ICCBR also featured a workshop program consisting of three workshops. The main conference track featured 16 research paper presentations, nine posters, and two invited speakers. The papers and posters reflected the state of the art of case-based reasoning, dealing both with open problems at the core of CBR (especially in similarity assessment, case adaptation, and case-based maintenance), as well as trending applications of CBR (especially recommender systems and computer games) and the intersections of CBR with other areas such as multiagent systems. The first invited speaker, Igor Jurisica from the Ontario Cancer Institute and the University of Toronto, spoke about how to scale up case-based reasoning for "big data" applications. The Case-Based Reasoning in Health Sciences workshop, organized by Isabelle Bichindaritz, Cindy Marling, and Stefania Montani, and the EXPPORT workshop (Experience Reuse: Provenance, Process-Orientation and Traces), organized by David Leake, Béatrice Fuchs, Juan A. Recio Garcia, and Stefania Montani, were held jointly and dealt with how to deal with data represented CDPHP, was the local chair; William E. University, and Jonathan Rubin, from Registration information is available at www.aaai.org/Symposia/ the Palo Alto Research Center, were the Spring/ sss14.php.
The AAAI-13 Conference Workshops
Agrawal, Vikas (IBM Research-India) | Archibald, Christopher (Mississippi State University) | Bhatt, Mehul (University of Bremen) | Bui, Hung (Nuance) | Cook, Diane J. (Washington State University) | Cortés, Juan (University of Toulouse) | Geib, Christopher (Drexel University) | Gogate, Vibhav (University of Texas at Dallas) | Guesgen, Hans W. (Massey University) | Jannach, Dietmar (TU Dortmund) | Johanson, Michael (University of Alberta) | Kersting, Kristian (University of Bonn) | Konidaris, George (Massachusetts Institute of Technology) | Kotthoff, Lars (University College Cork) | Michalowski, Martin (Adventium Labs) | Natarajan, Sriraam (Indiana University) | O' (University College Cork) | Sullivan, Barry (Naval Research Laboratory) | Pickett, Marc (University of Zagreb) | Podobnik, Vedran (University of British Columbia) | Poole, David (GM Research, India) | Shastri, Lokendra (George Mason University) | Shehu, Amarda (University of Central Florida) | Sukthankar, Gita
Benjamin Grosof (Coherent Knowledge from episodic memory to great progress is being made on methods Systems) on representing activity create semantic memory, using a combination to solve problems related to structure context through semantic rule methods, of semantic memory and prediction, motion simulation, deriving from experience in the episodic memory to guide users?
The Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games
Ontanon, Santiago (Drexel University)
Game tree search in games with large branching factors is a notoriously hard problem. In this paper, we address this problem with a new sampling strategy for Monte Carlo Tree Search (MCTS) algorithms, called "Naive Sampling", based on a variant of the Multi-armed Bandit problem called the "Combinatorial Multi-armed Bandit" (CMAB) problem. We present a new MCTS algorithm based on Naive Sampling called NaiveMCTS, and evaluate it in the context of real-time strategy (RTS) games. Our results show that as the branching factor grows, NaiveMCTS performs significantly better than other algorithms.
Toward Character Role Assignment for Natural Language Stories
Valls-Vargas, Josep (Drexel University) | Ontañón, Santiago (Drexel University) | Zhu, Jichen (Drexel University)
In this paper we propose a method for automatically assigning narrative roles to characters in stories. To achieve this goal our proposal is to combine natural language processing techniques with domain knowledge extracted from Propp's morphology of the folktale. We use a matrix that encodes the narrative domain knowledge representing the interactions between character roles.
Generating Maps Using Markov Chains
Snodgrass, Sam (Drexel University) | Ontanon, Santiago (Drexel University)
In this paper we outline a method of procedurally generating maps using Markov Chains. Our method attempts to learn what makes a "good" map from a set of given human-authored maps, and then uses those learned patterns to generate new maps. We present an empirical evaluation using the game "Super Mario Bros.," showing encouraging results.
A Comparison of Case Acquisition Strategies for Learning from Observations of State-Based Experts
Ontanon, Santiago (Drexel University) | Floyd, Michael (Carleton University)
This paper focuses on case acquisition strategies in the context of Case-based Learning from Observation (CBLfO). In Learning from Observation (LfO), a system learns behaviors by observing an expert rather than being explicitly programmed. Specifically, we focus on the problem of learning behaviors from experts that reason using internal state information, that is, information that can not be directly observed. The unobservability of this state information means that the behaviors can not be represented by a simple perception-to-action mapping. We propose a new case acquisition strategy called "Similarity-based Chunking", and compare it with existing strategies to address this problem. Additionally, since standard classification accuracy in predicting the expert's actions is known to be a poor measure for evaluating LfO systems, we propose a new evaluation procedure based on two complementary metrics: behavior performance and similarity with the expert.
Applying CBR Principles to Reason without Negative Exemplars
Gunawardena, Sidath (Drexel University) | Weber, Rosina O. (Drexel University)
We investigate a method for applying CBR to a source of data where there are no negative exemplars. Our problem domain is one of recommending characteristics of multidisciplinary collaborators based on a collection of funded grants. Thus, there are no negative exemplars. Lacking sufficient domain knowledge, we seek to apply a feedback algorithm to learn weights even in the absence of negative exemplars. Our approach is based on the assumption that well aligned cases, cases where similar problems have similar solutions, are better suited for learning feature weights. Our approach clusters the problem and solution spaces separately to identify well aligned cases. We also identify poorly aligned cases that may hinder effective learning of weights, and exclude them. The clusters of well aligned cases provide a means to utilize feedback algorithms. We use two methods, case alignment and case cohesion, to show that our approach succeeds in identifying well aligned cases. We also compare our approach to a method based on single class learning, a machine learning approach for reasoning without negatives. Our results show that our approach is viable to learning weight in the absence of negative exemplars.
The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
Riedl, Mark (Georgia Institute of Technology) | Sukthankar, Gita Reese (University of Central Florida) | Jhala, Arnav (University of California, Santa Cruz) | Zhu, Jichen (Drexel University) | Villar, Santiago Ontanon (Drexel University) | Buro, Michael (University of Alberta) | Churchill, David (University of Newfoundland)
The Eighth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE) was held October 8-12, 2012, at Stanford University in Palo Alto, California. The conference included a research and industry track as well as a demonstration program. The conference featured 16 technical papers, 16 posters, and one demonstration, along with invited speakers, the StarCraft Ai competition, a newly-introduced Doctoral Consortium, and 5 workshops.