?
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.
Under the general editorship: R. Interdonato
MARAMI 2020
Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - Network Modeling and Analysis 2020
Proceedings of MARAMI 2020 - Modèles & Analyse des Réseaux : Approches Mathématiques & Informatiques - The 11th Conference on Network Modeling and Analysis
Virtual Conference, October 14-15, 2020.
Edited by
Roberto Interdonato
CIRAD, UMR Tetis, Montpellier, France
TETIS, Univ. Montpellier, AgroParisTech, CIRAD, CNRS, INRAE, Montpellier, France
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., Plos One 2021 Vol. 16 No. 7 Article 0254377
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightfor- wardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least- squares additive criterion allows ...
Added: July 22, 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
Switzerland : Springer, 2016
The contributions in this volume cover a broad range of topics including maximum cliques, graph coloring, data mining, brain networks, Steiner forest, logistic and supply chain networks. Network algorithms and their applications to market graphs, manufacturing problems, internet networks and social networks are highlighted. The "Fourth International Conference in Network Analysis," held at the Higher ...
Added: October 24, 2016
Springer, 2021
Complex Networks & Their Applications X
Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021
Editors
(view affiliations)
Rosa Maria Benito
Chantal Cherifi
Hocine Cherifi
Esteban Moro
Luis M. Rocha
Marta Sales-Pardo
Presents the latest research on complex networks and their applications
Gathers the edited proceedings of the Tenth International Conference on Complex Networks and their Applications
Offers state-of-the-art research on complex networks, including various research directions ...
Added: April 19, 2022
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
Miasnikof P., Shestopaloff A., Pitsoulis L. et al., [б.и.], 2020
In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimisation will lead to densely connected clusters. Our thesis is centred on the widely accepted notion that strong ...
Added: October 17, 2020
CEUR Workshop Proceedings, 2020
MARAMI 2020 Modèles & Analyse des Réseaux :
Approches Mathématiques & Informatiques The 11th Conference on Network Modeling and Analysis
MARAMI 2020 14-16 Octobre, Montpellier. ...
Added: November 11, 2020
Shalileh S., Mirkin B., , in : Intelligent Data Engineering and Automated Learning – IDEAL 2020/ 21st International Conference, Guimaraes, Portugal, November 4–6, 2020, Proceedings, Part II. Vol. 12490: Lecture Notes in Computer Science.: Cham : Springer, 2020. P. 413-422.
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: November 14, 2020
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
Aleskerov F. T., Shvydun S., Meshcheryakova N., CRC Press, 2022
Over the last number of years there has been a growing interest in the analysis of complex networks which describe a wide range of real-world systems in nature and society. Identification of the central elements in such networks is one of the key research areas. Solutions to this problem are important for making strategic decisions ...
Added: November 12, 2021
Alina V. Vladimirova, Journal of political power 2022 Vol. 15 No. 3 P. 556-571
Soft power is one of the most influential concepts in the discipline of international relations, yet it is highly criticized for ambiguity and analytical weakness. Thus, through thoughtful literature reviews, scholars continue with clarifying and mapping the theory within a broader political power research programme. It is in this scholarly context that this article offers ...
Added: February 14, 2024
Springer, 2016
This volume provides new insights into the functioning of organizational, managerial and market societies. Multilevel analysis and social network analysis are described and the authors show how they can be combined in developing the theory, methods and empirical applications of the social sciences. This book maps out the development of multilevel reasoning and shows how ...
Added: September 21, 2016
NY : Springer, 2013
This volume contains two types of papers—a selection of contributions from the “Second International Conference in Network Analysis” held in Nizhny Novgorod on May 7–9, 2012, and papers submitted to an "open call for papers" reflecting the activities of LATNA at the Higher School for Economics.
This volume contains many new results in modeling and powerful ...
Added: September 27, 2013
Aleskerov F. T., Meshcheryakova N., Shvydun S. et al., , in : 6th International Conference on Computers Communications and Control (ICCCC) 2016. : Oradea : Agora University, 2016. P. 118-123.
The problem of quick detection of central nodes in large networks is studied. There are many measures that allow to evaluate a topological importance of nodes of the network. Unfortunately, most of them cannot be applied to large networks due to their high computational complexity. However, if we narrow the initial network and apply these ...
Added: June 8, 2016
Kazun A. D., Kazun A., / Высшая школа экономики. Series PS "Political Science". 2017. No. WP BRP 48/PS/2017.
December 19, 2016, saw three tragedies simultaneously, that could not go unnoticed by the Russian media: dozens of people died as a result of a surrogate alcohol poisoning in Irkutsk, a Russian ambassador was killed in Turkey, and a terrorist attack took place at the Christmas market in Berlin. In this article using the network ...
Added: August 11, 2017
Мальков Ю. А., Ponomarenko A., Plos One 2016 Vol. 11 No. 6 P. 1-14
Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of ...
Added: September 9, 2016
Kotlyarevskaya I. V., Knyazeva E. G., Yuzvovich L. I. et al., Integration of Education 2018 Vol. 22 No. 1 P. 8-24
Introduction: the networking as a development practice in business has not yet become widespread. Moreover, there are very few studies of network interactions in the field of science and education. Advances in marketing evaluation of network entities are very rare. The goal of this article is to develop methodological criteria for such an assessment. These ...
Added: October 31, 2019
Shalileh S., Mirkin B., , in : ASONAM '21: Proceedings of the 2021 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. : Association for Computing Machinery (ACM), 2021. P. 138-142.
We derive two extensions of the celebrated K-means algorithm as a tool for community detection in feature-rich networks. We define a data-recovery criterion additively combining conventional least-squares criteria for approximation of the network link data and the feature data at network nodes by a partition along with its within-cluster "centers". The dimension of the space ...
Added: April 19, 2022
de Nooy W., Mrvar A., Batagelj V., Cambridge : Cambridge University Press, 2018
...
Added: November 1, 2018
Aleskerov F. T., Meshcheryakova N., Rezyapova A. et al., , in : Models, Algorithms, and Technologies for Network Analysis. Springer Proceedings in Mathematics & Statistics. Vol. 197.: Springer, 2017. P. 177-185.
Our study employs the network approach to the problem of international migration. During the last years, migration has attracted a lot of attention and has been examined from many points of view. However, very few studies considered it from the network perspective. The international migration can be represented as a network (or weighted directed graph) ...
Added: June 26, 2017
Chepovskiy A., Lakhno A., , in : The 2nd Workshop CUBIST-WS-12 Combining and Uniting Intelligence with Semantic Technologies. : Leuven : [б.и.], 2012. P. 1-9.
Semantic network reduction is considered in application to visual analytics of relational data. Merging structurally equivalent nodes it is straightforward to construct a reduced semantic network that completely species the initial structure of relations between nodes. This paper presents the analysis of such reduction applied to the communication network from Stanford Large Network Dataset Collection. ...
Added: February 1, 2013
Aachen : CEUR Workshop Proceedings, 2015
This volume contains proceedings of the fourth conference on Analysis of Images, Social Networks and Texts (AIST’2015)1 . The first three conferences in 2012–2014 attracted a significant number of students, researchers, academics and engineers working on interdisciplinary data analysis of images, texts, and social networks. The broad scope of AIST makes it an event where ...
Added: October 9, 2015
Aleskerov F. T., Gavrilenkova I., Shvydun S. et al., Group Decision and Negotiation 2020 Vol. 29 No. 3 P. 399-424
Since 9/11, terrorism has become a global issue of the twenty-first century. Terrorist organizations become important actors of world politics as they gain influence on political process and decision-making. Some organizations compete with each other in order to gain more power and influence. We study the distribution of power among terrorist groups using network approach ...
Added: April 19, 2020