### ?

## Probably approximately correct learning of Horn envelopes from queries

Discrete Applied Mathematics. 2020. Vol. 273. P. 30-42.

Borchmann D., Hanika T., Obiedkov S.

We propose an algorithm for learning the Horn envelope of an arbitrary domain using an expert, or an oracle, capable of answering certain types of queries about this domain. Attribute exploration from formal concept analysis is a procedure that solves this problem, but the number of queries it may ask is exponential in the size of the resulting Horn formula in the worst case. We recall a well-known polynomial-time algorithm for learning Horn formulas with membership and equivalence queries and modify it to obtain a polynomial-time probably approximately correct algorithm for learning the Horn envelope of an arbitrary domain.

Yarullin R., Obiedkov S., International Journal of Approximate Reasoning 2020 Vol. 127 P. 1-16

In Angluin's exact-learning framework, equivalence queries can be simulated by stochastic equivalence testing to achieve a probably approximately correct identification of an unknown concept. We present an analysis of the number of samples that need to be generated in the process leading to a theoretical improvement on an earlier approach. We apply this modification to ...

Added: October 6, 2020

Kashnitsky Y., Труды Московского физико-технического института 2014 Т. 6 № 3 С. 43-56

Triclustering is an outgrowth of Formal Concept Analysis intented to detect groups of objects with similar properties (clusters) in a context of three sets of entities. In case of social network analysis, for instance, these sets might be users, their interests and events they take part in. Triclustering here can help to detect users with ...

Added: November 8, 2013

Parinov A., Научно-техническая информация. Серия 2: Информационные процессы и системы 2014

В статье рассматриваются сочетания базовых структур данных локального хранилища системы поддержки принятия решений FCART и приводятся временные характеристики при использовании больших объемов данных. ...

Added: November 19, 2013

Ignatov D. I., Kuznetsov S., Zhukov L. E. et al., International Journal of General Systems 2013 Vol. 42 No. 6 P. 572-593

formal concept analysis,
data mining,
triclustering,
three-way data,
folksonomy,
spectral triclustering ...

Added: October 16, 2013

Ignatov D. I., Shestakoff A., Lecture Notes in Computer Science 2013

We propose a new FCA-based algorithm for consensus clustering FCA-Consensus. As the input the algorithm takes $n$ partitions of a certain set of objects obtained by k-means algorithm after its $n$ different executions. The resulting consensus partition is extracted from a (partial) antichain of the concept lattice built on formal context $objects \times classes$, where ...

Added: October 26, 2013

Alam M., Buzmakov A. V., Napoli A., Discrete Applied Mathematics 2018 Vol. 249 P. 2-17

With an increased interest in machine processable data and with the progress of semantic technologies, many datasets are now published in the form of RDF triples for constituting the so-called Web of Data. Data can be queried using SPARQL but there are still needs for integrating, classifying and exploring the data for data analysis and ...

Added: September 26, 2017

Buzmakov A. V., Egho E., Jay N. et al., International Journal of General Systems 2016 Vol. 45 No. 2 P. 135-159

Nowadays data-sets are available in very complex and heterogeneous ways. Mining of such data collections is essential to support many real-world applications ranging from healthcare to marketing. In this work, we focus on the analysis of “complex” sequential data by means of interesting sequential patterns. We approach the problem using the elegant mathematical framework of ...

Added: February 25, 2016

Springer, 2019

This book constitutes the proceedings of the 15th International Conference on Formal Concept Analysis, ICFCA 2019, held in Frankfurt am Main, Germany, in June 2019.
The 15 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 36 submissions. The book also contains four invited contributions in full paper length.
The ...

Added: October 29, 2019

Buzmakov A. V., Kuznetsov S., Napoli A., Procedia Computer Science 2014 Vol. 31 P. 918-927

There is a lot of usefulness measures of patterns in data mining. This paper is focused on the measures used in Formal Concept Analysis (FCA). In particular, concept stability is a popular relevancy measure in FCA. Experimental results of this paper show that high stability of a pattern in a given dataset derived from the ...

Added: October 22, 2015

Springer, 2015

Proceedings of the 9th International Symposium on Intelligent Distributed Computing – IDC'2015, Guimarães, Portugal, October 2015 ...

Added: October 19, 2015

Kaytoue M., Kuznetsov S., Macko J. et al., Annals of Mathematics and Artificial Intelligence 2014 Vol. 70 No. 1 P. 55-79

Biclustering numerical data became a popular data-mining task at the beginning of 2000’s, especially for gene expression data analysis and recommender systems. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So-called biclusters of similar values can be thought as maximal sub-tables with ...

Added: October 27, 2015

Belfodil A., Kuznetsov S., Kaytoue M., International Journal of General Systems 2020 Vol. 49 No. 8 P. 785-818

Order and lattice theory provides convenient mathematical tools for pattern mining, in particular for condensed irredundant representations of pattern spaces and their efficient generation. Formal Concept Analysis (FCA) offers a generic framework, called pattern structures, to formalize many types of patterns, such as itemsets, intervals, graphs, and sequence sets. Moreover, FCA provides generic algorithms to generate irredundantly all ...

Added: January 25, 2021

Ignatov D. I., Chubis Y., Konstantinov A. V., Lecture Notes in Computer Science 2013 Vol. 7814 P. 722-725

We proposed a prototype of near-duplicate detection system for web-shop owners. It’s a typical situation for this online businesses to buy description of their goods from so-called copyrighters. Copyrighter can cheat from time to time and provide the owner with some almost identical descriptions for different items. In this paper we demonstrated how we can ...

Added: October 10, 2013

Aachen : CEUR Workshop Proceedings, 2013

Formal Concept Analysis (FCA) is a mathematically well-founded theory aimed at data analysis and classication, introduced and detailed in the book of Bernhard Ganter and Rudolf Wille, \Formal Concept Analysis", Springer 1999. The area came into being in the early 1980s and has since then spawned over 10000 scientic publications and a variety of practically ...

Added: October 10, 2013

Malaga : CEUR Workshop Proceedings, 2015

Social network analysis (SNA) is a multidisciplinary research area that has attracted many researchers from different disciplines such as Physics, Mathematics, Sociology, Biology and Computer Science, and has been studied according to different approaches and techniques. A social network is a dynamic structure (generally represented as a graph) of a set of entities/actors (nodes) together ...

Added: October 19, 2015

Springer, 2021

This book constitutes the proceedings of the 16th International Conference on Formal Concept Analysis, ICFCA 2021, held in Strasbourg, France, in June/July 2021.
The 14 full papers and 5 short papers presented in this volume were carefully reviewed and selected from 32 submissions. The book also contains four invited contributions in full paper length.
The research part ...

Added: July 10, 2021

М. : Издательский центр «Российский государственный гуманитарный университет», 2019

Сборник включает 27 докладов международной конференции по компьютерной лингвистике и интеллектуальным технологиям «Диалог 2019», не вошедшие в ежегодник «Компьютерная лингвистика и интеллектуальные технологии», но рекомендованные Программным Комитетом к представлению на конференции. Для специалистов в области теоретической и прикладной лингвистики и интеллектуальных технологий. ...

Added: December 10, 2019

Karpov V. E., Karpova I. P., Procedia Engineering 2015 Vol. 100 P. 1459-1468

Work solutions are proposed for problems of leader definition and role distribution in homogeneous groups of robots. It is shown that transition from a swarm to a collective of robots with hierarchical organization is possible using exclusively local interaction. The local revoting algorithm is central to the procedure for choice of leader while redistribution of roles can ...

Added: March 14, 2015

Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865

We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...

Added: April 7, 2014

Skoptsov K. A., Sheshenin S., Galatenko V. V. et al., International Journal of Applied Mechanics 2016 Vol. 8 No. 2 P. 1650016-01-1650016-18

We present a method for evaluating elastic properties of a composite material produced by molding a resin filled with short elastic fibers. A flow of the filled resin is simulated numerically using a mesh-free method. After that, assuming that spatial distribution and orientation of fibers are not significantly changed during polymerization, effective elastic moduli of ...

Added: May 22, 2016

Sotnikova S., Динамика сложных систем 2012 № 3 С. 84-87

In article is described designed programme complex of the physical processes modeling, which also allows to conduct the identification printed node parameters (the physical model). On printed node designed the on-board secondary power supply source is realized. For it are designed relationship interfaces of controlling program with the known program of modeling and optimization. ...

Added: December 5, 2014

Chuprikov P., Nikolenko S. I., Davydow A. et al., IEEE Transactions on Networking 2018 Vol. 26 No. 1 P. 342-355

Modern network elements are increasingly required to deal with heterogeneous traffic. Recent works consider processing policies for buffers that hold packets with different processing requirements (number of processing cycles needed before a packet can be transmitted out) but uniform value, aiming to maximize the throughput, i.e., the number of transmitted packets. Other developments deal with ...

Added: March 14, 2018

Chernyshev S. V., Cherepanov E. A., Pankratiev E. V. et al., Journal of Mathematical Sciences 2005 Vol. 128 No. 6 P. 3487-3495

Added: January 27, 2014

Dubnov Y. A., Искусственный интеллект и принятие решений 2020 № 2 С. 78-85

The paper considers the problem of feature selection in the classification problem. A method for selecting informative features based on a probabilistic approach and cross-entropy metrics is proposed. Several variants of the information criterion for selecting features for a binary classification problem are considered, as well as its generalization to the case of a multiclass ...

Added: October 31, 2020