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(So,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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Popova, V., & Bioch, J. C. (2005). Monotone classification by function decomposition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3735 LNAI, pp. 203–214). https://doi.org/10.1007/11563983_18
Mendeley helps you to discover research relevant for your work.