scholarly journals A Seed-Expanding Method Based on TOPSIS for Community Detection in Complex Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Jianjun Cheng ◽  
Wenbo Zhang ◽  
Haijuan Yang ◽  
Xing Su ◽  
Tao Ma ◽  
...  
Keyword(s):  
Decision Making ◽  
Community Structure ◽  
Community Detection ◽  
Centrality Measures ◽  
Ideal Solution ◽  
Centrality Measure ◽  
Detection Algorithms ◽  
Pros And Cons ◽  
Topsis Technique

The centrality plays an important role in many community-detection algorithms, which depend on various kinds of centralities to identify seed vertices of communities first and then expand each of communities based on the seeds to get the resulting community structure. The traditional algorithms always use a single centrality measure to recognize seed vertices from the network, but each centrality measure has both pros and cons when being used in this circumstance; hence seed vertices identified using a single centrality measure might not be the best ones. In this paper, we propose a framework which integrates advantages of various centrality measures to identify the seed vertices from the network based on the TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) multiattribute decision-making technology. We take each of the centrality measures involved as an attribute, rank vertices according to the scores which are calculated for them using TOPSIS, and then take vertices with top ranks as the seeds. To put this framework into practice, we concretize it in this paper by considering four centrality measures as attributes to identify the seed vertices of communities first, then expanding communities by iteratively inserting one unclassified vertex into the community to which its most similar neighbor belongs, and the similarity between them is the largest among all pairs of vertices. After that, we obtain the initial community structure. However, the amount of communities might be much more than they should be, and some communities might be too small to make sense. Therefore, we finally consider a postprocessing procedure to merge some initial communities into larger ones to acquire the resulting community structure. To test the effectiveness of the proposed framework and method, we have performed extensive experiments on both some synthetic networks and some real-world networks; the experimental results show that the proposed method can get better results, and the quality of the detected community structure is much higher than those of competitors.

Detecting community structure by belonging intensity analysis of intermediate nodes

2019 ◽  
Vol 30 (11) ◽  
pp. 1950079
Author(s):  
Mengjia Shen ◽  
Dong Lv ◽  
Zhixin Ma
Keyword(s):  
Community Structure ◽  
Communication Networks ◽  
Community Detection ◽  
Real World ◽  
Intensity Analysis ◽  
Human Communication ◽  
Intermediate Node ◽  
Detection Algorithms ◽  
Interactive Behavior

Community structure is a common characteristic of complex networks and community detection is an important methodology to reveal the structure of real-world networks. In recent years, many algorithms have been proposed to detect the high-quality communities in real-world networks. However, these algorithms have shortcomings of performing calculation on the whole network or defining objective function and the number of commonties in advance, which affects the performance and complexity of community detection algorithms. In this paper, a novel algorithm has been proposed to detect communities in networks by belonging intensity analysis of intermediate nodes, named BIAS, which is inspired from the interactive behavior in human communication networks. More specifically, intermediate nodes are middlemen between different groups in social networks. BIAS algorithm defines belonging intensity using local interactions and metrics between nodes, and the belonging intensity of intermediate node in different communities is analyzed to distinguish which community the intermediate node belongs to. The experiments of our algorithm with other state-of-the-art algorithms on synthetic networks and real-world networks have shown that BIAS algorithm has better accuracy and can significantly improve the quality of community detection without prior information.

Spectral Synchronization Reveals Community Structure

2015 ◽  
Vol 719-720 ◽  
pp. 1198-1202
Author(s):  
Ming Yang Zhou ◽  
Zhong Qian Fu ◽  
Zhao Zhuo
Keyword(s):  
Spectral Analysis ◽  
Community Structure ◽  
Community Detection ◽  
Hierarchical Structure ◽  
Edge Density ◽  
Complex Structures ◽  
Detection Algorithms ◽  
Dimension Space ◽  
Local Synchronization ◽  
Better Than

Practical networks have community and hierarchical structure. These complex structures confuse the community detection algorithms and obscure the boundaries of communities. This paper proposes a delicate method which synthesizes spectral analysis and local synchronization to detect communities. Communities emerge automatically in the multi-dimension space of nontrivial eigenvectors. Its performance is compared to that of previous methods and applied to different practical networks. Our results perform better than that of other methods. Besides, it’s more robust for networks whose communities have different edge density and follow various degree distributions. This makes the algorithm a valuable tool to detect and analysis large practical networks with various community structures.

Satisfaction Degree Based Interactive Decision Making under Hesitant Fuzzy Environment with Incomplete Weights

2014 ◽  
Vol 22 (04) ◽  
pp. 553-572 ◽  
Author(s):  
Huchang Liao ◽  
Zeshui Xu
Keyword(s):  
Decision Making ◽  
Hesitant Fuzzy Set ◽  
Optimization Models ◽  
Multi Criteria Decision Making ◽  
Ideal Solution ◽  
Fuzzy Information ◽  
Satisfaction Degree ◽  
Interactive Decision Making ◽  
New Research ◽  
Topsis Technique

Multi-criteria decision making with hesitant fuzzy information is a new research topic since the hesitant fuzzy set was firstly proposed. This paper investigates a multi-criteria decision making problem where the weight information is partially known. We firstly propose the hesitant fuzzy positive ideal solution and the hesitant fuzzy negative ideal solution. Motivated by the TOPSIS (Technique for Order Preference by Similarity to an ideal Solution) method, we definite the satisfaction degree of an alternative, based on which several optimization models are derived to determinate the weights. Subsequently, in order to make a more reasonable decision, we introduce an interactive method based on some optimization models for multi-criteria decision making problems with hesitant fuzzy information. Finally, a practical example on evaluating the service quality of airlines is provided to illustrate our models and method.

scholarly journals A Comparative Study on Decision Making Methods with Interval Data

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Aditya Chauhan ◽  
Rahul Vaish
Keyword(s):  
Decision Making ◽  
Input Data ◽  
Multiple Criteria Decision Making ◽  
Interval Data ◽  
Cross Entropy ◽  
Ideal Solution ◽  
Order Preference ◽  
Topsis Technique ◽  
Selection Of ◽  
Novel Algorithm

Multiple Criteria Decision Making (MCDM) models are used to solve a number of decision making problems universally. Most of these methods require the use of integers as input data. However, there are problems which have indeterminate values or data intervals which need to be analysed. In order to solve problems with interval data, many methods have been reported. Through this study an attempt has been made to compare and analyse the popular decision making tools for interval data problems. Namely, I-TOPSIS (Technique for Order Preference by Similarity to Ideal Solution), DI-TOPSIS, cross entropy, and interval VIKOR (VlseKriterijumska Optimiza-cija I Kompromisno Resenje) have been compared and a novel algorithm has been proposed. The new algorithm makes use of basic TOPSIS technique to overcome the limitations of known methods. To compare the effectiveness of the various methods, an example problem has been used where selection of best material family for the capacitor application has to be made. It was observed that the proposed algorithm is able to overcome the known limitations of the previous techniques. Thus, it can be easily and efficiently applied to various decision making problems with interval data.

scholarly journals Incremental Density-Based Link Clustering Algorithm for Community Detection in Dynamic Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Fanrong Meng ◽  
Feng Zhang ◽  
Mu Zhu ◽  
Yan Xing ◽  
Zhixiao Wang ◽  
...  
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Network Topology ◽  
Clustering Algorithm ◽  
Dynamic Networks ◽  
Experimental Results ◽  
Extended Version ◽  
High Quality ◽  
Detection Algorithms

Community detection in complex networks has become a research hotspot in recent years. However, most of the existing community detection algorithms are designed for the static networks; namely, the connections between the nodes are invariable. In this paper, we propose an incremental density-based link clustering algorithm for community detection in dynamic networks, iDBLINK. This algorithm is an extended version of DBLINK which is proposed in our previous work. It can update the local link community structure in the current moment through the change of similarity between the edges at the adjacent moments, which includes the creation, growth, merging, deletion, contraction, and division of link communities. Extensive experimental results demonstrate that iDBLINK not only has a great time efficiency, but also maintains a high quality community detection performance when the network topology is changing.

scholarly journals Decomposition-Based Multiobjective Evolutionary Algorithm for Community Detection in Dynamic Social Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-22 ◽  
Author(s):  
Jingjing Ma ◽  
Jie Liu ◽  
Wenping Ma ◽  
Maoguo Gong ◽  
Licheng Jiao
Keyword(s):  
Social Networks ◽  
Community Structure ◽  
Evolutionary Algorithm ◽  
Community Detection ◽  
Dynamic Networks ◽  
Time Step ◽  
Current Time ◽  
Multiobjective Evolutionary Algorithm ◽  
Dynamic Social Networks

Community structure is one of the most important properties in social networks. In dynamic networks, there are two conflicting criteria that need to be considered. One is the snapshot quality, which evaluates the quality of the community partitions at the current time step. The other is the temporal cost, which evaluates the difference between communities at different time steps. In this paper, we propose a decomposition-based multiobjective community detection algorithm to simultaneously optimize these two objectives to reveal community structure and its evolution in dynamic networks. It employs the framework of multiobjective evolutionary algorithm based on decomposition to simultaneously optimize the modularity and normalized mutual information, which quantitatively measure the quality of the community partitions and temporal cost, respectively. A local search strategy dealing with the problem-specific knowledge is incorporated to improve the effectiveness of the new algorithm. Experiments on computer-generated and real-world networks demonstrate that the proposed algorithm can not only find community structure and capture community evolution more accurately, but also be steadier than the two compared algorithms.

scholarly journals APLEISTŲ PASTATŲ RACIONALAUS NAUDOJIMO MODELIAVIMAS TAIKANT GEOINFORMACINES SISTEMAS

2012 ◽  
Vol 31 (4) ◽  
pp. 129-133 ◽  
Author(s):  
Jurgita Antuchevičienė
Keyword(s):  
Decision Making ◽  
Ideal Solution ◽  
Order Preference ◽  
Multi Attribute Decision Making ◽  
Topsis Technique

Priimant erdvinius sprendimus geografinių informacinių sistemų (GIS) galimybės taikomos apleistų pastatų racionalaus naudojimo problemoms aplinkos ir visuomenės darnos požiūriu spręsti. Pasiūlytas pradinių duomenų parengimo ir jų taikymo skaičiavimams daugiatiksliais sprendimų priėmimo (Multi-attribute Decision Making – MADM) metodais modelis. Pateikta apleistų pastatų duomenų bazės struktūra ir parengtas šios bazės pildymo duomenimis apie nenaudojamus Lietuvos kaimo statinius pavyzdys. Sudaryti darnią ūkio plėtrą šalyje nusakančių socialinių, ekonominių ir aplinkos rodiklių sluoksniai. Numatytos duomenų analizės galimybės. Pateiktas GIS ir daugiatikslio sprendimų priėmimo metodo TOPSIS (Technique for the Order Preference by Similarity to Ideal Solution) integravimo racionaliam apleistų pastatų Lietuvos kaimo vietovėse naudojimui modeliuoti pavyzdys.

Development of TOPSIS Method to Solve Complicated Decision-Making Problems — An Overview on Developments from 2000 to 2015

2016 ◽  
Vol 15 (03) ◽  
pp. 645-682 ◽  
Author(s):  
Edmundas Kazimieras Zavadskas ◽  
Abbas Mardani ◽  
Zenonas Turskis ◽  
Ahmad Jusoh ◽  
Khalil MD Nor
Keyword(s):  
Decision Making ◽  
Real World ◽  
Ideal Solution ◽  
Topsis Method ◽  
The Real ◽  
Recent Developments ◽  
Topsis Approach ◽  
Topsis Technique

In recent years several previous scholars made attempts to develop, extend, propose and apply Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) for solving problems in decision making issues. Indeed, there are questions, how TOPSIS can help for solving these problems? Or does TOPSIS solved decision making problems in the real world? Therefore, this study shows the recent developments of TOPSIS approach which are presented by previous scholars. To achieve this objective, there are 105 reviewed papers which developed, extended, proposed and presented TOPSIS approach for solving DM problems. The results of the study indicated that 49 scholars have extended or developed TOPSIS technique and 56 scholars have proposed or presented new modifications for problems solution related to TOPSIS technique from 2000 to 2015. In addition, results of this study indicated that, previous studies have modifications related to this technique in 2011 more than other years.

Enhancing betweenness algorithm for detecting communities in complex networks

2014 ◽  
Vol 28 (09) ◽  
pp. 1450074 ◽  
Author(s):  
Benyan Chen ◽  
Ju Xiang ◽  
Ke Hu ◽  
Yi Tang
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Community Detection ◽  
Real World ◽  
Topological Property ◽  
Edge Weight ◽  
Detection Algorithms ◽  
Improved Algorithm

Community structure is an important topological property common to many social, biological and technological networks. First, by using the concept of the structural weight, we introduced an improved version of the betweenness algorithm of Girvan and Newman to detect communities in networks without (intrinsic) edge weight and then extended it to networks with (intrinsic) edge weight. The improved algorithm was tested on both artificial and real-world networks, and the results show that it can more effectively detect communities in networks both with and without (intrinsic) edge weight. Moreover, the technique for improving the betweenness algorithm in the paper may be directly applied to other community detection algorithms.

Active semisupervised community detection based on asymmetric similarity measure

2015 ◽  
Vol 29 (13) ◽  
pp. 1550078 ◽  
Author(s):  
Mingwei Leng ◽  
Liang Huang ◽  
Longjie Li ◽  
Hanhai Zhou ◽  
Jianjun Cheng ◽  
...  
Keyword(s):  
Community Structure ◽  
Prior Knowledge ◽  
Complex Network ◽  
Community Detection ◽  
Detection Algorithm ◽  
Directed Network ◽  
Detection Algorithms ◽  
Community Detection Algorithm ◽  
Similarity Method ◽  
Asymmetric Similarity

Semisupervised community detection algorithms use prior knowledge to improve the performance of discovering the community structure of a complex network. However, getting those prior knowledge is quite expensive and time consuming in many real-world applications. This paper proposes an active semisupervised community detection algorithm based on the similarities between nodes. First, it transforms a given complex network into a weighted directed network based on the proposed asymmetric similarity method, some informative nodes are selected to be the labeled nodes by using an active mechanism. Second, the proposed algorithm discovers the community structure of a complex network by propagating the community labels of labeled nodes to their neighbors based on the similarity between a node and a community. Finally, the performance of the proposed algorithm is evaluated with three real networks and one synthetic network and the experimental results show that the proposed method has a better performance compared with some other community detection algorithms.

Sign in / Sign up

Export Citation Format

Share Document