Logical Classification of Partially Ordered Data

07/21/2019
by   Elena V. Djukova, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2022

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

The binary classification problem has a situation where only biased data...
research
11/26/2020

Totally and Partially Ordered Hierarchical Planners in PDDL4J Library

In this paper, we outline the implementation of the TFD (Totally Ordered...
research
10/03/2002

Revising Partially Ordered Beliefs

This paper deals with the revision of partially ordered beliefs. It prop...
research
05/25/2023

A Fast Algorithm for Consistency Checking Partially Ordered Time

Partially ordered models of time occur naturally in applications where a...
research
10/19/2012

A possibilistic handling of partially ordered information

In a standard possibilistic logic, prioritized information are encoded b...
research
12/22/2009

Learning to Predict Combinatorial Structures

The major challenge in designing a discriminative learning algorithm for...
research
10/25/2017

Supervised Classification: Quite a Brief Overview

The original problem of supervised classification considers the task of ...

Please sign up or login with your details

Forgot password? Click here to reset