Paper Info
Title
Parallel Computation of Reducts
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.
Year
DOI
Venue
1998
10.1007/3-540-69115-4_62
Rough Sets and Current Trends in Computing
Keywords
Field
DocType
parallel algorithm,parallel process,rough set theory,effective method,discernibility matrix,reduct generation algorithm,considerable speed,parallel computation,reduct generation,computational experiment,key issue,generic algorithm,parallel processing,computer experiment,parallel computer
Reduct,Parallel algorithm,Effective method,Computer science,Matrix (mathematics),Algorithm,Theoretical computer science,Rough set,Adaptive algorithm,Speedup,Computation
Conference
ISBN
Citations 
PageRank 
3-540-64655-8
13
1.41
References 
Authors
5
1
Name
Order
Citations
PageRank
Robert Susmaga137033.32