scholarly journals ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 367
Author(s):  
Héctor Muñoz ◽  
Eloy Vicente ◽  
Ignacio González ◽  
Alfonso Mateos ◽  
Antonio Jiménez-Martín
Keyword(s):  
Computer Vision ◽  
Community Detection ◽  
Real World ◽  
Line Graph ◽  
New Method ◽  
Weighted Graphs ◽  
Original Graph ◽  
World Export ◽  
Common Technique

This paper proposes a new method, ConvGraph, to detect communities in highly cohesive and isolated weighted graphs, where the sum of the weights is significantly higher inside than outside the communities. The method starts by transforming the original graph into a line graph to apply a convolution, a common technique in the computer vision field. Although this technique was originally conceived to detect the optimum edge in images, it is used here to detect the optimum edges in communities identified by their weights rather than by their topology. The method includes a final refinement step applied to communities with a high vertex density that could not be detected in the first phase. The proposed algorithm was tested on a series of highly cohesive and isolated synthetic graphs and on a real-world export graph, performing well in both cases.

Uncovering local community structure on line graph through degree centrality and expansion

2021 ◽  
pp. 2150120
Author(s):  
Guishen Wang ◽  
Kaitai Wang ◽  
Hongmei Wang ◽  
Huimin Lu ◽  
Xiaotang Zhou ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Local Community ◽  
Line Graph ◽  
Detection Methods ◽  
Degree Centrality ◽  
Original Graph ◽  
Normalized Mutual Information ◽  
Local Community Detection ◽  
On Line

Local community detection algorithms are an important type of overlapping community detection methods. Local community detection methods identify local community structure through searching seeds and expansion process. In this paper, we propose a novel local community detection method on line graph through degree centrality and expansion (LCDDCE). We firstly employ line graph model to transfer edges into nodes of a new graph. Secondly, we evaluate edges relationship through a novel node similarity method on line graph. Thirdly, we introduce local community detection framework to identify local node community structure of line graph, combined with degree centrality and PageRank algorithm. Finally, we transfer them back into original graph. The experimental results on three classical benchmarks show that our LCDDCE method achieves a higher performance on normalized mutual information metric with other typical methods.

Link community detection based on ensemble learning

2020 ◽  
Vol 34 (27) ◽  
pp. 2050293
Author(s):  
Zhihua Liu ◽  
Hongmei Wang ◽  
Guishen Wang ◽  
Yu Zhou
Keyword(s):  
Ensemble Learning ◽  
Community Detection ◽  
Clustering Algorithm ◽  
Line Graph ◽  
Distance Matrix ◽  
Original Graph ◽  
Overlapping Communities ◽  
Normalized Mutual Information ◽  
Pca Method ◽  
Overlapping Community

Overlapping community detection is a hot topic in the research of data mining and graph theory. In this paper, we propose a link community detection method based on ensemble learning (LCDEL). First, we transform graph into line graph and construct node adjacency matrix of line graph. Second, we calculate node distance of line graph through a new distance metric and get node distance matrix of line graph. Third, we use PCA method to reduce dimensions of node distance matrix of line graph. Then, we cluster on the reduced node distance matrix by k-means clustering algorithm. Finally, we convert line graph back into original graph and get overlapping communities of original graph with ensemble learning. Experimental results on several real-world networks demonstrate effectiveness of LCDEL method in terms of Normalized Mutual Information (NMI), Extended Modularity (EQ) and F-score evaluation metrics.

scholarly journals A FRAMEWORK FOR COMMUNITY DETECTION IN HETEROGENEOUS MULTI-RELATIONAL NETWORKS

2014 ◽  
Vol 17 (06) ◽  
pp. 1450018 ◽  
Author(s):  
XIN LIU ◽  
WEICHU LIU ◽  
TSUYOSHI MURATA ◽  
KEN WAKITA
Keyword(s):  
Community Detection ◽  
Real World ◽  
State Of The Art ◽  
General Structure ◽  
The State ◽  
New Method ◽  
World Systems ◽  
Relational Networks ◽  
Relational Network ◽  
Art Techniques

There has been a surge of interest in community detection in homogeneous single-relational networks which contain only one type of nodes and edges. However, many real-world systems are naturally described as heterogeneous multi-relational networks which contain multiple types of nodes and edges. In this paper, we propose a new method for detecting communities in such networks. Our method is based on optimizing the composite modularity, which is a new modularity proposed for evaluating partitions of a heterogeneous multi-relational network into communities. Our method is parameter-free, scalable, and suitable for various networks with general structure. We demonstrate that it outperforms the state-of-the-art techniques in detecting pre-planted communities in synthetic networks. Applied to a real-world Digg network, it successfully detects meaningful communities.

scholarly journals Improving skeleton algorithm for helping Caenorhabditis elegans trackers

2020 ◽  
Vol 10 (1) ◽  
Author(s):  
Pablo E. Layana Castro ◽  
Joan Carles Puchalt ◽  
Antonio-José Sánchez-Salmerón
Keyword(s):  
Computer Vision ◽  
Caenorhabditis Elegans ◽  
Transformation Function ◽  
Simple Solution ◽  
New Method ◽  
Vision Systems ◽  
Distance Transformation ◽  
Automatic Computer ◽  
C Elegans ◽  
Computer Vision Systems

AbstractOne of the main problems when monitoring Caenorhabditis elegans nematodes (C. elegans) is tracking their poses by automatic computer vision systems. This is a challenge given the marked flexibility that their bodies present and the different poses that can be performed during their behaviour individually, which become even more complicated when worms aggregate with others while moving. This work proposes a simple solution by combining some computer vision techniques to help to determine certain worm poses and to identify each one during aggregation or in coiled shapes. This new method is based on the distance transformation function to obtain better worm skeletons. Experiments were performed with 205 plates, each with 10, 15, 30, 60 or 100 worms, which totals 100,000 worm poses approximately. A comparison of the proposed method was made to a classic skeletonisation method to find that 2196 problematic poses had improved by between 22% and 1% on average in the pose predictions of each worm.

scholarly journals Overlapping Community Detection Based on Attribute Augmented Graph

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 680
Author(s):  
Hanyang Lin ◽  
Yongzhao Zhan ◽  
Zizheng Zhao ◽  
Yuzhong Chen ◽  
Chen Dong
Keyword(s):  
Community Detection ◽  
Real World ◽  
Detection Algorithm ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Adjustment Strategy ◽  
Topology Information ◽  
Overlapping Community ◽  
Real World Datasets ◽  
Community Detection Algorithm

There is a wealth of information in real-world social networks. In addition to the topology information, the vertices or edges of a social network often have attributes, with many of the overlapping vertices belonging to several communities simultaneously. It is challenging to fully utilize the additional attribute information to detect overlapping communities. In this paper, we first propose an overlapping community detection algorithm based on an augmented attribute graph. An improved weight adjustment strategy for attributes is embedded in the algorithm to help detect overlapping communities more accurately. Second, we enhance the algorithm to automatically determine the number of communities by a node-density-based fuzzy k-medoids process. Extensive experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively detect overlapping communities with fewer parameters compared to the baseline methods.

scholarly journals LPA-MNI: An Improved Label Propagation Algorithm Based on Modularity and Node Importance for Community Detection

Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 497
Author(s):  
Huan Li ◽  
Ruisheng Zhang ◽  
Zhili Zhao ◽  
Xin Liu
Keyword(s):  
Community Detection ◽  
Real World ◽  
Label Propagation ◽  
Node Importance ◽  
Propagation Algorithm ◽  
Synthetic Networks

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.

A New Method for Railway Fastener Detection Using the Symmetrical Image and Its EA-HOG Feature

2019 ◽  
Vol 34 (02) ◽  
pp. 2055006
Author(s):  
Jiajia Liu ◽  
Jianying Yuan ◽  
Yongfang Jia
Keyword(s):  
Computer Vision ◽  
Sparse Representation ◽  
Efficient Method ◽  
Important Task ◽  
New Method ◽  
Automatic Inspection ◽  
Test Image ◽  
Recognition Result ◽  
The Status ◽  
Railway Operation

Railway fastener recognition and detection is an important task for railway operation safety. However, the current automatic inspection methods based on computer vision can effectively detect the intact or completely missing fasteners, but they have weaker ability to recognize the partially worn ones. In our method, we exploit the EA-HOG feature fastener image, generate two symmetrical images of original test image and turn the detection of the original test image into the detection of two symmetrical images, then integrate the two recognition results of symmetrical image to reach exact recognition of original test image. The potential advantages of the proposed method are as follows: First, we propose a simple yet efficient method to extract the fastener edge, as well as the EA-HOG feature of the fastener image. Second, the symmetry images indeed reflect some possible appearance of the fastener image which are not shown in the original images, these changes are helpful for us to judge the status of the symmetry samples based on the improved sparse representation algorithm and then obtain an exact judgment of the original test image by combining the two corresponding judgments of its symmetry images. The experiment results show that the proposed approach achieves a rather high recognition result and meets the demand of railway fastener detection.

An algorithm Walktrap-SPM for detecting overlapping community structure

2017 ◽  
Vol 31 (15) ◽  
pp. 1750121 ◽  
Author(s):  
Fang Hu ◽  
Youze Zhu ◽  
Yuan Shi ◽  
Jianchao Cai ◽  
Luogeng Chen ◽  
...  
Keyword(s):  
Community Structure ◽  
Random Walk ◽  
Community Detection ◽  
Real World ◽  
Overlapping Community Detection ◽  
Overlapping Communities ◽  
Running Time ◽  
Overlapping Community ◽  
Negative Links ◽  
Novel Algorithm

In this paper, based on Walktrap algorithm with the idea of random walk, and by selecting the neighbor communities, introducing improved signed probabilistic mixture (SPM) model and considering the edges within the community as positive links and the edges between the communities as negative links, a novel algorithm Walktrap-SPM for detecting overlapping community is proposed. This algorithm not only can identify the overlapping communities, but also can greatly increase the objectivity and accuracy of the results. In order to verify the accuracy, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks based on LFR benchmark. The experimental results indicate that this algorithm can identify the communities accurately, and it is more suitable for overlapping community detection. Compared with Walktrap, SPM and LMF algorithms, the presented algorithm can acquire higher values of modularity and NMI. Moreover, this new algorithm has faster running time than SPM and LMF algorithms.

Study on the Structural Model of Human Pose

2013 ◽  
Vol 464 ◽  
pp. 387-390
Author(s):  
Wei Hua Wang
Keyword(s):  
Computer Vision ◽  
Human Behavior ◽  
Structural Model ◽  
New Method ◽  
Domain Modeling ◽  
Key Technology ◽  
Broad Application ◽  
Structural Relation ◽  
Human Pose ◽  
Human Image

The analysis and understand of human behavior is broad application in the computer vision domain, modeling the human pose is one of the key technology. In order to simplify the model of the human pose and expediently describe the human pose, a lot of condition was appended to confine the process of human pose modeling or the application environments in the current research. In this paper, a new method for modeling the human pose was proposed. The human pose was modeled by the structural relation according to the physiological structural, the advantages of the model are the independent of move, the independent of scale of the human image and the dependent of view angle, it can be used to modeling the human behavior in video.

scholarly journals Deep learning-enabled medical computer vision

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Andre Esteva ◽  
Katherine Chou ◽  
Serena Yeung ◽  
Nikhil Naik ◽  
Ali Madani ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Neural Networks ◽  
Computer Vision ◽  
Deep Learning ◽  
Medical Imaging ◽  
Real World ◽  
Recent Progress ◽  
Medical Applications ◽  
Modern Computer ◽  
Medical Computer

AbstractA decade of unprecedented progress in artificial intelligence (AI) has demonstrated the potential for many fields—including medicine—to benefit from the insights that AI techniques can extract from data. Here we survey recent progress in the development of modern computer vision techniques—powered by deep learning—for medical applications, focusing on medical imaging, medical video, and clinical deployment. We start by briefly summarizing a decade of progress in convolutional neural networks, including the vision tasks they enable, in the context of healthcare. Next, we discuss several example medical imaging applications that stand to benefit—including cardiology, pathology, dermatology, ophthalmology–and propose new avenues for continued work. We then expand into general medical video, highlighting ways in which clinical workflows can integrate computer vision to enhance care. Finally, we discuss the challenges and hurdles required for real-world clinical deployment of these technologies.

Sign in / Sign up

Export Citation Format

Share Document