Above are papers related to the following paper: [Paper_ID] Paper #1119180. 	[Title] Concept Sharing: A Means to Improve Multi-Concept Learning [Abstract] This paper describes several means for sharing between related concepts to improve learning in the same domain. The sharing comes in the form of substructures or possibly entire structures of previous concepts which may aid in learning other concepts. These substructures highlight useful information in the domain. Using two domains, we evaluate the effectiveness of concept sharing with respect to accuracy, concept size, search complexity, and noise resistance. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #566664. 	[Title] Making SME greedy and pragmatic [Abstract] The Structure-Mapping Engine (SME) has successfully modeled several aspects of human consistent interpretations of an analogy. While useful for theoretical explorations, this aspect of the algorithm is both psychologically implausible and computationally inefficient. (2) SME contains no mechanism for focusing on interpretations relevant to an analogizer's goals. This paper describes modifications to SME which overcome these flaws. We describe a greedy merge algorithm which efficiently computes an approximate "best" interpretation, and can generate alternate interpretations when necessary. We describe pragmatic marking, a technique which focuses the mapping to produce relevant, yet novel, inferences. We illustrate these techniques via example and evaluate their performance using empirical data and theoretical analysis. analogical processing. However, it has two significant drawbacks: (1) SME constructs all structurally Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #3085. 	[Title] MAC/FAC: A Model of Similarity-based Retrieval [Abstract] We present a model of similarity-based retrieval which attempts to capture three psychological phenomena: (1) people are extremely good at judging similarity and analogy when given items to compare. (2) Superficial remindings are much more frequent than structural remindings. (3) People sometimes experience and use purely structural analogical re-mindings. Our model, called MAC/FAC (for "many are called but few are chosen") consists of two stages. The first stage (MAC) uses a computationally cheap, non-structural matcher to filter candidates from a pool of memory items. That is, we redundantly encode structured representations as content vectors, whose dot product yields an estimate of how well the corresponding structural representations will match. The second stage (FAC) uses SME to compute a true structural match between the probe and output from the first stage. MAC/FAC has been fully implemented, and we show that it is capable of modeling patterns of access found in psychological data. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1114777. 	[Title] The Case for Graph-Structured Representations [Abstract] Case-based reasoning involves reasoning from cases: specific pieces of experience, the reasoner's or another's, that can be used to solve problems. We use the term "graph-structured" for representations that (1) are capable of expressing the relations between any two objects in a case, (2) allow the set of relations used to vary from case to case, and (3) allow the set of possible relations to be expanded as necessary to describe new cases. Such representations can be implemented as, for example, semantic networks or lists of concrete propositions in some logic. We believe that graph-structured representations offer significant advantages, and thus we are investigating ways to implement such representations efficiently. We make a "case-based argument" using examples from two systems, chiron and caper, to show how a graph-structured representation supports two different kinds of case-based planning in two different domains. We discuss the costs associated with graph-structured representations and describe an approach to reducing those costs, imple mented in caper. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1130653. 	[Title] Functional Programming by Analogy [Abstract] In this paper we describe how the principles of problem solving by analogy can be applied to the domain of functional program synthesis. For this reason, we treat programs as syntactical structures. We discuss two different methods to handle these structures: (a) a graph metric for determining the distance between two program schemes, and (b) the Structure Mapping Engine (an existing system to examine analogical processing). Furthermore we show experimental results and discuss them. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #566653. 	[Title] Proceedings of CogSci89 Structural Evaluation of Analogies: What Counts? [Abstract] Judgments of similarity and soundness are important aspects of human analogical processing. This paper explores how these judgments can be modeled using SME, a simulation of Gentner's structure-mapping theory. We focus on structural evaluation, explicating several principles which psychologically plausible algorithms should follow. We introduce the Specificity Conjecture, which claims that naturalistic representations include a preponderance of appearance and low-order information. We demonstrate via computational experiments that this conjecture affects how structural evaluation should be performed, including the choice of normalization technique and how the systematicity preference is implemented. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1130657. 	[Title] Learning from Examples: Reminding or Heuristic Switching? [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1116839. 	[Title] Modeling Analogical Problem Solving in a Production System Architecture [Abstract] This research is supported by a National Science Foundation Fellowship awarded to Dario Salvucci and Office of Naval Research grant N00014-96-1-0491 awarded to John Anderson. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the National Science Foundation, the Office of Naval Research, or the United States government. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1138091. 	[Title] Use of Analogy in Automated Theorem Proving [Abstract] Technical Report ATP-90, Artificial Intelligence Laboratory, University of Texas at Austin. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #112813. 	[Title] REPRO: Supporting Flowsheet Design by Case-Base Retrieval [Abstract] Case-Based Reasoning (CBR) paradigm is very close to the designer behavior during the conceptual design, and seems to be a fruitable computer aided-design approach if a library of design cases is available. The goal of this paper is to presents the general framework of a case-based retrieval system: REPRO, that supports chemical process design. The crucial problems like the case representation and structural similarity measure are widely described. The presented experimental results and the expert evaluation shows usefulness of the described system in real world problems. The papers ends with discussion concerning research problems and future work. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #10798. 	[Title] Learning physical descriptions from functional definitions, examples, Learning from examples: The effect of different conceptual [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #5062. 	[Title] A Memory Model for Case Retrieval by Activation Passing [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #144330. 	[Title] Utilizing Prior Concepts for Learning [Abstract] The inductive learning problem consists of learning a concept given examples and non-examples of the concept. To perform this learning task, inductive learning algorithms bias their learning method. Here we discuss biasing the learning method to use previously learned concepts from the same domain. These learned concepts highlight useful information for other concepts in the domain. We describe a transference bias and present M-FOCL, a Horn clause relational learning algorithm, that utilizes this bias to learn multiple concepts. We provide preliminary empirical evaluation to show the effects of biasing previous information on noise-free and noisy data. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #395725. 	[Title] Distributed Representations and Nested Compositional Structure [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #91853. 	[Title] GIT-CC-92/60 A Model-Based Approach to Analogical Reasoning and Learning in Design [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1153877. 	[Title] Adapting Abstract Knowledge [Abstract] For a case-based reasoner to use its knowledge flexibly, it must be equipped with a powerful case adapter. A case-based reasoner can only cope with variation in the form of the problems it is given to the extent that its cases in memory can be efficiently adapted to fit a wide range of new situations. In this paper, we address the task of adapting abstract knowledge about planning to fit specific planning situations. First we show that adapting abstract cases requires reconciling incommensurate representations of planning situations. Next, we describe a representation system, a memory organization, and an adaptation process tailored to this requirement. Our approach is implemented in brainstormer, a planner that takes abstract advice. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1153879. 	[Title] Role of Stories 1 [Abstract] PO Box 600 Wellington New Zealand Tel: +64 4 471 5328 Fax: +64 4 495 5232 Internet: Tech.Reports@comp.vuw.ac.nz Technical Report CS-TR-92/4 October 1992 Abstract People often give advice by telling stories. Stories both recommend a course of action and exemplify general conditions in which that recommendation is appropriate. A computational model of advice taking using stories must address two related problems: determining the story's recommendations and appropriateness conditions, and showing that these obtain in the new situation. In this paper, we present an efficient solution to the second problem based on caching the results of the first. Our proposal has been implemented in brainstormer, a planner that takes abstract advice. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #566488. 	[Title] REPRESENTING PHYSICAL AND DESIGN KNOWLEDGE IN INNOVATIVE DESIGN [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #20193. 	[Title] The Structure-Mapping Engine: Algorithm and Examples [Abstract] This paper describes the Structure-Mapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structure-mapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibility enhances cognitive simulation studies by simplifying experimentation. Furthermore, SME is very efficient, making it a useful component in machine learning systems as well. We review the Structure-mapping theory and describe the design of the engine. We analyze the complexity of the algorithm, and demonstrate that most of the steps are polynomial, typically bounded by O (N 2 ). Next we demonstrate some examples of its operation taken from our cognitive simulation studies and work in machine learning. Finally, we compare SME to other analogy programs and discuss several areas for future work. This paper appeared in Artificial Intelligence, 41, 1989, pp 1-63. For more information, please contact forbus@ils.nwu.edu Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1153889. 	[Title] Is analogical problem solving always analogical? The case for imitation. Second draft Is analogical problem [Abstract] HCRL Technical Report 97 By Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1116397. 	[Title] Design, Analogy, and Creativity [Abstract] : Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1152244. 	[Title] The Role of Generic Models in Conceptual Change [Abstract] 1 This research was funded in part by NSF Grant No. IRI-92-10925 and in part by ONR Grant No. N00014-92-J-1234. We thank John Clement for the use of his protocol transcript, James Greeno for his contribution to developing our constructive modeling interpretation of it, and Ryan Tweney for his helpful comments Todd W. Griffith, Nancy J. Nersessian, and Ashok Goel Abstract We hypothesize generic models to be central in conceptual change in science. This hypothesis has its origins in two theoretical sources. The first source, constructive modeling, derives from a philosophical theory that synthesizes analyses of historical conceptual changes in science with investigations of reasoning and representation in cognitive psychology. The theory of constructive modeling posits generic mental models as productive in conceptual change. The second source, adaptive modeling, derives from a computational theory of creative design. Both theories posit situation independent domain abstractions, i.e. generic models. Using a constructive modeling interpretation of the reasoning exhibited in protocols collected by John Clement (1989) of a problem solving session involving conceptual change, we employ the resources of the theory of adaptive modeling to develop a new computational model, ToRQUE. Here we describe a piece of our analysis of the protocol to illustrate how our synthesis of the two theories is being used to develop a system for articulating and testing ToRQUE. The results of our research show how generic modeling plays a central role in conceptual change. They also demonstrate how such an interdisciplinary synthesis can provide significant insights into scientific reasoning. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1108597. 	[Title] Analogical Problem Solving by Adaptation of Schemes [Abstract] We present a computational approach to the acquisition of problem schemes by learning by doing and to their application in analogical problem solving. Our work has its background in automatic program construction and relies on the concept of recursive program schemes. In contrast to the usual approach to cognitive modelling where computational models are designed to fit specific data we propose a framework to describe certain empirically established characteristics of human problem solving and learning in a uniform and formally sound way. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #30973. 	[Title] In  Estimating analogical similarity by dot-products of Holographic Reduced Representations. [Abstract] Models of analog retrieval require a computationally cheap method of estimating similarity between a probe and the candidates in a large pool of memory items. The vector dot-product operation would be ideal for this purpose if it were possible to encode complex structures as vector representations in such a way that the superficial similarity of vector representations reflected underlying structural similarity. This paper describes how such an encoding is provided by Holographic Reduced Representations (HRRs), which are a method for encoding nested relational structures as fixed-width distributed representations. The conditions under which structural similarity is reflected in the dot-product rankings of Please summarise all the given information.

Paper #1119180 has the title `Concept Sharing: A Means to Improve Multi-Concept Learning  
` and the abstract `This paper describes several means for sharing between related concepts to improve learning in the same domain. The sharing comes in the form of substructures or possibly entire structures of previous concepts which may aid in learning other concepts. These substructures highlight useful information in the domain. Using two domains, we evaluate the effectiveness of concept sharing with respect to accuracy, concept size, search complexity, and noise resistance.
`.
Question: Which category should Paper #1119180 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].


Paper #1119180 has the title `Concept Sharing: A Means to Improve Multi-Concept Learning  
` and the abstract `This paper describes several means for sharing between related concepts to improve learning in the same domain. The sharing comes in the form of substructures or possibly entire structures of previous concepts which may aid in learning other concepts. These substructures highlight useful information in the domain. Using two domains, we evaluate the effectiveness of concept sharing with respect to accuracy, concept size, search complexity, and noise resistance.
`.
Question: Which category should Paper #1119180 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].

This paper should be classified into: Case_Based