Monotone classification by function decomposition

Authors:
Viara Popova;Jan C. Bioch
Affiliations:
Department of Artificial Intelligence, Vrije Universiteit, Amsterdam, The Netherlands;Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands
Venue:
DS'05 Proceedings of the 8th international conference on Discovery Science
Year:
2005

Citing 5
Cited 0

Structured induction in expert systems

Structured induction in expert systems
Decomposability of partially defined Boolean functions

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Learning by discovering concept hierarchies

Artificial Intelligence
Decision trees for ordinal classification

Intelligent Data Analysis
Some studies in machine learning using the game of checkers

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper focuses on the problem of classification by function decomposition within the frame of monotone classification. We propose a decomposition method for discrete functions which can be applied to monotone problems in order to generate a monotone classifier based on the extracted concept hierarchy. We formulate and prove a criterion for the existence of a positive extension of the scheme f=g(S0,h(S1)) in the context of discrete functions. We also propose a method for finding an assignment for the intermediate concept with a minimal number of values.