skip to main content
10.1145/2245276.2245441acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Attribute implications in similarity-based databases: semantic entailment and nonredundant bases

Published:26 March 2012Publication History

ABSTRACT

We introduce a new type of dependencies for data over domains that are additionally equipped with similarity relations. The dependencies are expressed by if-then rules involving similarities of attribute values. Unlike strict equalities, similarities of attribute values make it possible to provide robust rules and concise descriptions of dependencies regarding attribute values, which are close to how a human expert perceives the data. In the paper, we define the rules, their semantics, entailment, and present an algorithm for computing nonredundant sets of rules, i.e., nonredundant sets of rules describing all if-then dependencies in given data. The algorithm represents basic method for extracting if-then rules from data in similarity-based databases. Due to the limited scope of the paper, all proofs are only skethced or omitted.

References

  1. R. Belohlavek. Fuzzy Relational Systems: Foundations and Principles. Kluwer, Academic/Plenum Publishers, New York (2002) Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. R. Belohlavek, T. Funiokova, and V. Vychodil. Fuzzy closure operators with truth stressers. Logic Journal of IGPL 13(5): 503--513 (2005)Google ScholarGoogle ScholarCross RefCross Ref
  3. R. Belohlavek and V. Vychodil. Data tables with similarity relations: functional dependencies, complete rules and non-redundant bases. In: DASFAA 2006, LNCS vol. 3882, pp. 644--658, Springer (2006) Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Belohlavek and V. Vychodil. What is a fuzzy concept lattice? In: CLA 2005, CEUR WS, Vol. 162, pp. 34--45 (2005).Google ScholarGoogle Scholar
  5. R. Belohlavek and V. Vychodil. Fuzzy attribute logic over complete residuated lattices, J. Exp. Theor. Artif. Intelligence, 18: 471--480 (2006).Google ScholarGoogle ScholarCross RefCross Ref
  6. R. Belohlavek and V. Vychodil. Query systems in similarity-based databases: logical foundations, expressive power, and completeness. In: ACM SAC 2010, pp. 1648--1655 (2010) Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Belohlavek and V. Vychodil. Codd's relational model from the point of view of fuzzy logic. J. Logic and Computation, 21(5): 851--862 (2011). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. G. Birkhoff. Lattice theory. American Mathematical Society, Providence (1940)Google ScholarGoogle Scholar
  9. E. F. Codd. A relational model of data for large shared data banks. Communications of the ACM 13(6), 377--387 (1970) Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. J. Date. Database in Depth: Relational Theory for Practitioners. O'Reilly Media; 1 edition (2005) Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. J. Date and H. Darwen. Databases, Types and the Relational Model. Addison Wesley; 3rd edition (2006) Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. V. Delis, C. Makris, S. Sioutas. A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval. ACM-GIS 40--46 (1999) Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. Fagin. Combining fuzzy information: an overview. ACM SIGMOD Record 31(2), 109--118 (2002) Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. B. Ganter. Two basic algorithms in concept analysis. In: ICFCA 2010, LNCS vol. 5986, pp. 312--340 (reprint of Technical Report FB4-Preprint No. 831, TH Darmstadt, 1984), Springer (2010) Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. A. Goguen. The logic of inexact concepts. Synthese 18, 325--373 (1968--9)Google ScholarGoogle Scholar
  16. S. Gottwald. Mathematical fuzzy logics. Bull. Symbolic Logic 14(2), 210--239 (2008)Google ScholarGoogle ScholarCross RefCross Ref
  17. J.-L. Guigues and V. Duquenne. Familles minimales d'implications informatives resultant d'un tableau de données binaires. Math. Sci. Humaines 95, 5--18 (1986)Google ScholarGoogle Scholar
  18. P. Hájek. Metamathematics of Fuzzy Logic. Kluwer, Dordrecht (1998)Google ScholarGoogle Scholar
  19. P. Hájek. On very true. Fuzzy Sets and Syst. 124, 329--333 (2001)Google ScholarGoogle ScholarCross RefCross Ref
  20. F. Klawonn and J. L. Castro. Similarity in fuzzy reasoning. Mathware & Soft Computing 2, 197--228 (1995)Google ScholarGoogle Scholar
  21. D. Maier. The Theory of Relational Databases. Comp. Sci. Press, Rockville (1983) Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. K. V. S. V. N. Raju and A. K. Majumdar. Fuzzy functional dependencies and lossless join decomposition of fuzzy relational database systems. ACM Trans. Database Systems 13(2), 129--166 (1988) Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. G. Takeuti and S. Titani. Globalization of intuitionistic set theory. Annals of Pure and Applied Logic 33, 195--211 (1987)Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Attribute implications in similarity-based databases: semantic entailment and nonredundant bases

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
              March 2012
              2179 pages
              ISBN:9781450308571
              DOI:10.1145/2245276
              • Conference Chairs:
              • Sascha Ossowski,
              • Paola Lecca

              Copyright © 2012 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 26 March 2012

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article

              Acceptance Rates

              SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%
            • Article Metrics

              • Downloads (Last 12 months)1
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader