z-logo
open-access-imgOpen Access
Complexity of Rule Sets Mined from Incomplete Data Using Probabilistic Approximations Based on Generalized Maximal Consistent Blocks
Author(s) -
Patrick G. Clark,
Jerzy W. GrzymalaBusse,
Zdzisław S. Hippe,
Teresa Mroczek,
Rafał Niemiec
Publication year - 2020
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2020.09.219
Subject(s) - probabilistic logic , pairwise comparison , computer science , missing data , set (abstract data type) , data mining , approximations of π , value (mathematics) , data set , algorithm , mathematics , artificial intelligence , machine learning , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom