Parallel Computation of Reducts

Authors:
Robert Susmaga
Affiliations:
-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 2
Cited 7

An introduction to parallel algorithms

An introduction to parallel algorithms
Computation of reducts of composed information systems

Fundamenta Informaticae - Special issue: rough sets

Rough Knowledge Discovery and Applications

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A New Approach to Distributed Algorithms for Reduct Calculation

Transactions on Rough Sets IX
Text-independent speaker verification using ant colony optimization-based selected features

Expert Systems with Applications: An International Journal
On the relation between jumping emerging patterns and rough set theory with application to data classification

Transactions on rough sets XII
Reducts and Constructs in Attribute Reduction

Fundamenta Informaticae - International Conference on Soft Computing and Distributed Processing (SCDP'2002)
Rough Sets and Association Rule Generation

Fundamenta Informaticae
A comparison of parallel large-scale knowledge acquisition using rough set theory on different MapReduce runtime systems

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper addresses the problem of reduct generation, one of the key issues in the rough set theory. A considerable speed up of computations may be achieved by decomposing the original task into subtasks and executing these as parallel processes. This paper presents an effective method of such a decomposition. The presented algorithm is an adaptation of the reduct generation algorithm based on the notion of discernibility matrix. The practical behaviour of the parallel algorithm is illustrated with a computational experiment conducted for a real-life data set.