Above are papers related to the following paper: [Paper_ID] Paper #20833. 	[Title] Using Partitioning to Speed Up Specific-to-General Rule Induction [Abstract] RISE (Domingos 1995; in press) is a rule induction algorithm that proceeds by gradually generalizing rules, starting with one rule per example. This has several advantages compared to the more common strategy of gradually specializing initially null rules, and has been shown to lead to significant accuracy gains over algorithms like C4.5RULES and CN2 in a large number of application domains. However, RISE's running time (like that of other rule induction algorithms) is quadratic in the number of examples, making it unsuitable for processing very large databases. This paper studies the use of partitioning to speed up RISE, and compares it with the well-known method of windowing. The use of partitioning in a specific-to-general induction setting creates synergies that would not be possible with a general-to-specific system. Partitioning often reduces running time and improves accuracy at the same time. In noisy conditions, the performance of windowing deteriorates rapidly, while that of partitioning remains stable. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1121057. 	[Title] Inductive CBR for Customer Support [Abstract] Over the past few years, the telecommunications paradigm has been shifting rapidly from hardware to middleware. In particular, the traditional issues of service characteristics and network control are being replaced by the modern, customer-driven issues of network and service management (e.g., electronic commerce, one-stop shops). An area of service management which has extremely high visibility and negative impact when managed badly is that of problem handling. Problem handling is a very knowledge intensive activity, particularly nowadays with the increase in number and complexity of services becoming available. Trials at several BT support centres have already demonstrated the potential of case-based reasoning technology in improving current practice for problem detection and diagnosis. A major cost involved in implementing a case-based system is in the manual building of the initial case base and then in the subsequent maintenance of that case base over time. This paper shows how inductive machine learning can be combined with case-based reasoning to produce an intelligent system capable of both extracting knowledge from raw data automatically and reasoning from that knowledge. In addition to discovering knowledge in existing data repositories, the integrated system may be used to acquire and revise knowledge continually. Experiments with the suggested integrated approach demonstrate promise and justify the next step. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #11335. 	[Title] Concept Learning and the Problem of Small [Abstract]  Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1127657. 	[Title] Pessimistic and Optimistic Induction [Abstract] Learning methods vary in the optimism or pessimism with which they regard the informativeness of learned knowledge. Pessimism is implicit in hypothesis testing, where we wish to draw cautious conclusions from experimental evidence. However, this paper demonstrates that optimism in the utility of derived rules may be the preferred bias for learning systems themselves. We examine the continuum between naive pessimism and naive optimism in the context of a decision tree learner that prunes rules based on stringent (i.e., pessimistic) or weak (i.e., optimistic) tests of their significance. Our experimental results indicate that in most cases optimism is preferred, but particularly in cases of sparse training data and high noise. This work generalizes earlier findings by Fisher and Schlimmer (1988) and Schaffer (1992), and we discuss its relevance to unsupervised learning, small disjuncts, and other issues. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #6318. 	[Title] Rule Induction and Instance-Based Learning: A Unified Approach [Abstract] This paper presents a new approach to inductive learning that combines aspects of instance-based learning and rule induction in a single simple algorithm. The RISE system searches for rules in a specific-to-general fashion, starting with one rule per training example, and avoids some of the difficulties of separate-and-conquer approaches by evaluating each proposed induction step globally, i.e., through an efficient procedure that is equivalent to checking the accuracy of the rule set as a whole on every training example. Classification is performed using a best-match strategy, and reduces to nearest-neighbor if all generalizations of instances were rejected. An extensive empirical study shows that RISE consistently achieves higher accuracies than state-of-the-art representatives of its "parent" paradigms (PEBLS and CN2), and also outperforms a decision-tree learner (C4.5) in 13 out of 15 test domains (in Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #545647. 	[Title] Learning with Rare Cases and Small Disjuncts [Abstract] Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with small disjuncts is that they are more error prone than large disjuncts. This paper investigates the reasons why small disjuncts are more error prone than large disjuncts. It shows that when there are rare cases within a domain, then factors such as attribute noise, missing attributes, class noise and training set size can result in small disjuncts being more error prone than large disjuncts and in rare cases being more error prone than common cases. This paper also assesses the impact that these error prone small disjuncts and rare cases have on inductive learning (i.e., on error rate). One key conclusion is that when low levels of attribute noise are applied only to the training set (the ability to learn the correct concept is being evaluated), rare cases within a domain are primarily responsible for making learning difficult. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1153264. 	[Title]  [Abstract] Design and Evaluation of the RISE 1.0 Learning System Pedro Domingos pedrod@ics.uci.edu Technical Report 94-34 August 30, 1994 Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1108656. 	[Title] Rule Generation and Compaction in the wwtp [Abstract] In this paper we discuss our approach to learning classification rules from data. We sketch out two modules of our architecture, namely LINNEO + and GAR. LINNEO + , which is a knowledge acquisition tool for ill-structured domains automatically generating classes from examples that incrementally works with an unsupervised strategy. LINNEO + 's output, a representation of the conceptual structure of the domain in terms of classes, is the input to GAR that is used to generate a set of classification rules for the original training set. GAR can generate both conjunctive and disjunctive rules. Herein we present an application of these techniques to data obtained from a real wastewater treatment plant in order to help the construction of a rule base. This rule will be used for a knowledge-based system that aims to supervise the whole process. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #582511. 	[Title] The Problem with Noise and Small Disjuncts [Abstract] Systems that learn from examples often create a disjunctive concept definition. The disjuncts in the concept definition which cover only a few training examples are referred to as small disjuncts. The problem with small disjuncts is that they are more error prone than large disjuncts, but may be necessary to achieve a high level of predictive accuracy [Holte, Acker, and Porter, 1989]. This paper extends previous work done on the problem of small disjuncts by taking noise into account. It investigates the assertion that it is hard to learn from noisy data because it is difficult to distinguish between noise and true exceptions. In the process of evaluating this assertion, insights are gained into the mechanisms by which noise affects learning. Two domains are investigated. The experimental results in this paper suggest that for both Shapiro's chess endgame domain [Shapiro, 1987] and for the Wisconsin breast cancer domain [Wolberg, 1990], the assertion is true, at least for low levels (5-10%) of class noise. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #217139. 	[Title] Unifying Empirical and Explanation-Based Learning by Modeling the Utility of Learned Knowledge [Abstract] The overfit problem in empirical learning and the utility problem in explanation-based learning describe a similar phenomenon: the degradation of performance due to an increase in the amount of learned knowledge. Plotting the performance of learned knowledge during the course of learning (the performance response) reveals a common trend for several learning methods. Modeling this trend allows a control system to constrain the amount of learned knowledge to achieve peak performance and avoid the general utility problem. Experiments evaluate a particular empirical model of the trend, and analysis of the learners derive several formal models. If, as evidence suggests, the general utility problem can be modeled using the same mechanisms for different learning paradigms, then the model serves to unify the paradigms into one framework capable of comparing and selecting different learning methods based on predicted achievable performance. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #49843. 	[Title] Fossil: A Robust Relational Learner [Abstract] The research reported in this paper describes Fossil, an ILP system that uses a search heuristic based on statistical correlation. This algorithm implements a new method for learning useful concepts in the presence of noise. In contrast to Foil's stopping criterion, which allows theories to grow in complexity as the size of the training sets increases, we propose a new stopping criterion that is independent of the number of training examples. Instead, Fossil's stopping criterion depends on a search heuristic that estimates the utility of literals on a uniform scale. In addition we outline how this feature can be used for top-down pruning and present some preliminary results. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #11325. 	[Title] On Learning Multiple Descriptions of a Concept [Abstract] In sparse data environments, greater classification accuracy can be achieved by learning several concept descriptions of the data and combining their classifications. Stochastic search is a general tool which can be used to generate many good concept descriptions (rule sets) for each class in the data. Bayesian probability theory offers an optimal strategy for combining classifications of the individual concept descriptions, and here we use an approximation of that theory. This strategy is most useful when additional data is difficult to obtain and every increase in classification accuracy is important. The primary result of this paper is that multiple concept descriptions are particularly helpful in "flat" hypothesis spaces in which there are many equally good ways to grow a rule, each having similar gain. Another result is experimental evidence that learning multiple rule sets yields more accurate classifications than learning multiple rules for some domains. To demonstrate these behaviors, we learn multiple concept descriptions by adapting HYDRA, a noise-tolerant relational learning algorithm. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #35070. 	[Title] The RISE System: Conquering Without Separating [Abstract] Current rule induction systems (e.g. CN2) typically rely on a "separate and conquer" strategy, learning each rule only from still-uncovered examples. This results in a dwindling number of examples being available for learning successive rules, adversely affecting the system's accuracy. An alternative is to learn all rules simultaneously, using the entire training set for each. This approach is implemented in the Rise 1.0 system. Empirical comparison of Rise with CN2 suggests that "conquering without separating" performs similarly to its counterpart in simple domains, but achieves increasingly substantial gains in accuracy as the domain difficulty grows. Please summarise all the given information.

Above are papers related to the following paper: [Paper_ID] Paper #1119295. 	[Title] Distance Induction in First Order Logic used for classification via a k-nearest-neighbor process. Experiments on [Abstract] This paper tackles the supervised induction of a distance from examples described as Horn clauses or constrained clauses. In opposition to syntax-driven approaches, this approach is discrimination-driven: it proceeds by defining a small set of complex discriminant hypotheses. These hypotheses serve as new concepts, used to redescribe the initial examples. Further, this redescription can be embedded into the space of natural integers, and a distance between examples thus naturally follows. Please summarise all the given information.

Paper #20833 has the title `Using Partitioning to Speed Up Specific-to-General Rule Induction  
` and the abstract `RISE (Domingos 1995; in press) is a rule induction algorithm that proceeds by gradually generalizing rules, starting with one rule per example. This has several advantages compared to the more common strategy of gradually specializing initially null rules, and has been shown to lead to significant accuracy gains over algorithms like C4.5RULES and CN2 in a large number of application domains. However, RISE's running time (like that of other rule induction algorithms) is quadratic in the number of examples, making it unsuitable for processing very large databases. This paper studies the use of partitioning to speed up RISE, and compares it with the well-known method of windowing. The use of partitioning in a specific-to-general induction setting creates synergies that would not be possible with a general-to-specific system. Partitioning often reduces running time and improves accuracy at the same time. In noisy conditions, the performance of windowing deteriorates rapidly, while that of partitioning remains stable. 
`.
Question: Which category should Paper #20833 be classified as ?
You can select one from ['Neural_Networks', 'Case_Based', 'Theory', 'Reinforcement_Learning', 'Probabilistic_Methods', 'Rule_Learning', 'Genetic_Algorithms'].


Paper #20833 has the title `Using Partitioning to Speed Up Specific-to-General Rule Induction  
` and the abstract `RISE (Domingos 1995; in press) is a rule induction algorithm that proceeds by gradually generalizing rules, starting with one rule per example. This has several advantages compared to the more common strategy of gradually specializing initially null rules, and has been shown to lead to significant accuracy gains over algorithms like C4.5RULES and CN2 in a large number of application domains. However, RISE's running time (like that of other rule induction algorithms) is quadratic in the number of examples, making it unsuitable for processing very large databases. This paper studies the use of partitioning to speed up RISE, and compares it with the well-known method of windowing. The use of partitioning in a specific-to-general induction setting creates synergies that would not be possible with a general-to-specific system. Partitioning often reduces running time and improves accuracy at the same time. In noisy conditions, the performance of windowing deteriorates rapidly, while that of partitioning remains stable. 
`.
Question: Which category should Paper #20833 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