Geodesic
On algebraic approach of R.~Wille and B.~Ganter in the investigation of texts
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 10 (2017) no. 3, pp. 372-384.

Voir la notice de l'article provenant de la source Math-Net.Ru

The statement of the problem of a binary classification by precedents using formal concept lattices is given, in which the initial data are two binary contexts. It is specified that this problem is intractable due to the high computational complexity of discovery process of the formal concept and constructing for them of the lattices. The decomposition reception, which allows reducing the computational complexity of this process is proposed and theoretically justified. The reduction of computational complexity is achieved by separation of every initial context on polynomial number of boxes (subcontexts), followed by a search of the formal concepts in each selected box. The results of computational experiments are presented and they confirm the effectiveness of the proposed of reception of the reducing computational complexity.
Keywords: text mining, formal concepts lattice
Mots-clés : classification, Galois connection, decomposition context. 
@article{JSFU_2017_10_3_a15,
     author = {Valentina V. Bykova and Choduraa M. Mongush},
     title = {On algebraic approach of {R.~Wille} and {B.~Ganter} in the investigation of texts},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {372--384},
     publisher = {mathdoc},
     volume = {10},
     number = {3},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2017_10_3_a15/}
}
TY  - JOUR
AU  - Valentina V. Bykova
AU  - Choduraa M. Mongush
TI  - On algebraic approach of R.~Wille and B.~Ganter in the investigation of texts
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2017
SP  - 372
EP  - 384
VL  - 10
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2017_10_3_a15/
LA  - en
ID  - JSFU_2017_10_3_a15
ER  - 
%0 Journal Article
%A Valentina V. Bykova
%A Choduraa M. Mongush
%T On algebraic approach of R.~Wille and B.~Ganter in the investigation of texts
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2017
%P 372-384
%V 10
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2017_10_3_a15/
%G en
%F JSFU_2017_10_3_a15
Valentina V. Bykova; Choduraa M. Mongush. On algebraic approach of R.~Wille and B.~Ganter in the investigation of texts. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 10 (2017) no. 3, pp. 372-384. http://geodesic.mathdoc.fr/item/JSFU_2017_10_3_a15/

[1] G. Birkhoff, Lattice Theory, AMS, Providence, 1967 | MR | Zbl

[2] P. Cimiano, A. Hotho, S. Staab, “Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis”, Journal of Artificial Intelligence Research, 24 (2005), 305–339 | Zbl

[3] B. Ganter, R. Wille, Formal Concept Analyses: mathematical foundations, Springer Science and Business Media, 2012 | MR

[4] B. Ganter, Two basic algorithms in concept analysis, Springer, 2010 | Zbl

[5] S.O. Kuznetsov, “Mathematical aspects of concept analysis”, Journal of Mathematical Sciences, 80:2 (1996), 1654–1698 | DOI | MR | Zbl

[6] S.I. Gurov, Boolean Algebras, Ordered Sets, Lattices: definitions, properties, examples, KRASAND, M., 2012 (in Russian)

[7] S.O. Kuznetsov, “Automatic learning based on formal concept analysis”, Automatizatsiya i Distantsionnoe Upravlenie, 10 (2001), 3–27 (in Russian) | MR | Zbl

[8] D.I. Ignatov, S.O. Kuznetsov, J. Poelmans, “Concept-based Biclustering for Internet Advertisement”, Proceedings of the 12th International Conference on Data Mining Workshops, IEEE Computer Society, 2012, 123–130

[9] F.A. Brokgauz, I.A. Efron, Philosophical Dictionary of logic, psychology, ethics, aesthetics and the history of philosophy, St. Peterburg, 1911 (in Russian)

[10] E.K. Voyshvillo, “Understood as a form of thinking: logical-epistemological analysis”, International Journal of General Systems, 1989 (in Russian)

[11] R. Belohlavek, B. De Baets, J. Outrata, V. Vychodil, “Inducing decision trees via concept lattices”, International Journal of General Systems, 38:4 (2009), 455–467 | DOI | MR | Zbl

[12] M. Sahami, “Learning classification Rules Using Lattices”, Proc ECML (Heraclion, Crete, Greece, 1995), 343–346

[13] C. Caprineto, G. Romano, “GALOIS An order-theoretic approach to conceptual clustering”, Proceedings of ICML93 (Amherst, USA, 1993), 33–40

[14] Z. Xie, W. Hsu, Z. Liu, M. Lee, “Concept Lattice based Composite Classifiers for high Predictability”, Artificial Intelligence, Wollongong, Australia, 139 (2002), 253–267 | DOI

[15] N. Meddouri, M. Meddouri, “Classification Methods based on Formal Concept Analysis”, CLA 2008, 9–16

[16] A. Neznanov, D. Ilvovsky, S. Kuznetsov, “A New FCA-based System for Data Analysis and Knowledge Discovery”, Contributions to the 11th International Conference on Formal Concept Analysis (Dresden, Germany, 2013), 31–44

[17] A.A. Barseghyan, M.S. Kupriyanov, V.V. Stepanenko, I.I. Kholod, Data Analysis Technology: Data Mining, Visual Mining, Text Mining, OLAP, Piter, St. Peterburg, 2008 (in Russian)

[18] D.V. Vlasov, “The methods of forming the theoretical concepts”, Zh. Buryat. Gos. Univ., 2009, no. 6, 37–41 (in Russian)