Divisive-Agglomerative Algorithm and Complexity of Automatic Classification Problems
Математические методы анализа решений в экономике, бизнесе и политике. WP7. Высшая школа экономики , 2015. No. WP7/2015/09.
An algorithm of solution of the Automatic Classification (AC for brevity) problem is set forth in the paper. In the AC problem, it is required to find one or several partitions, starting with the given pattern matrix or dissimilarity / similarity matrix. The three-level scheme of the algorithm is suggested. The output of the procedure is a family of classifications, while the ratio between the cardinality of this family and the cardinality of the set of all the classifications, considered in the procedure, is taken as a measure of complexity of the initial AC problem. For classifications of parliament members according to their vote results, the general notion of complexity is interpreted as consistence or rationality of this parliament policy. For “tossing” deputies or ⁄ and whole fractions the corresponding clusters become poorly distinguished and partially perplexing that results in relatively high value of complexity of their classifications. By contrast, under consistent policy, deputies’ clusters are clearly distinguished and the complexity level is low enough (i.e. in a given parliament the level of consistency, accordance, rationality is high). The mentioned reasoning was applied to analysis of activity of 2-nd, 3-rd and 4-th RF Duma (Russian parliament, 1996–2007). The classifications based upon one-month votes were constructed for every month. The comparison of complexity for selected periods allows suggesting new meaningful interpretations of activity of various election bodies, including different country parliaments, international organizations and board of large corporations.
Research target: Computer Science
Priority areas: IT and mathematics
, FAMILY OF GRAPH DECOMPOSITIONS AND ITS APPLICATIONS TO DATA ANALYSIS / Издательский дом ВШЭ. Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2016. No. WP7/2016/09 .
A new decomposition approach to complex systems analysis is suggested. The conventional approach deals with the construction of a single, “the most correct”, decomposition of the considered system. Meanwhile the suggested approach is oriented to the construction of a family of decompositions, whose properties reveal some important meaningful features of the initial system. The expedience ...
Added: October 20, 2017
Различение хаотических и регулярных временных рядов для идентификации состояния артериовенозной фистулы
, , et al., Вестник кибернетики 2022 Т. 45 № 1 С. 72-82
The prevalence of chronic kidney disease is growing every year and is already comparable to such socially significant diseases as hypertension and diabetes mellitus, as well as obesity and metabolic syndrome [1,2]. The standard solution for hemodialysis patients is to create a permanent vascular access in the form of an arteriovenous fistula. However, its use ...
Added: November 14, 2022
, , in : Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics. Vol. 197.: Springer, 2017. P. 127-152.
A new approach to network decomposition problems (and, hence, to classification problems, presented in network form) is suggested. Opposite to the conventional approach, consisting in construction of one, “the most correct” decomposition (classification), the suggested approach is focused on construction of a family of classifications. Basing on this family, two numerical indices are introduced and ...
Added: October 20, 2017
Использование вероятностного распределения над множеством классов в задаче классификации арабских диалектов
, , et al., Научно-технический вестник информационных технологий, механики и оптики 2017 № 1(107) С. 110-116
Subject of Research.We propose an approach for solving machine learning classification problem that uses the information about the probability distribution on the training data class label set. The algorithm is illustrated on a complex natural language processing task - classification of Arabic dialects. Method. Each object in the training set is associated with a probability distribution over ...
Added: February 8, 2017
, , Качество. Инновации. Образование 2012 № 7 С. 80-87
The article includes an example of a system approach to managing operational risk in the procurement process. According this approach, 4 interrelated subsystems were identified: beliefs, constraints, control and monitoring. Therefore the operational risk management is a Meta process embedded into business processes and set requirements to the above subsystems. ...
Added: December 13, 2012
Элементы рандомизированного прогнозирования и его применение для предсказания суточной электрической нагрузки энергетической системы
, , , Автоматика и телемеханика 2020 № 7 С. 148-172
A randomized forecasting method based on the generation of ensembles of entropy-optimal forecasting trajectories is developed. The latter are generated by randomized dynamic regression models containing random parameters, measurement noises, and a random input. The probability density functions of random parameters and measurement noises are estimated using real data within the randomized machine learning procedure. ...
Added: October 31, 2020
, , , Сложные системы 2013 № 3 (8) С. 4-50
The global evolution of the world community as an integrated self-organizing and self-developing system is studied in the article; and some main features and laws of its evolution are exposed. The attention is focused on the consideration of cyclic character of evolution, of periods of the global history of mankind, of the growth of complexity ...
Added: November 18, 2013
, , Entropy and Complexity of Polygonal Billiards with Spy mirrors / Cornell University. Series math "arxiv.org". 2015. No. 1501.04584.
We prove that a polygonal billiard with one-sided mirrors has zero topological entropy. In certain cases we show sub exponential and for other polynomial estimates on the complexity. ...
Added: January 26, 2015
, Информационные технологии и вычислительные системы 2018 № 2 С. 60-69
The paper considers the problem of reducing the dimension of the feature space for describing objects in data analysis problems using the example of binary classification. The article provides a detailed overview of existing approaches to solving this problem and proposes several modifications. In which the dimensionality reduction is considered as the problem of extracting the most relevant ...
Added: July 4, 2018
, , Труды Института системного программирования РАН 2014 Т. 26 № 2 С. 245-268
It is generally accepted that to unify a pair of substitutions θ_1 and θ_2 means to find out a pair of substitutions η' and η'' such that the compositions θ_1 η' and θ_2 η'' are the same. Actually, unification is the problem of solving linear equations of the form θ_1 X=θ_2 Y in the semigroup ...
Added: September 30, 2015
Wiesbaden : Springer, 2017
Der Sammelband untersucht Entwicklungen in der Wissenschaft, die in den letzten Jahren durch moderne Informationstechnologien und die zunehmende Verfügbarkeit von Daten angestoßen wurden. Aufgrund dieser neuen Ansätze werden eine Reihe von Phänomenen zum Beispiel aus den Sozial- oder den Lebenswissenschaften berechenbar, die zuvor als zu komplex für eine wissenschaftliche Analyse galten. Der Band versammelt Texte ...
Added: September 2, 2017
Proceedings of the 3rd International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2018)
Funchal : SciTePress, 2018
This book contains the proceedings of the 3rd International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2018) which was organized and sponsored by the Institute for Systems and Technologies of Information, Control and Communication (INSTICC). This conference was technically co-sponsored by World Federation on Soft Computing (WFSC) and also held in cooperation with ...
Added: June 2, 2018
Нейросетевая среда (нейроморфная ассоциативная память) для преодоления информационной сложности. Поиск смысла в слабоструктурированных массивах информации. Часть II. Обработка информации в гиппокампе. Модель мира
, , Информационные технологии 2015 № 11 С. 814-820
Ассоциативная память человека является средством для преодоления информационной сложности, возникавшей и возникающей постоянно в процессе его жизнедеятельности. В работе рассмотрена архитектура, свойства и функциональность ассоциативной памяти с целью ее использования для моделирования способности преодоления информационной сложности. Рассмотрен процесс перенормировки весовых характеристик образов событий, хранящихся в иерархии колонок коры полушарий большого мозга человека, который происходит в ...
Added: November 12, 2016
, , et al., Computer Languages, Systems & Structures 2014 No. 40 P. 137-154
It is well-known that the Dolev–Yao adversary is a powerful adversary. Besides acting as the network, intercepting, decomposing, composing and sending messages, he can remember as much information as he needs. That is, his memory is unbounded. We recently proposed a weaker Dolev–Yao like adversary, which also acts as the network, but whose memory is ...
Added: March 23, 2015
, , et al., Systema: connecting matter, life, culture and technology 2013 Vol. 1 No. 3 P. 04-13
Cybernetics and Systems Research (CSR) were developed in the mid-twentieth century, offering the possibility of describing and comparing different phenomena using the same language. The concepts, which originated in CSR have spread to practically all disciplines, many now used within the scientific study of complex systems. CSR has the potential to contribute to the solution ...
Added: April 15, 2014
, , et al., Psychology in Russia: State of the Art 2013 Vol. 6 No. 3 P. 41-48
Automated classification of a human functional state is an important problem, with applications including stress resistance evaluation, supervision over operators of critical infrastructure, teaching and phobia therapy. Such classification is particularly efficient in systems for teaching and phobia therapy that include a virtual reality module, and provide the capability for dynamic adjustment of task complexity. ...
Added: October 29, 2015
, Философский журнал 2013 № 1 С. 121-134
The phenomenon of innovative complexity is under consideration in this article. The methodology for consideration is based on the modern theory of complex adaptive systems as well as on the conception of enactive cognition (enactivism) in cognitive science and in non-classical epistemology. From this methodological point of view, one can assert that properties of complex ...
Added: November 6, 2013
, , et al., Компетентность 2017 № 9-10 С. 46-57
We have examined the main new competencies that should be matched by the specialist — managers of complex techno-technological and socio-economic systems in the era of information (digital) and industrial revolutions. We have also investigated what kind of overprofessional competencies the expert should have and what the system of its preparation includes. Having outlined and ...
Added: January 29, 2018
, Futures 1999 Vol. 31 No. 3/4 P. 281-290
The hope of nding new methods of predicting the course of historical processes, could be connected with the recent developments of the theory of self-organization, called also synergetics. It provides us with knowledge of constructive principles of coevolution of the complex social systems, coevolution of countries and geopolitical regions being at different stages of development, integration ...
Added: January 22, 2014
MDPI AG, 2020
Proceedings (ISSN 2504-3900) publishes publications resulting from conferences, workshops and similar events. ...
Added: March 13, 2020
, , et al., Proceedings of the Institute for System Programming of the RAS 2018 Vol. 30 No. 1 P. 7-24
State identification is a long standing problem in the area of Finite State Machine (FSM) based modeling and testing of discrete event systems. For the identification of the current state of the system, so-called homing and synchronizing experiments with FSMs are used whereas for the initial state identification one can perform a distinguishing experiment. The ...
Added: October 9, 2019
О связи строения стационарных подгрупп группы графа и эффективности учёта симметрии при решении переборных задач структурного анализа
, , Труды Московского физико-технического института 2009 Т. 1 № 2 С. 77-83
Рассматривается один из универсальных методов повышения эффективности решения переборных задач структурного анализа — метод точного учёта симметрии структур, обладающих нетривиальной группой автоморфизмов. Анализируется связь между строением стационарных подгрупп группы автоморфизмов, накладными расходами на учёт симметрии и общей эффективностью решения задачи. В качестве примера рассматривается задача поиска максимального общего фрагмента пары графов. Приводятся наиболее интересные семейства ...
Added: October 26, 2014
, , , Artificial Intelligence 2014 Vol. 217 P. 43-75
The language RCC8RCC8is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n -dimensional Euclidean space, here denoted RC+(Rn)RC+(Rn), and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key ...
Added: March 24, 2015
, , Философия науки и техники 2017 Т. 22 № 2 С. 120-135
Some non-trivial properties of network structures in social media, which are revealed on the basis of the methodology of network analysis, are considered in the article. It is shown, in particular, that nowadays the emphasis shifts from the study of social complexity to the study of social network structures. The evolutionary trend is the transition ...
Added: January 16, 2018