Rough Sets Approximations to Possibilistic Information

@article{Nakata2006RoughSA,
  title={Rough Sets Approximations to Possibilistic Information},
  author={Michinori Nakata and Hiroshi Sakai},
  journal={2006 IEEE International Conference on Fuzzy Systems},
  year={2006},
  pages={2343-2350}
}
Rough sets are applied to data tables containing possibilistic information. A family of weighted equivalence classes is obtained, in which each equivalence class is accompanied by a possibilistic degree to which it is an actual one. By using the family of weighted equivalence classes we can derive a lower approximation and an upper approximation. The lower approximation and the upper approximation coincide with those obtained from methods of possible worlds. Therefore, the method of weighted… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

2000]Data Mining in Incomplete Information Systems from Rough Set Perspective

  • M. Kryszkiewicz, H. Rybiński
  • Rough Set Methods and Applications, Studies in…
  • 2000
3 Excerpts

Algorithm for Finding Equivalence Relations from Table Non-deterministic Information

  • H. Sakai
  • Lecture Notes in Artificial Intelligence
  • 1999
2 Excerpts

Similar Papers

Loading similar papers…