Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-18T06:39:15.508Z Has data issue: false hasContentIssue false
  • English
  • Français

Representation of algebraic domains by formal association rule systems†

Published online by Cambridge University Press:  15 May 2015

LANKUN GUO ,
QINGGUO LI ,
PETKO VALTCHEV  and
YAPING LIN
LANKUN GUO
Affiliation:
College of Mathematics and Computer Science, Hunan Normal University, Changsha, P.R. China Email: [email protected]
QINGGUO LI
Affiliation:
College of Mathematics and Econometrics, Hunan University, Changsha, P.R. China
PETKO VALTCHEV
Affiliation:
Département d'Informatique, Université du Québec à Montréal, Montréal, Canada
YAPING LIN
Affiliation:
College of Information Science and Engineering, Hunan University, Changsha, P.R. China
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we introduce the notion of consistent F-augmented contexts by adding a special family of finite subsets into the structure of a formal context, which essentially establishes the basis of the representation of general algebraic domains. In particular, we investigate the association rule systems which are derived from the consistent F-augmented contexts and propose the notion of formal association rule systems. By the notion of antecedent connections, we obtain the equivalence between the category of formal association rule systems and that of algebraic domains, which demonstrates that the proposed notion of formal association rule systems provides a concrete approach to representing algebraic domains.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 27 , Special Issue 4: Symposium on Domain Theory (ISDT 2013) , May 2017 , pp. 470 - 490
Copyright
Copyright © Cambridge University Press 2015 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

†

This manuscript is submitted to Mathematical Structures in Computer Science for possible publication in the special issue of ISDT 2013. It is an extension of our conference paper in ISDT 2013 and our earlier work (Guo et al. 2013).

References

Agrawal, R., Mannila, H., Srikant, R., Toivonen, H. and Verkamo, A. (1996). Fast discovery of association rules. In: Fayyad, U., Piatetsky-Shapiro, G. and Smyth, P. (eds.) Advances in Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, CA 307–328.Google Scholar
Chu, S. and Ellis, G. (1996). Investigating lattice techniques for organising document collections. In: The 4th International Conference on Conceptual Structures, vol. 96 ICCS.Google Scholar
Ganter, B. and Wille, R. (1999). Formal Concept Analysis: Mathematical Foundations, Springer, Berlin.Google Scholar
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M. and Scott, D.S. (2003). Continuous Lattices and Domains, Cambridge University Press.CrossRefGoogle Scholar
Guo, L., Li, Q., Valtchev, P. and Godin, R. (2013). Formal F-contexts and their induced association rule systems. Lecture Notes in Computer Science 7880 141–155.Google Scholar
Hitzler, P., Krötzsch, M. and Zhang, G.-Q. (2006). A categorical view on algebraic lattices in formal concept analysis. Fundamenta Informaticae 74 1–29.Google Scholar
Hoofman, R. (1993). Continuous Information systems. Information and Computation 105 42–71.Google Scholar
Huchard, M., Rouane, Hacene, M., Roume, C. and Valtchev, P. (2007). Relational concept discovery in structured datasets. Annals of Mathematics and Artificial Intelligence 49 (1–4) 39–76.Google Scholar
Larsen, K.G. and Winskel, G. (1984). Using information systems to solve domain equations effectively. In: Semantics of Data Types, Lecture Notes in Computer Science volume 173, 109–129, Springer-Verlag.Google Scholar
Mac Lane, S. (1971). Categories for the Working Mathematician, Springer-Verlag, New York.Google Scholar
Scott, D.S. (1982). Domains for denotational semantics. In: Automata, Languages and Programming 9th Colloquium. Lecture Notes in computer Science volume 140, 577–613, Springer-Verlag.Google Scholar
Spreen, D., Xu, L. and Mao, X. (2008). Information systems revisited: The general continuous case. Theoretical Computer Science 405 (1–2) 176–187.Google Scholar
Valtchev, P., Missaoui, R., Godin, R. and Meridji, M. (2002). Generating frequent itemsets incrementally: Two novel approaches based on Galois lattice theory. Journal of Experimental and Theoretical Artificial Intelligence 14 115–142.CrossRefGoogle Scholar
Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, Reidel, Dordrecht, Boston 445–470.Google Scholar
Zhang, G.-Q. (1992a). DI-domains as prime information systems. Information and Computation 100 151–177.Google Scholar
Zhang, G.-Q. (1992b). Disjunctive systems and L-Domains. In: Automata, Languages and Programming. Lecture Notes in Computer Science volume 623, 284–295.Google Scholar
Zhang, G.-Q. (1994). A representation of SFP. Information and Computation 110 233–263.Google Scholar
Zhang, G.-Q. and Shen, G. (2006). Approximable concepts, Chu spaces, and information systems. Theory and Applications of Categories 17 (5) 80–102.Google Scholar