scholarly journals Approximate Graph Propagation

Author(s):  
Hanzhi Wang ◽  
Mingguo He ◽  
Zhewei Wei ◽  
Sibo Wang ◽  
Ye Yuan ◽  
...  
Keyword(s):  
2014 ◽  
Vol 21 (3) ◽  
pp. 267-275 ◽  
Author(s):  
Jinhui Tang ◽  
Minxian Li ◽  
Zechao Li ◽  
Chunxia Zhao

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Ling Zhu ◽  
Derek F. Wong ◽  
Lidia S. Chao

This paper presents a novel approach for unsupervised shallow parsing model trained on the unannotated Chinese text of parallel Chinese-English corpus. In this approach, no information of the Chinese side is applied. The exploitation of graph-based label propagation for bilingual knowledge transfer, along with an application of using the projected labels as features in unsupervised model, contributes to a better performance. The experimental comparisons with the state-of-the-art algorithms show that the proposed approach is able to achieve impressive higher accuracy in terms ofF-score.


2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Jinlong Hu ◽  
Junjie Liang ◽  
Shoubin Dong

Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of mobile advertising user’s behavior and identify two persistent patterns: power law distribution and pertinence and propose an automatic initial score learning algorithm to formulate both concepts to learn the initial scores of non-seed nodes. We propose a weighted graph propagation algorithm to propagate the scores of all nodes in the user-app bipartite graphs until convergence. To extend our approach for large-scale settings, we decompose the objective function of the initial score learning model into separate one-dimensional problems and parallelize the whole approach on an Apache Spark cluster. iBGP was applied on a large synthetic dataset and a large real-world mobile advertising dataset; experiment results demonstrate that iBGP significantly outperforms other popular graph-based propagation methods.


Author(s):  
Zhiwei Jiang ◽  
Meng Liu ◽  
Yafeng Yin ◽  
Hua Yu ◽  
Zifeng Cheng ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (10) ◽  
pp. 3471
Author(s):  
Chonghao Chen ◽  
Jianming Zheng ◽  
Honghui Chen

Fact verification aims to verify the authenticity of a given claim based on the retrieved evidence from Wikipedia articles. Existing works mainly focus on enhancing the semantic representation of evidence, e.g., introducing the graph structure to model the evidence relation. However, previous methods can’t well distinguish semantic-similar claims and evidences with distinct authenticity labels. In addition, the performances of graph-based models are limited by the over-smoothing problem of graph neural networks. To this end, we propose a graph-based contrastive learning method for fact verification abbreviated as CosG, which introduces a contrastive label-supervised task to help the encoder learn the discriminative representations for different-label claim-evidence pairs, as well as an unsupervised graph-contrast task, to alleviate the unique node features loss in the graph propagation. We conduct experiments on FEVER, a large benchmark dataset for fact verification. Experimental results show the superiority of our proposal against comparable baselines, especially for the claims that need multiple-evidences to verify. In addition, CosG presents better model robustness on the low-resource scenario.


Sign in / Sign up

Export Citation Format

Share Document