Joint Classification with Heterogeneous Labels Using Random Walk with Dynamic Label Propagation

Author(s):  
Yongxin Liao ◽  
Shenxi Yuan ◽  
Jian Chen ◽  
Qingyao Wu ◽  
Bin Li
2020 ◽  
Vol 58 (10) ◽  
pp. 7355-7370 ◽  
Author(s):  
Xudong Zhao ◽  
Ran Tao ◽  
Wei Li ◽  
Heng-Chao Li ◽  
Qian Du ◽  
...  

2017 ◽  
Vol 31 (14) ◽  
pp. 1750162 ◽  
Author(s):  
Tianren Ma ◽  
Zhengyou Xia

Currently, with the rapid development of information technology, the electronic media for social communication is becoming more and more popular. Discovery of communities is a very effective way to understand the properties of complex networks. However, traditional community detection algorithms consider the structural characteristics of a social organization only, with more information about nodes and edges wasted. In the meanwhile, these algorithms do not consider each node on its merits.Label propagation algorithm (LPA) is a near linear time algorithm which aims to find the community in the network. It attracts many scholars owing to its high efficiency. In recent years, there are more improved algorithms that were put forward based on LPA. In this paper, an improved LPA based on random walk and node importance (NILPA) is proposed. Firstly, a list of node importance is obtained through calculation. The nodes in the network are sorted in descending order of importance. On the basis of random walk, a matrix is constructed to measure the similarity of nodes and it avoids the random choice in the LPA. Secondly, a new metric IAS (importance and similarity) is calculated by node importance and similarity matrix, which we can use to avoid the random selection in the original LPA and improve the algorithm stability.Finally, a test in real-world and synthetic networks is given. The result shows that this algorithm has better performance than existing methods in finding community structure.


2019 ◽  
Author(s):  
Gabriel Barbosa Fonseca ◽  
Zenilton K. G. Patrocínio Jr ◽  
Guillaume Gravier ◽  
Silvio Jamil F. Guimarães

The indexing of large datasets is a task of great importance, since it directly impacts on the quality of information that can be retrieved from these sets. Unfortunately, some datasets are growing in size so fast that manually indexing becomes unfeasible. Automatic indexing techniques can be applied to overcome this issue, and in this study, a unsupervised technique for multimodal person discovery is proposed, which consists in detecting persons that are appearing and speaking simultaneously on a video and associating names to them. To achieve that, the data is modeled as a graph of speaking-faces, and names are extracted via OCR and propagated through the graph based on audiovisual relations between speaking faces. To propagate labels, two graph based methods are proposed, one based on random walks and the other based on a hierarchical approach. In order to assess the proposed approach, we use two graph clustering baselines, and different modality fusion approaches. On the MediaEval MPD 2017 dataset, the proposed label propagation methods outperform all literature methods except one, which uses a different approach on the pre-processing step. Even though the Kappa coefficient indicates that the random walk and the hierarchical label propagation produce highly equivalent results, the hierarchical propagation is more than 6 times faster than the random walk under same configurations.


2021 ◽  
Vol 18 (2) ◽  
pp. 1609-1628
Author(s):  
Meili Tang ◽  
◽  
Qian Pan ◽  
Yurong Qian ◽  
Yuan Tian ◽  
...  

2016 ◽  
Vol 30 (16) ◽  
pp. 1650093 ◽  
Author(s):  
Xian-Kun Zhang ◽  
Chen Song ◽  
Jia Jia ◽  
Zeng-Lei Lu ◽  
Qian Zhang

Community detection based on label propagation algorithm (LPA) has attracted widespread concern because of its high efficiency. But it is difficult to guarantee the accuracy of community detection as the label spreading is random in the algorithm. In response to the problem, an improved LPA based on random walk (RWLPA) is proposed in this paper. Firstly, a matrix measuring similarity among various nodes in the network is obtained through calculation. Secondly, during the process of label propagation, when a node has more than a neighbor label with the highest frequency, not the label of a random neighbor but the label of the neighbor with the highest similarity will be chosen to update. It can avoid label propagating randomly among communities. Finally, we test LPA and the improved LPA in benchmark networks and real-world networks. The results show that the quality of communities discovered by the improved algorithm is improved compared with the traditional algorithm.


Author(s):  
Joseph Rudnick ◽  
George Gaspari
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document