?
Multimodal Clustering for Community Detection
Ch. 4. P. 59–96.
Multimodal clustering is an unsupervised technique for mining interesting patterns in n-ary relations or n-mode networks. Among different types of such generalised patterns one can find biclusters and formal concepts (maximal bicliques) for two-mode case, triclusters and triconcepts for three-mode case, closed n-sets for n-mode case, etc. Object-attribute biclustering (OA-biclustering) for mining large binary datatables (formal contexts or two-mode networks) arose by the end of the last decade due to intractability of computation problems related to formal concepts; this type of patterns was proposed as a meaningful and scalable approximation of formal concepts. In this paper, our aim is to present recent advance in OA-biclustering and its extensions to mining multi-mode communities in SNA setting. We also discuss connection between clustering coefficients known in SNA community for one-mode and two-mode networks and OA-bicluster density, the main quality measure of an OA-bicluster. Our experiments with two-, three-, and four-mode large real-world networks show that this type of patterns is suitable for community detection in multi-mode cases within reasonable time even though the number of corresponding n-cliques is still unknown due to computation difficulties. An interpretation of OA-biclusters for one-mode networks is provided as well.
Keywords: бикластеризацияанализ формальных понятийFormal Concept Analysisтрикластеризацияbiclusteringmultimodal clusteringмультимодальная кластеризациябимодальные сетипоиск сообществTriclusteringTwo-mode networksMulti-mode networksSocial and complex networksCommunity detectionBiclique relaxationмультимодальные сетисоциальные и сложные сетиослабление биклики
Publication based on the results of:
Ignatov D. I., , in: 11th International Conference, AIST 2023, Yerevan, Armenia, September 28–30, 2023, Revised Selected Papers. Analysis of Images, Social Networks and Texts. Lecture Notes in Computer Science (LNCS, volume 14486).: Cham: Springer, 2024. P. 349 – 361.
This paper dates back to the asymptotic solutions of Rota’s problem on the size of maximum antichain in the set partition lattice by Canfield and Harper and others. The knowledge of asymptotic coefficients could pave the way to the asymptotic solutions of such problems as (maximal) antichain counting in partition lattices. In addition to our ...
Added: January 23, 2026
I. Samoylenko, Aleja D., Primo E. et al., Physical Review X 2023 Vol. 13 No. 2 Article 021032
A wealth of evidence shows that real-world networks are endowed with the small-world property, i.e., that the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. In addition, most social networks are organized so that no individual is more than six connections apart from any other, an empirical ...
Added: July 28, 2023
Lubashevskiy V., Lubashevsky I., IEEE Access 2023 Vol. 11 P. 58046–58054
Detection of significant edges maintaining the connectivity in complex networks is essential in many applications such as attack vulnerability analysis, the spread of epidemic diseases, and information spreading patterns discovery. There are many existing methods enabling us to evaluate the criticality ranking of links in networks, which are based on straightforward algorithms and topological features of analyzed graphs. In ...
Added: June 26, 2023
Ignatov D. I., Lobachevskii Journal of Mathematics 2023 No. 44 P. 137–146
We consider two ways how to compute the number of maximal antichains in the Boolean lattice on 𝑛 elements. The first one is based on full direct enumeration, while the second ones relies on concept lattices or Galois lattices (studied in Formal Concept Analysis, an applied branch of lattice theory) and the Dedekind–MacNeille completion of a partial ...
Added: June 13, 2023
Lukianchenko P., Gromov V., Beschastnov Y. et al., Вестник кибернетики 2022 Т. 4 № 48 С. 37–48
The study analyzes the time series of the number of new cases in the administrative courts
of the Russian Federation using two methods of time series grouping according to the chaotic, stochastic, and
regular structure. The first model is based on the entropy‒complexity plane, the second one is presented by the
attribute‒object graph. As a result, four groups ...
Added: March 20, 2023
Gromov V., Урманцева Н. Р., [б.и.], 2021.
В докладе рассматриваются подходы к прогнозированию на основе кластеризации, опирающиеся на методологию анализа формальных понятий. Методология применяется для кластеризации участков временного ряда с целью выделения характерных участков (мотивов), отвечающих больным с различной степенью засорённости фистулы. ...
Added: January 30, 2023
Ilya Semenkov, Sergei O. Kuznetsov, , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. P. 105–112.
This paper presents different versions of classification ensemble methods based on pattern structures. Each of these methods is described and tested on multiple datasets (including datasets with exclusively numerical and exclusively nominal features). As a baseline model Random Forest generation is used. For some classification tasks the classification algorithms based on pattern structures showed better ...
Added: December 19, 2022
Ignatov D. I., Khvorykh G., Khrunin A. et al., , in: Recent Trends in Analysis of Images, Social Networks and Texts. 9th International Conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020 Revised Supplementary ProceedingsVol. 12602.: Springer, 2021. P. 185–204.
© 2021, Springer Nature Switzerland AG.Missing genotypes can affect the efficacy of machine learning approaches to identify the risk genetic variants of common diseases and traits. The problem occurs when genotypic data are collected from different experiments with different DNA microarrays, each being characterised by its pattern of uncalled (missing) genotypes. This can prevent the ...
Added: November 1, 2022
Egurnov D., Ignatov D. I., Automation and Remote Control 2022 Vol. 83 No. 6 P. 894–902
Abstract: The paper deals with the problem of triclustering in multivalued triadic contexts in termsof one multidimensional extension of formal concept analysis; triclustering can be viewed as asearch for dense subtensors in three-dimensional tensors over the field of real numbers. Twomethods are proposed for solving this problem, namely, NOAC—a version of the OACtriclustering method for ...
Added: November 1, 2022
Dudyrev E., Kuznetsov S., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 9 P. 99–104.
Ensembles of decision trees, like Random Forests are efficient machine learning models with state-of-the-art prediction quality. However, their predictions are much less transparent than those of a single decision tree. In this paper, we describe a prediction model based on a single decision tree in terms of Formal Concept Analysis. We define a differential way ...
Added: December 8, 2021
Buzmakov A. V., Kuznetsov S., Makhalova T. et al., , in: Proceedings of the 9th International Workshop "What can FCA do for Artificial Intelligence?" (FCA4AI 2021)Vol. 2972.: CEUR-WS, 2021. Ch. 2 P. 19–26.
Added: December 7, 2021
Shalileh S., Mirkin B., Social Network Analysis and Mining 2021 Vol. 11 No. 1 P. 1–23
A feature-rich network is a network whose nodes are characterized by categorical or quantitative features. We propose a data-driven model for finding a partition of the nodes to approximate both the network link data and the feature data. The model involves summary quantitative characteristics of both network links and features. We distinguish between two modes ...
Added: July 29, 2021
Jyoti -., Buzmakov Aleksey, Kailasam S., , in: The 15th International Conference on Concept Lattices and Their Applications CLA2020Issue 2668.: CEUR-WS, 2020. P. 287–292.
Added: July 10, 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
Tikhomirova K., Makarov I., , in: Analysis of Images, Social Networks and Texts: 9th International Conference, AIST 2020, Skolkovo, Moscow, Russia, October 15–16, 2020, Revised Selected PapersVol. 12602.: Springer, 2021. P. 294–302.
The paper studies the community detection problem on Telegram channels. The dataset is received from TGStat service and includes the information of 58k forwards between 100 politician Telegram channels. We implement modern clustering approaches to solve the problem of missing social links. Our study is based on a combination of structural features with strategy-based attributes, ...
Added: April 9, 2021
Shalileh S., Mirkin B., , in: Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - The 11th Conference on Network Modeling and Analysis(Vol-2750)Vol. Vol-2750: Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - Network Modeling and Analysis 2020.: CEUR-WS.org, 2020. P. 1–12.
The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. Existing approaches require the number of communities pre-specified. We apply the so-called data recovery approach to ...
Added: January 13, 2021
Shalileh S., Mirkin B., , in: Complex Networks & Their Applications IX. Volume 1: Proceedings of the Ninth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2020.: Springer, 2021. P. 3–14.
The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. Algorithms based on probabilistic community models require the node features to be categorical. We use a ...
Added: January 13, 2021
Shalileh S., Mirkin B., , in: 2020 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).: Association for Computing Machinery (ACM), 2020. P. 99–104.
The problem of community detection in a network with features at its nodes takes into account both the graph structure and node features. The goal is to find relatively dense groups of interconnected entities sharing some features in common. We apply the so-called data recovery approach to the problem by combining the least-squares recovery criteria ...
Added: December 11, 2020