Abstract
Classification is one of major tasks in case-based reasoning(CBR) and many studies have been done for analyzing properties of case-based classification [1,14,10,15,12,9,13,7]. However, these studies only consider numerical similarity measures whereas there are other kinds of similarity measure for diffierent tasks. Among these measures, HYPO system [2,3] in a legal domain uses a similarity measure based on set inclusion of diffierences of attributes in cases.
In this paper,we give an analysis of representability of boolean functions in case-based classification using the above set inclusion based similarity. We show that such case-based classification has a strong connection between monotone theory studied in [4,11]. Monotone theory is originated from computational learning theory and is used to show learnability of boolean function with polynomial DNF size and polynomial CNF size [4] and is used for deductive reasoning as well [11]. In this paper, we analyze a case-based representability of boolean functions by using the above relationship between the case-based classification by set inclusion based similarity and the monotone theory.We show that any boolean function is representable by a casebase whose size is bounded in polynomial of its DNF size and its CNF size and thus, k-term DNF, k-clause CNF can be efficiently representable in a casebase using set inclusion similarity.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aha, D. W., Kibler, D., and Albert, M. K.: Instance-Based Learning Algorithms. Machine Learning 2 (1991) 37–66
Ashley, K. D.: Modeling Legal Argument: Reasoning with Cases and Hypotheticals MIT press (1990)
Ashley, K. D., and Aleven, V.: A Logical Representation for Relevance Criteria. S. Wess, K-D. Althoff and M. Richter (eds.) Topics in Case-Based Reasoning, LNAI 837 (1994) 338–352
Bshouty, N. H.: Exact Learning Boolean Functions via the Monotone Theory. Information and Computation 123 (1995) 146–153
Cover, T., and Hart, P.: NN pattern classification. IEEE Trans. on Information Theory 13 (1967) 21–27
Creecy, R. H., Masand, B. M., Smith, S. J. and Waltz, D. L.: Trading MIPS and Memory for Knowledge Engineering. Communications of the ACM 35 No. 8 (1992) 48–64
Globig, C., and Lange, S.: Case-Based Representability of Classes of Boolean Functions. Proceedings of ECAI’96 (1996) 117–121
Goodman, M.: Prism:A Case-Based Telex Classifier. A. Rappaport and R. Smith (eds.) Innovative Applications of Artificial Intelligence 2 (1990) 86–90
Griffiths, A. D., and Bridge, D. G.: On Concept Space and Hypothesis Space in Case-Based Learning. Proceedings of ECML-95, LNAI 912 (1995) 161–173
Jantke, K. P. and S. Lange.: Case-based Representation and Learning of Pattern Languages. Theoretical Computer Science 137 (1995) 25–51
Khardon, R., and Roth, D.: Reasoning with Models. Artificial Intelligence 87 (1996) 187–213
Okamoto, S., and Satoh, K.: An Average Predictive Accuracy of the Nearest Neighbor Classifier. J-P. Haton, M. Keane, and M. Manago (eds.) Advances in Case-Based Reasoning, LNAI 984 (1995) 101–112
Okamoto, S., and Satoh, K.: An Average Analysis of k Nearest Neighbor Classifier. M. Veloso and A. Aamodt (eds.) Case-Based Reasoning Research and Development, LNAI 1010 (1995) 253–264
Rachlin, J., Kasif, S., Salzberg, S., and Aha, D. W.: Towards a Better Understanding of Memory-based Reasoning Systems. Machine Learning: Proceedings of the Eleventh International Conference (1994) 242–250.
Salzberg, S., Delcher, A. L., Heath, D., and Kasif, S.: Best-Case Results for Nearest-Neighbor Learning. IEEE Trans. on Pattern Analysis and Machine Intelligence 17 (1995) 599–608
Satoh, K.: Translating Case-Based Reasoning into Abductive Logic Programming. Proceedings of ECAI’96 (1996) 142–146
Stanfill, C., and Waltz, D.: Toward Memory-based Reasoning. Communications of the ACM 29 No. 12 (1986) 1213–1228
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satoh, K. (1998). Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science(), vol 1501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49730-7_14
Download citation
DOI: https://doi.org/10.1007/3-540-49730-7_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65013-3
Online ISBN: 978-3-540-49730-1
eBook Packages: Springer Book Archive