Proceedings of International Conference on Conceptual Structures 2014
Vol. 8577: Graph-Based Representation and Reasoning. Springer, 2014.
Academic editor: N. Hernandez, R. Jäschke, M. Croitoru
This book constitutes the proceedings of the 21st International Conference on Conceptual Structures, ICCS 2014, held in Iaşi, Romania, in July 2014. The 17 regular papers and 6 short papers presented in this volume were carefully reviewed and selected from 40 and 10 submissions, respectively. The topics covered are: conceptual structures, knowledge representation, reasoning, conceptual graphs, formal concept analysis, semantic Web, information integration, machine learning, data mining and information retrieval.
Ignatov D. I., , et al., , in : Proceedings of International Conference on Conceptual Structures 2014. Vol. 8577: Graph-Based Representation and Reasoning.: Springer, 2014. P. 287-292.
This paper considers a recommender part of the data anal- ysis system for the collaborative platform Witology. It was developed by the joint research team of the National Research University Higher School of Economics and the Witology company. This recommender sys- tem is able to recommend ideas, like-minded users and antagonists at the respective phases ...
Added: June 9, 2014
Research target: Mathematics Computer Science
Priority areas: IT and mathematics mathematics
Conceptual Structures for STEM Research and Education, 20th International Conference on Conceptual Structures
Berlin, Heidelberg : Springer, 2013
This book constitutes the proceedings of the 20th International Conference on Conceptual Structures, ICCS 2013, held in Mumbai, India, in January 2013. The 22 full papers presented were carefully reviewed and selected from 43 submissions for inclusion in the book. The volume also contains 3 invited talks. ICCS focuses on the useful representation and analysis ...
Added: June 2, 2013
, , , Procedia Computer Science 2014 Vol. 31 P. 928-938
We propose extensions of the classical JSM-method and the Na ̈ıve Bayesian classifier for the case of triadic relational data. We performed a series of experiments on various types of data (both real and synthetic) to estimate quality of classification techniques and compare them with other classification algorithms that generate hypotheses, e.g. ID3 and Random ...
Added: June 9, 2014
University Rennes 1, 2017
This volume is the supplementary volume of the 14th International Conference on Formal Concept Analysis (ICFCA 2017), held from June 13th to 16th 2017, at IRISA, Rennes. The ICFCA conference series is one of the major venues for researches from the field of Formal Concept Analysis and related areas to present and discuss their recent ...
Added: June 19, 2017
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
, , 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
, , 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
Proceedings of the Twelfth International Conference on Concept Lattices and Their Applications Clermont-Ferrand, France, October 13-16, 2015
Clermont-Ferrand : CEUR Workshop Proceedings, 2015
Formal Concept Analysis is a method of analysis of logical data based on formalization of conceptual knowledge by means of lattice theory. It has proved to be of interest to various applied fields such as data visualization, knowledge discovery and data mining, database theory, and many others. The International Conference “Concept Lattices and Their Applications ...
Added: October 22, 2015
, , et al., International Journal of General Systems 2014 Vol. 43 No. 2 P. 105-134
Formal Concept Analysis (FCA) is a mathematical technique that has been extensively applied to Boolean data in knowledge discovery, information retrieval, web mining, etc. applications. During the past years, the research on extending FCA theory to cope with imprecise and incomplete information made significant progress. In this paper, we give a systematic overview of the ...
Added: June 9, 2014
, , 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
Concept Discovery in Unstructured Data. 2nd International Workshop, CDUD 2012, Leuven, Belgium, May 2012, Proceedings
, , , Leuven : Katholieke Universiteit Leuven, 2012
Added: November 20, 2012
, , et al., Machine Learning 2015
In this paper we search for optimal patterns in triadic data and show the results of the experimental comparison of five triclustering algorithms on real-world and synthetic data over resource efficiency, noise toler- ance and four quality criteria (cardinality, density, coverage, and diversity). The starting point of the study is absolutely dense maximal cuboids (formal ...
Added: October 25, 2013
Rough Sets - International Joint Conference, IJCRS 2017, Olsztyn, Poland, July 3-7, 2017, Proceedings, Part II.
The proceedings contain 94 papers. The special focus in this conference is on Rough Sets. The topics include: Approximations from anywhere and general rough sets; generalized ideals and co-granular rough sets; certainty-based rough sets; the rough membership function on one type of covering-based rough sets and its applications; mereogeometry based approach for behavioral robotics; similarity ...
Added: February 9, 2020
CEUR Workshop Proceedings, 2019
Added: October 31, 2019
The CLA conference is an international forum for researchers, practitioners and students dedicated to the practice of Formal Concept Analysis (FCA) and areas closely related to it, including data analysis and mining, information retrieval, knowledge management, knowledge engineering, logic, algebra and lattice theory. The 15th of CLA, CLA 2020, was going to be held in Tallinn, Estonia ...
Added: October 30, 2020
The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory. The book presents contributions to the following areas: acquisition of terminological knowledge from social networks, knowledge ...
Added: December 17, 2017
, Логистика и управление цепями поставок 2018 № 4 (87) С. 27-33
One of the options for a more flexible approach to analyzing the reliability of supply chains is the principal component analysis (PCA). With a large number of variables describing supply chain, it is a difficult task to analyze the structure of variables in two-dimensional space. Within the analysis of the variables dependencies PCA allows to ...
Added: November 29, 2018
, The coloring problem for classes with two small obstructions / Cornell University. Series math "arxiv.org". 2013. No. 1307.0278v1.
The coloring problem is studied in the paper for graph classes deﬁned by two small forbidden induced subgraphs. We prove some suﬃcient conditions for eﬀective solvability of the problem in such classes. As their corollary we determine the computational complexity for all sets of two connected forbidden induced subgraphs with at most ﬁve vertices except ...
Added: October 3, 2013
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
, , Discrete Optimization 2018 Vol. 29 P. 103-110
We consider boolean linear programming formulations of the vertex and edge dominating set problems and prove their polynomial-time solvability for classes of graphs with constraint matrices having bounded minors in the absolute value. ...
Added: April 8, 2018
Lanham : University Press of America, 2012
The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...
Added: February 13, 2013
, Journal of Applied and Industrial Mathematics 2020 Vol. 14 No. 4 P. 706-721
The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...
Added: January 30, 2021
Formal Concept Analysis: 16th International Conference, ICFCA 2021, Strasbourg, France, June 29 – July 2, 2021, Proceedings
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
Пенза : ПГУ, 2015
В сборник трудов включены доклады юбилейного ХХ-го Международного симпозиума «Надежность и качество», проходившего с 25 по 31 мая 2015 г. в городе Пензе. Рассмотрены актуальные проблемы теории и практики повышения надежности и качества; эффективности внедрения инновационных и информационных технологий в фундаментальных научных и прикладных исследованиях, образовательных и коммуникативных системах и средах, экономике и юриспруденции; методов и ...
Added: May 31, 2015
, Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Agent-based modelling of interactions between air pollutants and greenery using a case study of Yerevan, Armenia
, , , Environmental Modelling and Software 2019 Vol. 116 P. 7-25
Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...
Added: February 24, 2019