?
Using Taxonomy Tree to Generalize a Fuzzy Thematic Cluster
P. 1–6.
This paper presents an algorithm, ParGenFS, for generalizing, or “lifting”, a fuzzy set of topics to higher ranks of a hierarchical taxonomy of a research domain. The algorithm ParGenFS finds a globally optimal generalization of the topic set to minimize a penalty function, by balancing the number of introduced “head subjects” and related errors, the “gaps” and “offshoots”, differently weighted. This leads to a generalization of the topic set in the taxonomy. The usefulness of the method is illustrated on a set of 17685 abstracts of research papers on Data Science published in Springer journals for the past 20 years. We extracted a taxonomy of Data Science from the international Association for Computing Machinery Computing Classification System 2012 (ACM-CCS). We find fuzzy clusters of leaf topics over the text collection, lift them in the taxonomy, and interpret found head subjects to comment on the tendencies of current research.
Publication based on the results of:
Sánchez-Ansola E., Pérez-Pérez A., Rosete A. et al., Computational Intelligence and Neuroscience 2022 Vol. 2022 P. 1–9
Added: September 18, 2026
Shvedov A. S., Sviyazov V., В кн.: Системное моделирование социально-экономических процессов: труды 46-ой международной научной школы-семинара, г. Уфа, 9 - 15 октября 2023 г.: Воронеж: Истоки, 2024. С. 526–531.
The generalized autoregressive conditional heteroscedasticity model is widely applied to financial time series. There are further generalizations of this model. One of such generalizations is a combination of Takagi–Sugeno type fuzzy systems and autoregressive conditional heteroscedasticity models. The Takagi–Sugeno fuzzy systems advantage is that there is a standalone generalized autoregressive conditional heteroscedasticity model constructed for ...
Added: June 26, 2024
Springer, 2022.
This book constitutes selected and revised papers from the 22nd International Conference on Mathematical Modeling and Supercomputer Technologies, MMST 2022, held in Nizhny Novgorod, Russia, in November 2022.
The 20 full papers and 5 short papers presented in the volume were thoroughly reviewed and selected from the 48 submissions. They are organized in topical secions on computational methods ...
Added: December 26, 2022
Shvedov A. S., Discrete Mathematics and Applications 2022 Vol. 32 No. 2 P. 139–145
Added: May 31, 2022
Petrosian A., Демографическое обозрение 2021 № 3 С. 42–73
Insufficient data until recently have resulted in a lack of studies on population indicators for small areas in
Russia. The article focuses on an analysis of fertility in 2,
304 municipal level areas of Russia’s regions.
The
study is based on the Rosstat municipal data on the number of women of reproductive age by five
year
age groups and the number ...
Added: May 2, 2022
Omrani H., Alizadeh A., Emrouznejad A. et al., Expert Systems with Applications 2022 Vol. 189 Article 116021
Performance evaluation enables decision makers (DMs) to have a better view about the weaknesses and strengths of leading units to improve efficiencies as a crucial goal. Data envelopment analysis (DEA) is the most popular technique to measure performance efficiency of decision making units (DMUs). However, conventional DEA is unable to consider uncertainty of input and ...
Added: October 12, 2021
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
Pietarinen A., Cristalli C., HOPOS 2021 Vol. 11 No. 1 P. 93–121
Abstraction and generalization are two processes of reasoning that have a special role in the construction of scientific theories and models. They have been important parts of the scientific method ever since the nineteenth century. A philosophical and historical analysis of scientific practices shows how abstraction and generalization found their way into the theory of ...
Added: May 29, 2021
Mirkin B., Frolov D., Vlasov A. et al., , in: Intelligent Data Engineering and Automated Learning – IDEAL 2020/ 21st International Conference, Guimaraes, Portugal, November 4–6, 2020, Proceedings, Part IIVol. 12490: Lecture Notes in Computer Science.: Cham: Springer, 2020. P. 423–433.
We define and find a most specific generalization of a fuzzy set of topics assigned to leaves of the rooted tree of a taxonomy. This generalization lifts the set to a “head subject” in the higher ranks of the taxonomy, that is supposed to “tightly” cover the query set, possibly bringing in some errors, both ...
Added: November 13, 2020
Shvedov A. S., Automation and Remote Control 2020 Vol. 81 No. 7 P. 1279–1285
The result on existence of a pure-strategy symmetric Bayesian Nash equilibrium in the war of attrition is generalized for fuzzy players’ actions and types. ...
Added: September 26, 2020
Shvedov A. S., Автоматика и телемеханика 2020 № 7 С. 139–147
The result on existence of a pure-strategy symmetric Bayesian Nash equilibrium in the war of attrition is generalized for fuzzy players' actions and types. ...
Added: September 26, 2020
Mirkin B., Frolov D., Vlasov A. et al., , in: WIMS 2020: Proceedings of the 10th International Conference on Web Intelligence, Mining and Semantics.: Association for Computing Machinery (ACM), 2020. P. 184–189.
We define and find a most specific generalization of a fuzzy set of topics assigned to leaves of the rooted tree of a taxonomy. This generalization lifts the set to a “head subject” in the higher ranks of the taxonomy, that is supposed to “tightly” cover the query set, possibly bringing in some errors, both ...
Added: August 28, 2020
Frolov D., Mirkin B., Nascimento S. et al., , in: Intelligent Data Engineering and Automated Learning – IDEAL 2019Vol. 2.: Springer, 2019. P. 3–11.
We define a most specific generalization of a fuzzy set of
topics assigned to leaves of the rooted tree of a domain taxonomy. This
generalization lifts the set to its “head subject” node in the higher ranks
of the taxonomy tree. The head subject is supposed to “tightly” cover
the query set, possibly bringing in some errors referred to ...
Added: December 7, 2019
Springer, 2019.
We define a most specific generalization of a fuzzy set of
topics assigned to leaves of the rooted tree of a domain taxonomy. This
generalization lifts the set to its “head subject” node in the higher ranks
of the taxonomy tree. The head subject is supposed to “tightly” cover
the query set, possibly bringing in some errors referred to ...
Added: December 7, 2019
Frolov D., Nascimento S., Fenner T. et al., Information Sciences 2020 Vol. 512 P. 595–615
This paper proposes a novel method, referred to as ParGenFS, for finding a most specific generalization of a query set represented by a fuzzy set of topics assigned to leaves of the rooted tree of a taxonomy. The query set is generalized by “lifting” it to one or more “head subjects” in the higher ranks ...
Added: October 9, 2019
P.: Atlantis Press, 2019.
Added: September 25, 2019
Frolov D., Mirkin B., Nascimento S. et al., , in: Optimization of Complex Systems: Theory, Models, Algorithms and Applications.: Switzerland: Springer Publishing Company, 2020. P. 779–789.
This paper presents a relatively rare case of an optimization problem in data analysis to admit a globally optimal solution by a recursive algorithm. We are concerned with finding a most specific generalization of a fuzzy set of topics assigned to leaves of domain taxonomy represented by a rooted tree. The idea is to “lift” ...
Added: June 25, 2019
Savchenko L.V., Savchenko A.V., Journal of Communications Technology and Electronics 2019 Vol. 64 No. 3 P. 238–244
In this paper, we studied the phonetic approach for voice processing. A method for automatic recognition
of speech signals, in which each quasistationary segment is associated with a fuzzy set of phonemes,
was developed. We proposed the operation of the probabilistic triangular norm for fuzzy sets corresponding
to the input frame and the nearest reference phoneme. The developed ...
Added: June 7, 2019
Frolov D., Mirkin B., Nascimento S. et al., , in: CONTENT 2019, The Eleventh International Conference on Creative Content Technologies.: International Academy, Research, and Industry Association (IARIA), 2019. P. 20–25.
We define a most specific generalization of a fuzzy set of topics assigned to leaves of the rooted tree of a domain taxonomy. This generalization lifts the set to its 'head subject' in the higher ranks of the taxonomy tree. The head subject is supposed to 'tightly' cover the query set, possibly bringing in some ...
Added: June 4, 2019
International Academy, Research, and Industry Association (IARIA), 2019.
Added: June 4, 2019
Frolov D., Mirkin B., Nascimento S. et al., , in: International Conference on Artificial Intelligence and Soft Computing. 18th International Conference, ICAISC 2019, Zakopane, Poland, June 16–20, 2019, Proceedings* 1. Issue 11508.: Cham: Springer, 2019. P. 273–286.
We define and find a most specific generalization of a fuzzy set of topics assigned to leaves of the rooted tree of a taxonomy. This generalization lifts the set to a “head subject” in the higher ranks of the taxonomy, that is supposed to “tightly” cover the query set, possibly bringing in some errors, both ...
Added: June 3, 2019