Learning with feature partitions
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/17508
Güvenir, Halil Altay
This thesis presents a new methodology of learning from examples, based on feature partitioning. Classification by Feature Partitioning (CFP) is a particular implementation of this technique, which is an inductive, incremental, and supervised learning method. Learning in CFP is accomplished by storing the objects separately in each feature dimension as disjoint partitions of values. A partition, a basic unit of representation which is initially a point in the feature dimension, is expanded through generalization. The CFP algorithm specializes a partition by subdividing it into two subpartitions. Theoretical (with respect to PAC-model) and empirical evaluation of the CFP is presented and compared with some other similar techniques.
Showing items related by title, author, creator and subject.
Modeling interestingness of streaming association rules as a benefit-maximizing classification problem Aydin, T.; Güvenir H.A. (2009)In a typical application of association rule learning from market basket data, a set of transactions for a fixed period of time is used as input to rule learning algorithms. For example, the well-known Apriori algorithm ...
Tatar, S.; Cicekli I. (2009)Protein name extraction, one of the basic tasks in automatic extraction of information from biological texts, remains challenging. In this paper, we explore the use of two different machine learning techniques and present ...
Allen J.W.P. (IOS Press, 2014)While there is general consensus that robust forms of social learning enable the possibility of human cultural evolution, the specific nature, origins, and development of such learning mechanisms remains an open issue. The ...