Logical Classification of Partially Ordered Data

by   Elena V. Djukova, et al.

Issues concerning intelligent data analysis occurring in machine learning are investigated. A scheme for synthesizing correct supervised classification procedures is proposed. These procedures are focused on specifying partial order relations on sets of feature values; they are based on a generalization of the classical concepts of logical classification. It is shown that learning the correct logical classifier requires an intractable discrete problem to be solved. This is the dualization problem over products of partially ordered sets. The matrix formulation of this problem is given. The effectiveness of the proposed approach to the supervised classification problem is illustrated on model and real-life data.


page 1

page 2

page 3

page 4


Classification from Positive and Biased Negative Data with Skewed Labeled Posterior Probability

The binary classification problem has a situation where only biased data...

Totally and Partially Ordered Hierarchical Planners in PDDL4J Library

In this paper, we outline the implementation of the TFD (Totally Ordered...

Revising Partially Ordered Beliefs

This paper deals with the revision of partially ordered beliefs. It prop...

A possibilistic handling of partially ordered information

In a standard possibilistic logic, prioritized information are encoded b...

Ordered Sets for Data Analysis

This book dwells on mathematical and algorithmic issues of data analysis...

A Visual Technique to Analyze Flow of Information in a Machine Learning System

Machine learning (ML) algorithms and machine learning based software sys...

Sheaf-Theoretic Stratification Learning

In this paper, we investigate a sheaf-theoretic interpretation of strati...