Advertisement

Searching for Reductive Attributes in Decision Tables

  • Long Giang Nguyen
  • Hung Son Nguyen
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8988)

Abstract

Most decision support systems based on rough set theory are related to the minimal reduct calculation problem, which is NP-hard. This paper investigates the problem of searching for the set of useful attributes that occur in at least one reduct. By complement, this problem is equivalent to searching for the set of redundant attributes, i.e. the attributes that do not occur in any reducts of the given decision table. We show that the considered problem is equivalent to a Sperner system for relational data base system and prove that it can be solved in polynomial time. On the base of these theoretical results, we also propose two different algorithms for elimination of redundant attributes in decision tables.

Keywords

Rough sets Reducts Relational database Minimal keys Sperner system 

References

  1. 1.
    Pawlak, Z.: Rough Sets-Theoretical Aspect of Reasoning About Data. Kluwer Academic Publishers, Norwell (1991)Google Scholar
  2. 2.
    Demetrovics, J., Thi, V.D.: Keys, antikeys and prime attributes. Ann. Univ. Sci. Bp. Sect. Comp. 8, 35–52 (1987)MathSciNetGoogle Scholar
  3. 3.
    Demetrovics, J., Thi, V.D.: Describing candidate keys by hypergraphs. Comput. Artif. Intell. 18(2), 191–207 (1999)MathSciNetGoogle Scholar
  4. 4.
    Nguyen, L.G., Nguyen, H.S.: On elimination of redundant attributes in decision tables. In: 2012 Federated Conference on Computer Science and Information Systems (FedCSIS). IEEE, pp. 317–322 (2012)Google Scholar
  5. 5.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Nguyen, H.S.: Approximate boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 334–506. Springer, Heidelberg (2006) CrossRefGoogle Scholar
  7. 7.
    Pawlak, Z.: Rough sets and intelligent data analysis. Inf. Sci. 147(1), 1–12 (2002)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Słoński, R. (ed.) Intelligent Decision Support, vol. 11, pp. 331–362. Springer, Heidelberg (1992)CrossRefGoogle Scholar
  9. 9.
    Wei, L., Li, H.R., Zhang, W.X.: Knowledge reduction based on the equivalence relations defined on attribute set and its power set. Inf. Sci. 177(15), 3178–3185 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Yao, Y.: Duality in rough set theory based on the square of opposition. Fundam. Inf. 127(1–4), 49–64 (2013)Google Scholar
  11. 11.
    Moshkov, M.J., Skowron, A., Suraj, Z.: On covering attribute sets by reducts. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 175–180. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  12. 12.
    Thi, V.D., Son, N.H.: On armstrong relations for strong dependencies. Acta Cybernetica 17(3), 521–531 (2006)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Institute of Information TechnologyVietnamese Academy of Science and TechnologyCau Giay DistrictVietnam
  2. 2.Institute of MathematicsThe University of WarsawWarsawPoland

Personalised recommendations