{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:10:39Z","timestamp":1775013039542,"version":"3.50.1"},"reference-count":20,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1134\/s0361768812050076","type":"journal-article","created":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T22:50:33Z","timestamp":1348095033000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Probabilistic generalization of formal concepts"],"prefix":"10.1134","volume":"38","author":[{"given":"E. E.","family":"Vityaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Demin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. K.","family":"Ponomaryov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2012,9,21]]},"reference":[{"key":"6150_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B. and Wille, R., Formal Concept Analysis: Mathematical Foundations, Berlin: Springer, 1999."},{"key":"6150_CR2","volume-title":"Formal Concept Analysis: Foundations and Applications","year":"2005","unstructured":"Formal Concept Analysis: Foundations and Applications, Ganter, B., Stumme, G., and Wille, R., Eds., Heidelberg: Springer, 2005."},{"key":"6150_CR3","doi-asserted-by":"crossref","unstructured":"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\u201346.","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"6150_CR4","volume-title":"Introduction to Data Mining","author":"P.-N. Tan","year":"2006","unstructured":"Tan, P.-N., Steinbach, M., and Kumar, V., Introduction to Data Mining, Boston: Addison-Wesley, 2006, Chapter 6."},{"key":"6150_CR5","doi-asserted-by":"crossref","unstructured":"Webb, G.I., Discovering Significant Patterns, Mach. Learn., 2007, no. 68 (1), pp. 1\u201333.","DOI":"10.1007\/s10994-007-5006-x"},{"key":"6150_CR6","volume-title":"The Handbook of Data Mining","author":"G.I. Webb","year":"2003","unstructured":"Webb, G.I., Association Rules (Chapter 2) in The Handbook of Data Mining, Nong Ye, Ed., Mahwah, N.J.: Lawrence Earlbaum Associates, 2003."},{"key":"6150_CR7","doi-asserted-by":"crossref","unstructured":"Deogun, J., Jiang, L., Xie, Y., and Raghavan, V., Probability Logic Modeling of Knowledge Discovery in Databases, Proc. ISMIS\u20192003, Springer, 2003, pp. 402\u2013407.","DOI":"10.1007\/978-3-540-39592-8_56"},{"key":"6150_CR8","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., An Analysis of First-Order Logic of Probability, Artif. Intell., 1990, no. 46, pp. 311\u2013350.","DOI":"10.1016\/0004-3702(90)90019-V"},{"key":"6150_CR9","doi-asserted-by":"crossref","unstructured":"Kuznetsov, S. and Obiedkov, S., Comparing Performance of Algorithms for Generating Concept Lattices, J. Exp. Theor. Artif. Intell., 2002, no. 14 (2\u20133), pp. 189\u2013216.","DOI":"10.1080\/09528130210164170"},{"key":"6150_CR10","doi-asserted-by":"crossref","unstructured":"Merwe, D., Obiedkov, S., and Kourie, D., AddIntent: A New Incremental Algorithm for Constructing Concept Lattices, Proc. ICFCA\u20192004, Springer, 2004, pp. 372\u2013385.","DOI":"10.1007\/978-3-540-24651-0_31"},{"key":"6150_CR11","unstructured":"Guigues, J.-L. and Duquenne, V., Families minimales d\u2019implications informatives resultant d\u2019un tableau de donn\u00e9es binaries, Math. Sci. Hum., 1986, no. 95, pp. 5\u201318."},{"key":"6150_CR12","unstructured":"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\u2013365."},{"key":"6150_CR13","volume-title":"Kompyuternoe poznanie","author":"E.E. Vityaev","year":"2006","unstructured":"Vityaev, E.E., Kompyuternoe poznanie (Computer Cognition), Novosibirsk: Novosibirsk. Gos. Univ., 2006."},{"key":"6150_CR14","doi-asserted-by":"crossref","unstructured":"Vityaev, E., The Logic of Prediction, Proc. of the 9th Asian Logic Conference, World Sci., 2006, pp. 263\u2013276.","DOI":"10.1142\/9789812772749_0019"},{"key":"6150_CR15","doi-asserted-by":"crossref","unstructured":"Vityaev, E. and Kovalerchuk, B., Empirical Theories Discovery Based on the Measurement Theory, Mind Mach., 2005, no. 14 (4), pp. 551\u2013573.","DOI":"10.1023\/B:MIND.0000045991.67908.13"},{"key":"6150_CR16","unstructured":"Vityaev, E.E., Scientific Discovery. http:\/\/math.nsc.ru\/AP\/Scientific Discovery. Cited December 2011."},{"key":"6150_CR17","unstructured":"Vityaev, E. and Smerdov, S., New Definition of Prediction without Logical Inference, Proc. IASTED Int. Conf. on Computational Intelligence (CI 2009), 2009, pp. 48\u201354."},{"key":"6150_CR18","unstructured":"Kovalerchuk, B. and Vityaev, E., Data Mining in Finance: Advances in Relational and Hybrid Methods, Kluwer, 2000."},{"key":"6150_CR19","unstructured":"Kuznetsov, S., On the Intractability of Computing the Duquenne-Guigues Base, J. Univ. Comput. Sci., 2004, no. 10 (8), pp. 927\u2013933."},{"key":"6150_CR20","doi-asserted-by":"crossref","unstructured":"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\u2013512.","DOI":"10.3233\/IDA-2008-12505"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768812050076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768812050076","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768812050076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768812050076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:05:07Z","timestamp":1775009107000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768812050076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["6150"],"URL":"https:\/\/doi.org\/10.1134\/s0361768812050076","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]},"assertion":[{"value":"14 December 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}