Some Efficient Algorithms on the Parameter Reduction of Soft Sets for Decision making Problems

Abstract

Listen

Translate article

In the present paper, we propose the efficient algorithm for the parameter reduction of soft sets and we implement it in diagnosing the risk of heart disease problem. Moreover, the efficiency of the algorithm is investigated. The time complexity of the $${\textit{Map}}_-{\textit{Matix}}$$ is given by total number of comparisons made to construct $${\textit{map}}_-{\textit{matrix}}$$ . For n number of objects and f number of attributes, the total number of comparisons is $$n \times f$$ . Therefore, the time complexity is given O(nf). The algorithm $${\textit{Generate}}_-{\textit{Powerset}}$$ takes the total of features f as input and its time complexity is given by $$O(2^f)$$ . Moreover, the overall efficiency is given by $$O(2^f)$$ .