scholarly journals Two-Stage User Identification Based on User Topology Dynamic Community Clustering

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Jiajing Zhang ◽  
Zhenhua Yuan ◽  
Neng Xu ◽  
Jinlan Chen ◽  
Juxiang Wang

In order to solve the problem of node information loss during user matching in the existing user identification method of fixed community across the social network based on user topological relationship, Two-Stage User Identification Based on User Topology Dynamic Community Clustering (UIUTDC) algorithm is proposed. Firstly, we perform community clustering on different social networks, calculate the similarity between different network communities, and screen out community pairs with greater similarity. Secondly, two-way marriage matching is carried out for users between pairs of communities with high similarity. Then, the dynamic community clustering was performed by resetting the different community clustering numbers. Finally, the iteration is repeated until no new matching user pairs are generated, or the set number of iterations is reached. Experiments conducted on real-world social networks Twitter-Foursquare datasets demonstrate that compared with the global user matching method and hidden label node method, the average accuracy of the proposed UIUTDC algorithm is improved by 33% and 26.8%, respectively. In the case of only user topology information, the proposed UIUTDC algorithm effectively improves the accuracy of identity recognition in practical applications.

2016 ◽  
Vol 44 (3) ◽  
pp. 377-391 ◽  
Author(s):  
Azadeh Esfandyari ◽  
Matteo Zignani ◽  
Sabrina Gaito ◽  
Gian Paolo Rossi

To take advantage of the full range of services that online social networks (OSNs) offer, people commonly open several accounts on diverse OSNs where they leave lots of different types of profile information. The integration of these pieces of information from various sources can be achieved by identifying individuals across social networks. In this article, we address the problem of user identification by treating it as a classification task. Relying on common public attributes available through the official application programming interface (API) of social networks, we propose different methods for building negative instances that go beyond usual random selection so as to investigate the effectiveness of each method in training the classifier. Two test sets with different levels of discrimination are set up to evaluate the robustness of our different classifiers. The effectiveness of the approach is measured in real conditions by matching profiles gathered from Google+, Facebook and Twitter.


2022 ◽  
Vol 24 (3) ◽  
pp. 0-0

In this digital era, people are very keen to share their feedback about any product, services, or current issues on social networks and other platforms. A fine analysis of these feedbacks can give a clear picture of what people think about a particular topic. This work proposed an almost unsupervised Aspect Based Sentiment Analysis approach for textual reviews. Latent Dirichlet Allocation, along with linguistic rules, is used for aspect extraction. Aspects are ranked based on their probability distribution values and then clustered into predefined categories using frequent terms with domain knowledge. SentiWordNet lexicon uses for sentiment scoring and classification. The experiment with two popular datasets shows the superiority of our strategy as compared to existing methods. It shows the 85% average accuracy when tested on manually labeled data.


Author(s):  
Amany A. Naem ◽  
Neveen I. Ghali

Antlion Optimization (ALO) is one of the latest population based optimization methods that proved its good performance in a variety of applications. The ALO algorithm copies the hunting mechanism of antlions to ants in nature. Community detection in social networks is conclusive to understanding the concepts of the networks. Identifying network communities can be viewed as a problem of clustering a set of nodes into communities. k-median clustering is one of the popular techniques that has been applied in clustering. The problem of clustering network can be formalized as an optimization problem where a qualitatively objective function that captures the intuition of a cluster as a set of nodes with better in ternal connectivity than external connectivity is selected to be optimized. In this paper, a mixture antlion optimization and k-median for solving the community detection problem is proposed and named as K-median Modularity ALO. Experimental results which are applied on real life networks show the ability of the mixture antlion optimization and k-median to detect successfully an optimized community structure based on putting the modularity as an objective function.


2021 ◽  
Author(s):  
Xueye Chen ◽  
Yaolong Zhang

Abstract Microfluidic technology has great advantages in the precise manipulation of micro and nano particles, and the collection method of micro and nano particles based on ultrasonic standing waves has attracted much attention for its high efficiency and simplicity of structure. This paper proposes a two-stage particle separation channel using ultrasound. In the microfluidic channel, two different sound pressure regions are used to achieve the separation of particles with positive acoustic contrast factors. Through numerical simulation, the performance of three common piezoelectric substrate materials was compared qualitatively and quantitatively, and it was found that the output sound pressure intensity of 128°YX-LiNbO3 was high and the output was stable. At the same time, the influence of the number of electrode pairs of the interdigital transducer and the electrode voltage on the output sound wave is studied. Finally, 15 pairs of electrode pairs are selected, and the electrode voltages of the two sound pressure regions are 2.0V and 3.0V respectively. After selecting the corresponding parameters, the separation process was numerically simulated, and the separation of three kinds of particles was successfully achieved. This work has laid a certain theoretical foundation for rapid disease diagnosis and real-time monitoring of the environment in practical applications.


2018 ◽  
Vol 29 (08) ◽  
pp. 1850068 ◽  
Author(s):  
Yaming Zhang ◽  
Yanyuan Su ◽  
Weigang Li ◽  
Haiou Liu

Rumor propagation and refutation form an important issue for spreading dynamics in online social networks (OSNs). In this paper, we introduce a novel two-stage rumor propagation and refutation model with time effect for OSNs. The dynamical mechanism of rumor propagation and refutation with time effect is investigated deeply. Then a two-stage model and the corresponding mean-field equations in both homogeneous and heterogeneous networks are obtained. Monte Carlo simulations are conducted to characterize the dynamics of rumor propagation and refutation in both Watts–Strogatz network and Barabási–Albert network. The results show that heterogeneous networks yield the most effective rumor and anti-rumor spreading. Besides, the sooner authority releases anti-rumor and the more attractive anti-rumor is, the less rumor influence is. What’s more, these findings suggest that individuals’ ability to control themselves and identify rumor accurately should be improved to reduce negative impact of rumor effectively. The results are helpful to understand better the mechanism of rumor propagation and refutation in OSNs.


Sign in / Sign up

Export Citation Format

Share Document