A new efficient normal parameter reduction algorithm of soft sets

Kong et al. [Kong, Z., Gao, L., Wang, L., and Li, S., The normal parameter reduction of soft sets and its algorithm, Computers and Mathematics with Applications 56 (12) (2008) 3029–3037] introduced the definition of normal parameter reduction in soft sets and presented a heuristic algorithm of norma...

Full description

Saved in:
Bibliographic Details
Published in:Computers & mathematics with applications (1987) 2011-07, Vol.62 (2), p.588-598
Main Authors: Ma, Xiuqin, Sulaiman, Norrozila, Qin, Hongwu, Herawan, Tutut, Zain, Jasni Mohamad
Format: Article
Language:English
Subjects:
Algorithms
Computation
Heuristic methods
Mathematical analysis
Mathematical models
Normal parameter reduction
Oriented-parameter sum
Partitions
Reduction
Soft sets
Theorems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Kong et al. [Kong, Z., Gao, L., Wang, L., and Li, S., The normal parameter reduction of soft sets and its algorithm, Computers and Mathematics with Applications 56 (12) (2008) 3029–3037] introduced the definition of normal parameter reduction in soft sets and presented a heuristic algorithm of normal parameter reduction. However, the algorithm is hard to understand and involves a great amount of computation. In this paper, firstly, we give some new related definitions and proved theorems of normal parameter reduction. Then we propose a new efficient normal parameter reduction algorithm of soft sets based on the oriented-parameter sum, which can be carried out without parameter important degree and decision partition. The comparison result on a dataset shows that the proposed algorithm involves relatively less computation and is easier to implement and understand as compared with the algorithm of normal parameter reduction proposed by Kong et al.
ISSN:0898-1221
1873-7668
DOI:10.1016/j.camwa.2011.05.038