Structural outlier detection: A tourist walk approach

Rodrigues, Rafael de Aguiar; Zhao, Liang; Zheng, Qian; Zhang, Junbao

doi:10.1109/fskd.2017.8393299

Cited by 2 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the SCL model, methods for detecting and preventing false labels had been proposed [36]. Since then, outlier detection [37], image segmentation [38], classification number prediction [39] and other problems can be solved by the particle competition mechanism. In 2018, particle random walking was applied to the semi-supervised node classification and the positive-class pertinence level of each sample was rated by the extreme probability of particle walking [40].…”

Section: Introductionmentioning

confidence: 99%

Particle Propagation Model for Dynamic Node Classification

Yin

Yuan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

With the popularity of online social networks, researches on dynamic node classification have received further attention. Dynamic node classification also helps the rapid popularization of online social networks. This paper proposes a particle competition model named DPP to complete the dynamic node classification. Existing node classification models based on particle competition do not perform well in terms of accuracy. Hence, we formulate a unique particle competition framework to make the node classification more effective. In addition, for applying the model in the dynamic network, based on the dynamic characteristics of the model, we have added an automatic update strategy of the source node to the model. The particles in the new model perform the steps of walking, splitting, and jumping according to the method introduced in this paper. Then, the domination matrix of the network has been changed with particle movements continuously. Although the particles randomly walk at the micro-level, the model can converge to obtain the node classification results. Finally, simulation results show both the effectiveness and superiority of our proposed node classification model with the comparison of other major particle competition models and dynamic node classification methods. Based on the above contributions, the proposed model may have compelling applications in the context of community detection and network embedding, etc. INDEX TERMS Complex network, particle competition, dynamic node classification.

show abstract

Section: Introductionmentioning

confidence: 99%

Particle Propagation Model for Dynamic Node Classification

Yin

Yuan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

SSPCO: A new particle propagation model for community detection in complex network

Wang

Zheng

2022

Mod. Phys. Lett. B

View full text Add to dashboard Cite

Community detection is of extraordinary significance in comprehending the structure and functions of complex networks. The particle competition algorithm is a quick and heuristic algorithm when applied to community detection. However, existing particle competition algorithms do not make full use of all information of networks and have several shortcomings such as poor robustness, weak stability, and low accuracy. In addition, it cannot be effectively applied to overlapping community detection. In this paper, a new particle propagation model with semi-supervised learning for community detection in social networks (SSPCO) is proposed. SSPCO divides the formation process of communities into the initialization phase, walking phase, restart phase, convergence phase and overlapping community detection phase. In the initialization phase, each team of labeled vertices generates a particle of this team. The domination level of each team particles at vertices and edges is also initialized in this phase. In the walking phase, the particle walks to one of the neighbors of the current vertex based on the proposed walking probability calculated by the proposed transfer acceptance probability and the proposed transfer proposal probability. In the process of particle walking, the particle has a possibility of entering the restart phase. The proposed restart probability determines whether the particle performs the restart mechanism. If the particle decides to restart, it will select a vertex for restart based on the domination level of this team particles at vertices. Otherwise, it continues to walk. After several particle walking and restart phases, the particle meets the convergence state. In the convergence phase, if all particles meet the proposed convergence condition, we will obtain community partition results based on the domination level of each team particles at the vertex. In the overlapping community detection phase, we can obtain overlapping community partition results based on the overlapping community detection mechanism. Experiment results reveal that SSPCO can improve the stability and accuracy of detecting communities. Moreover, SSPCO runs in near-linear time complexity, which allows it to be applied in large-sized networks.

show abstract

Structural outlier detection: A tourist walk approach

Cited by 2 publications

References 19 publications

Particle Propagation Model for Dynamic Node Classification

Particle Propagation Model for Dynamic Node Classification

SSPCO: A new particle propagation model for community detection in complex network

Contact Info

Product

Resources

About