Skip to main content Accessibility help
×
Home
Hostname: page-component-55597f9d44-2qt69 Total loading time: 0.502 Render date: 2022-08-13T00:14:33.161Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Representation of algebraic domains by formal association rule systems

Published online by Cambridge University Press:  15 May 2015

LANKUN GUO
Affiliation:
College of Mathematics and Computer Science, Hunan Normal University, Changsha, P.R. China Email: lankun.guo@gmail.com
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

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
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 307328.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.CrossRefGoogle 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 141155.CrossRefGoogle Scholar
Hitzler, P., Krötzsch, M. and Zhang, G.-Q. (2006). A categorical view on algebraic lattices in formal concept analysis. Fundamenta Informaticae 74 129.Google Scholar
Hoofman, R. (1993). Continuous Information systems. Information and Computation 105 4271.CrossRefGoogle 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) 3976.CrossRefGoogle 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, 109129, Springer-Verlag.CrossRefGoogle Scholar
Mac Lane, S. (1971). Categories for the Working Mathematician, Springer-Verlag, New York.CrossRefGoogle Scholar
Scott, D.S. (1982). Domains for denotational semantics. In: Automata, Languages and Programming 9th Colloquium. Lecture Notes in computer Science volume 140, 577613, Springer-Verlag.CrossRefGoogle Scholar
Spreen, D., Xu, L. and Mao, X. (2008). Information systems revisited: The general continuous case. Theoretical Computer Science 405 (1–2) 176187.CrossRefGoogle 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 115142.CrossRefGoogle Scholar
Wille, R. (1982). Restructuring lattice theory: An approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, Reidel, Dordrecht, Boston 445470.CrossRefGoogle Scholar
Zhang, G.-Q. (1992a). DI-domains as prime information systems. Information and Computation 100 151177.CrossRefGoogle Scholar
Zhang, G.-Q. (1992b). Disjunctive systems and L-Domains. In: Automata, Languages and Programming. Lecture Notes in Computer Science volume 623, 284295.CrossRefGoogle Scholar
Zhang, G.-Q. (1994). A representation of SFP. Information and Computation 110 233263.CrossRefGoogle Scholar
Zhang, G.-Q. and Shen, G. (2006). Approximable concepts, Chu spaces, and information systems. Theory and Applications of Categories 17 (5) 80102.Google Scholar
1
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Representation of algebraic domains by formal association rule systems
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Representation of algebraic domains by formal association rule systems
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Representation of algebraic domains by formal association rule systems
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *