Formal concept ring, an algebraic machine to equip the formal concept analysis with more constructive operations

Articles in Press

Document Type : Research Paper

Authors

1 Department of Mathematics, Faculty of Science, Yasuj University, Yasuj, Iran.

2 Department of Mathematics, Faculty of Mathematics and Computer Sciences, Shahid Chamran University of Ahvaz, Ahvaz, Iran.

Abstract

Formal Concept Analysis $(FCA)$ as a well-known method in data analysis, has been widely noticed by researchers in pure and applied fields. Despite the increasing development in the application area, more work needs to be done in the pure area. Designing a theoretical system based on an algebraic-analytical structure is a significant help in enhancing its power to meet the needs of researchers. Therefore, in this article, by designing a system equipped with addition and multiplication, the development of Galois lattices will be discussed as the main goal. In the shadow of such extension, we will be able to achieve a special category of partially ordered rings, by defining partial and complete approximations. Hence, some fundamental results in $FCA$ will be developed as induced properties from ring theory intuition. \textbf{ Two significant results of this research will devote to provide the possibility of combining concepts with each other, as well as breaking the space into much distinguished components. As a result, this yields a new window in the subject of digital communication, which provides the possibility of joining concepts. The long-term prospective of this study is to assign a new observation in Big Data Analysis, based on $FCA$.}

Keywords

References

[1] M. Barbut and B. Monjardet, Ordre et Classification, algèbre et combinatoire, Zbl 0267.6001, 1970.
[2] G. Birkhoff, Lattice Theory, Vol. 25, American Mathematical Soc., 1940.
[3] A. Arnauld and P. Nicole, Logic or the Art of Thinking, Cambridge University Press, 1996.
[4] B. A. Davey and P. A. Hilary, Introduction to Lattices and Order, Cambridge University Press, 2002.
[5] B. Dushnik and M. W. Edwin, Partially ordered sets, Am. J. Math., 63 No. 3 (1941) 600-610.
[6] M. Erné, Adjunctions and Galois connections: Origins, history and development, In: Galois connections and applications (pp. 1-138). Dordrecht, Springer Netherlands.
[7] B. Ganter, K. Attila and R. Sándor, Extent partitions and context extensions, Math. Slovaca., 63 No. 4 (2013) 693-706.
[8] B. Ganter, S. Gerd and W. Rudolf, Formal Concept Analysis: Foundations and Applications, Vol. 3626, Springer, 2005.
[9] Y. Y. Kitamura and Y. Tanaka, Partially ordered rings, Tsukuba J. Math., 38 No. 1 (2014) 39-58.
[10] L. Lambrechts, Formal Concept Analysis, Vrije Universtiteit, Brussels, 2012.
[11] O. Ore, Galois connetions, Trans. Am. Math. Soc., 55 (1944) 493-513.
[12] J. Poelmans, S. O., Kuznetsov, D. I., Ignatov and G. Dedene, Formal concept analysis in knowledge processing: A survey on models and techniques, Expert Syst. Appl., 40 No. 16 (2013) 6601-6623.
[13] D. Ruan, Computational Intelligence in Decision and Control, Proceedings of the 8th International FLINS Conference, Madrid, Spain, 21-24 September 2008, Vol. 1, World Scientific, 2008.
[14] Wille, R. Formal concept analysis as mathematical theory of concepts and concept hierarchies, In: Formal concept analysis: Foundations and applications (pp. 1-33), Springer Berlin Heidelberg, 2005.
[15] S. A. Steinberg, Lattice-ordered Rings and Modules, Springer, New York, 2010.
Algebraic Structures and Their Applications

Articles in Press, Corrected Proof
Available Online from 28 August 2025

Files

Share

How to cite

Statistics