Parameterization value reduction of soft sets and its algorithm

Molodtsov initiated soft set theory as a new general mathematical tool for dealing with uncertainties. There has been some progress concerning reduction of soft set. However, up to the present, all methods about reduction of soft sets only considered the parameter reduction, the parameter value reduction is not referred. In this paper, we propose the definition of parameterization value reduction of soft set theory, which holds the least parameter values and makes the optimal choice objects not change. In addition, a heuristic algorithm of parameterization value reduction of soft sets is presented. Finally, an illustrative example is employed to show our contribution.