Probabilistic generalization of formal concepts

Programming and Computer Software

Volumn 38, Issue 5, 2012, Pages 219-230

  Vityaev, E E ^a   Demin, A V ^b   Ponomaryov, D K ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

DATA NOISE; FORMAL CONCEPTS; FORMAL CONTEXTS; PROBABILISTIC APPROACHES; RANDOM NOISE; STANDARD DEFINITIONS;

COMPUTER SOFTWARE;

SOFTWARE ENGINEERING;

EID: 84870552630     PISSN: 03617688     EISSN: None     Source Type: Journal    
DOI: 10.1134/S0361768812050076     Document Type: Article

References (20)

1. Ganter, B. and Wille, R., Formal Concept Analysis: Mathematical Foundations, Berlin: Springer, 1999.
2. Formal Concept Analysis: Foundations and Applications, Ganter, B., Stumme, G., and Wille, R., Eds., Heidelberg: Springer, 2005.
3. Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L., Efficient Mining of Association Rules Using Closed Item Set Lattices, Inf. Syst., 1999, no. 24 (1), pp. 25- 46.
4. Tan, P.-N., Steinbach, M., and, Kumar, V., Introduction to Data Mining, Boston: Addison-Wesley, 2006, Chapter 6.
5. Webb, G.I., Discovering Significant Patterns, Mach. Learn., 2007, no. 68 (1), pp. 1-33.
6. Webb, G.I., Association Rules (Chapter 2) in The Handbook of Data Mining, Nong Ye, Ed., Mahwah, N.J.: Lawrence Earlbaum Associates, 2003.
7. Deogun, J., Jiang, L., Xie, Y., and Raghavan, V., Probability Logic Modeling of Knowledge Discovery in Databases, Proc. ISMIS'2003, Springer, 2003, pp. 402-407.
8. Halpern, J.Y., An Analysis of First-Order Logic of Probability, Artif. Intell., 1990, no. 46, pp. 311-350.
9. Kuznetsov, S. and Obiedkov, S., Comparing Performance of Algorithms for Generating Concept Lattices, J. Exp. Theor. Artif. Intell., 2002, no. 14 (2-3), pp. 189-216.
10. Merwe, D., Obiedkov, S., and Kourie, D., AddIntent: A New Incremental Algorithm for Constructing Concept Lattices, Proc. ICFCA'2004, Springer, 2004, pp. 372-385.
11. Guigues, J.-L. and Duquenne, V., Families minimales d'implications informatives resultant d'un tableau de données binaries, Math. Sci. Hum., 1986, no. 95, pp. 5-18.
12. Smerdov, S.O. and Vityaev, E.E., Synthesis of Logic, Probability, and Training: Formalization of Prediction, Sib. Elektron. Mat. Izv., 2009, no. 6, pp. 340-365.
13. Vityaev, E.E., Kompyuternoe poznanie (Computer Cognition), Novosibirsk: Novosibirsk. Gos. Univ., 2006.
14. Vityaev, E., The Logic of Prediction, Proc. of the 9th Asian Logic Conference, World Sci., 2006, pp. 263-276.
15. Vityaev, E. and Kovalerchuk, B., Empirical Theories Discovery Based on the Measurement Theory, Mind Mach., 2005, no. 14 (4), pp. 551-573.
16. Vityaev, E.E., Scientific Discovery. http://math.nsc.ru/ AP/Scientific Discovery. Cited December 2011.
17. Vityaev, E. and Smerdov, S., New Definition of Prediction without Logical Inference, Proc. IASTED Int. Conf. on Computational Intelligence (CI 2009), 2009, pp. 48-54.
18. Kovalerchuk, B. and Vityaev, E., Data Mining in Finance: Advances in Relational and Hybrid Methods, Kluwer, 2000.
19. Kuznetsov, S., On the Intractability of Computing the Duquenne-Guigues Base, J. Univ. Comput. Sci., 2004, no. 10 (8), pp. 927-933.
20. Vityaev, E., Lapardin, K., Khomicheva, I., and Proskura, A., Transcription Factor Binding Site Recognition by Regularity Matrices Based on the Natural Classification Method, Intell. Data Anal. Special Issue New Methods in Bioinformatics, Vityaev, E. and Kolchanov, N., Eds., 2008, no. 12 (5), pp. 495-512.