Abstract. We propose an approach to build a classifier composing consistent (100% confident) rules. Recently, associative classifiers that utilize association rules have been widel...
In this paper we describe a method for performing word sense disambiguation (WSD). The method relies on unsupervised learning and exploits functional relations among words as prod...
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
This paper proposes a new novel method for the online construction of a Hierarchical Fuzzy Rule Based System (FRBS) to accurately model a function while retaining a level of human...