2014 | OriginalPaper | Chapter
Random Probes in Computation and Assessment of Approximate Reducts
Authors : Andrzej Janusz, Dominik Ślęzak
Published in: Rough Sets and Intelligent Systems Paradigms
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We discuss applications of random probes in a process of computation and assessment of approximate reducts. By random probes we mean artificial attributes, generated independently from a decision vector but having similar value distributions to the attributes in the original data. We introduce a concept of a randomized reduct which is a reduct constructed solely from random probes and we show how to use it for unsupervised evaluation of attribute sets. We also propose a modification of the greedy heuristic for a computation of approximate reducts, which reduces a chance of including irrelevant attributes into a reduct. To support our claims we present results of experiments on high dimensional data. Analysis of obtained results confirms usefulness of random probes in a search for informative attribute sets.