Decision Concept Lattice vs. Decision Trees and Random Forests
Ch. 16. P. 252-260.
Dudyrev E., Kuznetsov S.
Machine Learning, Optimization, and Data Science. 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, Revised Selected Papers
Cham: Springer, 2019
This book constitutes the post-conference proceedings of the 4th International Conference on Machine Learning, Optimization, and Data Science, LOD 2018, held in Volterra, Italy, in September 2018.The 46 full papers presented were carefully reviewed and selected from 126 submissions. The papers cover topics in the field of machine learning, artificial intelligence, reinforcement learning, computational optimization and data ...
Added: October 17, 2019
Проектирование и разработка модуля для расчёта начального рейтинга транспортного перевозчика с использованием алгоритмов машинного обучения
, , В кн.: Информатика, управление и системный анализ: Труды V Всероссийской научной конференции молодых ученых с международным участием.. .: Ростов н/Д: Ростовский государственный экономический университет "РИНХ", 2018.. С. 94-102.
In the process of developing an information system for logistics transportation, there is a need to determine the initial rating of the new carrier within the parent company. The presence of the rating helps to more accurately carry out the formation of orders and build forecasts of its interaction with the parent company in the ...
Added: September 3, 2019
, , et al., В кн.: Социология и общество: социальное неравенство и социальная справедливость (Екатеринбург , 19-21 октября 2016 года). Материалы V Всероссийского социологического конгресса. .: М.: Российское общество социологов, 2016.. С. 9601-9615.
In this paper, we summarize the results of recent studies on the application of pattern mining and machine learning to the analysis of demographic sequences. The main goal is the demonstration of demographers’ needs, including next-event prediction and the extraction of interesting patterns from substantial datasets of demographic data, which cannot be handled by conventional ...
Added: November 24, 2016
, , et al., Lecture Notes in Computer Science 2012 Vol. 7377 LNAI P. 528-272
In this paper we introduce a novel human-centered data mining software system which was designed to gain intelligence from unstructured textual data. The architecture takes its roots in several case studies which were a collaboration between the Amsterdam-Amstelland Police, GasthuisZusters Antwerpen (GZA) hospitals and KU Leuven. It is currently being implemented by bachelor and master ...
Added: February 7, 2013
, , et al., , in: Knowledge Engineering and Semantic Web. Vol. 518: 6th International Conference, KESW 2015, Moscow, Russia, September 30 - October 2, 2015, Proceedings.: Switzerland: Springer, 2015.. P. 225-239.
In this paper, we present the results of our first studies in application of pattern mining and machine learning techniques to analysis of demographic sequences in Russia based on data of 11 generations from 1930 to 1984. The main goal is not prediction and data mining methods themselves but rather extraction of interesting patterns and ...
Added: September 16, 2015
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
CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings
M.: Higher School of Economics, National Research University, 2016
The 13th International Conference on “Concept Lattices and Applications (CLA 2016)” was held at National Research University Higher School of Economics, Moscow, Russia from July 18 until July 22, 2016. The CLA conference, organized since 2002, aims to provide to everyone interested in Formal Concept Analysis and more generally in Concept Lattices or Galois Lattices, ...
Added: October 6, 2016
, , В кн.: Вестник Российского мониторинга экономического положения и здоровья населения НИУ ВШЭ (RLMS‑HSE). Вып. 9.: М.: Издательский дом НИУ ВШЭ, 2019.. С. 157-174.
The article explores how socio-demographic characteristics of Russian children and teenagers affect their academic performance at school. As the RLMS-HSE data for 2013–2017 shows, higher academic attainments are positively associated with gender, the level of parental education, class size, extracurricular and leisure activities. Meanwhile, the type of school, place of residence, and per capita household ...
Added: October 6, 2019
, , , in: Proceedings of the International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI at ECAI 2016). .: M.: [б.и.], 2016.. P. 105-112.
Decision tree learning is one of the most popular classifica- tion techniques. However, by its nature it is a greedy approach to finding a classification hypothesis that optimizes some information-based crite- rion. It is very fast but may lead to finding suboptimal classification hy- potheses. Moreover, in spite of decision trees being easily interpretable, ensembles ...
Added: October 6, 2016
, Социология: методология, методы, математическое моделирование 2020 Т. 0 № 50-51 С. 63-96
Decision trees are a method of classification and prediction, widely applied in sociological research. It is unchangingly popular due to its flexibility and simplicity of interpretation. Choosing the most appropriate decision tree algorithm is not an easy task for several reasons: (a) there is already over a hundred algorithms with different strengths, weaknesses and logic ...
Added: October 31, 2019
Proceedings of the Fifthteenth International Conference on Concept Lattices and Their Applications Tallinn, Estonia, June 29–July 1, 2020. Edited by Francisco J. Valverde-Albacete Martin Trnecka ...
Added: October 29, 2020
, , et al., Science of Computer Programming 2009 Vol. 74 No. 3 P. 128-142
An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection of sets with respect to set intersection. The analysis explains the empirical efficiency ...
Added: January 25, 2013
, , et al., , in: CLA 2016: Proceedings of the Thirteenth International Conference on Concept Lattices and Their Applications. CEUR Workshop Proceedings. Vol. 1624.: M.: Higher School of Economics, National Research University, 2016.. P. 45-56.
We propose a new algorithm for consensus clustering, FCA-Consensus, based on Formal Concept Analysis. As the input, the algorithm takes T partitions of a certain set of objects obtained by k-means algorithm after T runs from different initialisations. The resulting consensus partition is extracted from an antichain of the concept lattice built on a formal ...
Added: October 24, 2016
, , et al., В кн.: Инновационные, информационные и коммуникационные технологии: сборник трудов XIII Международной научно-практической конференции. .: М.: Ассоциация выпускников и сотрудников ВВИА им. проф. Жуковского, 2016.. С. 92-95.
In the article an efficiency of the modern classification instruments usage for the task of scientific articles texts rubrication according to the UDC classifier is analyzed. The following means are explored: artificial neural networks, cosine similarity, naive Bayesian classifier, decision trees and random forest. ...
Added: October 29, 2016
, , , , in: Advances in Neural Information Processing Systems 32 (NeurIPS 2019). .: [б.и.], 2019.. P. 1-10.
In this work, we introduce a new decision tree ensemble representation framework: instead of using a graph model we transform each tree into a well-known polynomial form. We apply the new representation to three tasks: theoretical analysis, model reduction, and interpretation. The polynomial form of a tree ensemble allows a straightforward interpretation of the original ...
Added: December 27, 2019
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
Next Priority Concept: A new and generic algorithm computing concepts from complex and heterogeneous data
, , et al., , in: Electronic Procedings Theoretical Computer Science. Vol. 845.: [б.и.], 2020.. P. 1-20.
In this article, we present a new data type agnostic algorithm calculating a concept lattice from heterogeneous and complex data. Our NextPriorityConcept algorithm is first introduced and proved in the binary case as an extension of Bordat's algorithm with the notion of strategies to select only some predecessors of each concept, avoiding the generation of ...
Added: October 29, 2020
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is ...
Added: October 29, 2020
, , , Fundamenta Informaticae 2012 Vol. 115 No. 4 P. i-ii
The paper is the preface to the special issue of the Fundamenta Informaticae journal on concept lattices and their applications. It is focused on recent developments in Formal Concept Analysis (FCA), as well as on applications in closely related areas such as data mining, information retrieval, knowledge management, data and knowledge engineering, and lattice theory. ...
Added: January 25, 2013
, , , in: RuZA 2015 Workshop. Proceedings of Russian and South African Workshop on Knowledge Discovery Techniques Based on Formal Concept Analysis (RuZA 2015). November 30 - December 5, 2015, Stellenbosch, South Africa. Vol. 1552.: Aachen: CEUR Workshop Proceedings, 2015..
Being an unsupervised machine learning and data mining technique, biclustering and its multimodal extensions are becoming popular tools for analysing object-attribute data in different domains. Apart from conventional clustering techniques, biclustering is searching for homogeneous groups of objects while keeping their common description, e.g., in binary setting, their shared attributes. In bioinformatics, biclustering is used ...
Added: June 14, 2016
, , , , in: Analysis of Images, Social Networks and Texts Third International Conference, AIST 2014, Yekaterinburg, Russia, April 10-12, 2014, Revised Selected Papers. Vol. 439.: Berlin: Springer, 2014.. P. 101-110.
Added: November 13, 2014
Использование метрических признаков в решающих деревьях на примере задачи классификации типов лесных массивов.
, Вестник Российского экономического университета им. Г.В. Плеханова 2015 Т. 82 № 4 С. 148-152
Methods of classification by nature of decision-making divide on methods using global optimization (all training samples are used), and local optimization (only samples in the neighbourhood of the studied object are used). The perspective direction of research is combination of advantages of each approach in one integrated classifier. In article the method of combination of ...
Added: March 16, 2016
, , Journal of Corporate Finance Research 2020 Vol. 14 No. 4 P. 7-18
This study is aimed at investigating the application of news sentiment analysis to bankruptcy prediction models in the context of the Russian retail sector. We analyse 190 companies: 95 Russian retail companies that went bankrupt in 2015-2019, and 95 non-defaulting analogue companies. This figure was attained from a larger pool of 312 companies retrieved from the ...
Added: November 10, 2020
, Информационные технологии 2016 Т. 22 № 4 С. 249-254
In this paper a new approach for solving the maximum clique problem is presented. For a given graph the suggested approach uses machine learning technique to predict the fastest algorithm from several algorithms for the maximum clique problem. Then the chosen algorithm is applied for solving the maximum clique problem in this graph. The computational ...
Added: May 27, 2016