CS- and GA-based hybrid evolutionary sampling algorithm for large-scale social networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Seyed Mohsen Ebadi Jokandan ◽  
Peyman Bayat ◽  
Mehdi Farrokhbakht Foumani
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Sampling Algorithm

scholarly journals Stacked Community Prediction: A Distributed Stacking-Based Community Extraction Methodology for Large Scale Social Networks

2021 ◽  
Vol 5 (1) ◽  
pp. 14
Author(s):  
Christos Makris ◽  
Georgios Pispirigos
Keyword(s):  
Social Networks ◽  
Graph Partitioning ◽  
Large Scale ◽  
Real Life ◽  
Information Networks ◽  
Digital Marketing ◽  
Partitioning Problems ◽  
Iterative Solutions ◽  
Community Extraction ◽  
Stability And Accuracy

Nowadays, due to the extensive use of information networks in a broad range of fields, e.g., bio-informatics, sociology, digital marketing, computer science, etc., graph theory applications have attracted significant scientific interest. Due to its apparent abstraction, community detection has become one of the most thoroughly studied graph partitioning problems. However, the existing algorithms principally propose iterative solutions of high polynomial order that repetitively require exhaustive analysis. These methods can undoubtedly be considered resource-wise overdemanding, unscalable, and inapplicable in big data graphs, such as today’s social networks. In this article, a novel, near-linear, and highly scalable community prediction methodology is introduced. Specifically, using a distributed, stacking-based model, which is built on plain network topology characteristics of bootstrap sampled subgraphs, the underlined community hierarchy of any given social network is efficiently extracted in spite of its size and density. The effectiveness of the proposed methodology has diligently been examined on numerous real-life social networks and proven superior to various similar approaches in terms of performance, stability, and accuracy.

scholarly journals Exploiting Proximity-Based Mobile Apps for Large-Scale Location Privacy Probing

2018 ◽  
Vol 2018 ◽  
pp. 1-22 ◽  
Author(s):  
Shuang Zhao ◽  
Xiapu Luo ◽  
Xiaobo Ma ◽  
Bo Bai ◽  
Yankang Zhao ◽  
...  
Keyword(s):  
Social Networks ◽  
Case Studies ◽  
Real World ◽  
Emission Reduction ◽  
Large Scale ◽  
Location Privacy ◽  
Mobile Apps ◽  
Physical World ◽  
Typical Type ◽  
Location Spoofing

Proximity-based apps have been changing the way people interact with each other in the physical world. To help people extend their social networks, proximity-based nearby-stranger (NS) apps that encourage people to make friends with nearby strangers have gained popularity recently. As another typical type of proximity-based apps, some ridesharing (RS) apps allowing drivers to search nearby passengers and get their ridesharing requests also become popular due to their contribution to economy and emission reduction. In this paper, we concentrate on the location privacy of proximity-based mobile apps. By analyzing the communication mechanism, we find that many apps of this type are vulnerable to large-scale location spoofing attack (LLSA). We accordingly propose three approaches to performing LLSA. To evaluate the threat of LLSA posed to proximity-based mobile apps, we perform real-world case studies against an NS app named Weibo and an RS app called Didi. The results show that our approaches can effectively and automatically collect a huge volume of users’ locations or travel records, thereby demonstrating the severity of LLSA. We apply the LLSA approaches against nine popular proximity-based apps with millions of installations to evaluate the defense strength. We finally suggest possible countermeasures for the proposed attacks.

Exploiting Social Networks for Large-Scale Human Behavior Modeling

2011 ◽  
Vol 10 (4) ◽  
pp. 45-53 ◽  
Author(s):  
Nicholas D. Lane ◽  
Ye Xu ◽  
Hong Lu ◽  
Andrew T. Campbell ◽  
Tanzeem Choudhury ◽  
...  
Keyword(s):  
Social Networks ◽  
Human Behavior ◽  
Large Scale ◽  
Behavior Modeling ◽  
Human Behavior Modeling

Efficient Vector Partitioning Algorithms for Graph Clustering

2020 ◽  
Vol 1 (2) ◽  
pp. 101-123
Author(s):  
Hiroaki Shiokawa ◽  
Yasunori Futamura
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Ground Truth ◽  
Graph Clustering ◽  
Mining Communities ◽  
Fine Grained ◽  
Efficient Vector ◽  
Public Datasets ◽  
Many Core

This paper addressed the problem of finding clusters included in graph-structured data such as Web graphs, social networks, and others. Graph clustering is one of the fundamental techniques for understanding structures present in the complex graphs such as Web pages, social networks, and others. In the Web and data mining communities, the modularity-based graph clustering algorithm is successfully used in many applications. However, it is difficult for the modularity-based methods to find fine-grained clusters hidden in large-scale graphs; the methods fail to reproduce the ground truth. In this paper, we present a novel modularity-based algorithm, \textit{CAV}, that shows better clustering results than the traditional algorithm. The proposed algorithm employs a cohesiveness-aware vector partitioning into the graph spectral analysis to improve the clustering accuracy. Additionally, this paper also presents a novel efficient algorithm \textit{P-CAV} for further improving the clustering speed of CAV; P-CAV is an extension of CAV that utilizes the thread-based parallelization on a many-core CPU. Our extensive experiments on synthetic and public datasets demonstrate the performance superiority of our approaches over the state-of-the-art approaches.

Modeling Large-Scale Dynamic Social Networks via Node Embeddings

2019 ◽  
Vol 31 (10) ◽  
pp. 1994-2007 ◽  
Author(s):  
Aakas Zhiyuli ◽  
Xun Liang ◽  
Yanfang Chen ◽  
Xiaoyong Du
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Dynamic Social Networks ◽  
Node Embeddings

Computational modeling of Weibo user influence based on information interactive network

2016 ◽  
Vol 40 (7) ◽  
pp. 867-881 ◽  
Author(s):  
Dingguo Yu ◽  
Nan Chen ◽  
Xu Ran
Keyword(s):  
Social Networks ◽  
Computational Model ◽  
Large Scale ◽  
Mobile Internet ◽  
Activity Level ◽  
Message Content ◽  
Data Set ◽  
Sina Weibo ◽  
Content Type ◽  
User Influence

Purpose With the development and application of mobile internet access, social media represented by Weibo, WeChat, etc. has become the main channel for information release and sharing. High-impact users in social networks are key factors stimulating the large-scale propagation of information within social networks. User influence is usually related to the user’s attention rate, activity level, and message content. The paper aims to discuss these issues. Design/methodology/approach In this paper, the authors focused on Sina Weibo users, centered on users’ behavior and interactive information, and formulated a weighted interactive information network model, then present a novel computational model for Weibo user influence, which combined multiple indexes such as the user’s attention rate, activity level, and message content influence, etc., the model incorporated the time dimension, through the calculation of users’ attribute influence and interactive influence, to comprehensively measure the user influence of Sina Weibo users. Findings Compared with other models, the model reflected the dynamics and timeliness of the user influence in a more accurate way. Extensive experiments are conducted on the real-world data set, and the results validate the performance of the approach, and demonstrate the effectiveness of the dynamics and timeliness. Due to the similarity in platform architecture and user behavior between Sina Weibo and Twitter, the calculation model is also applicable to Twitter. Originality/value This paper presents a novel computational model for Weibo user influence, which combined multiple indexes such as the user’s attention rate, activity level, and message content influence, etc.

scholarly journals Hashkat: large-scale simulations of online social networks

2017 ◽  
Vol 7 (1) ◽  
Author(s):  
Kevin Ryczko ◽  
Adam Domurad ◽  
Nicholas Buhagiar ◽  
Isaac Tamblyn
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Large Scale ◽  
Large Scale Simulations

A Review of Machine Learning and Data Mining Approaches for Business Applications in Social Networks

2013 ◽  
Vol 9 (1) ◽  
pp. 36-53
Author(s):  
Evis Trandafili ◽  
Marenglen Biba
Keyword(s):  
Machine Learning ◽  
Data Mining ◽  
Social Networks ◽  
Large Scale ◽  
Viral Marketing ◽  
Social Network Mining ◽  
Business Applications ◽  
Mining Community ◽  
Recent Developments ◽  
Analysis Of Social Networks

Social networks have an outstanding marketing value and developing data mining methods for viral marketing is a hot topic in the research community. However, most social networks remain impossible to be fully analyzed and understood due to prohibiting sizes and the incapability of traditional machine learning and data mining approaches to deal with the new dimension in the learning process related to the large-scale environment where the data are produced. On one hand, the birth and evolution of such networks has posed outstanding challenges for the learning and mining community, and on the other has opened the possibility for very powerful business applications. However, little understanding exists regarding these business applications and the potential of social network mining to boost marketing. This paper presents a review of the most important state-of-the-art approaches in the machine learning and data mining community regarding analysis of social networks and their business applications. The authors review the problems related to social networks and describe the recent developments in the area discussing important achievements in the analysis of social networks and outlining future work. The focus of the review in not only on the technical aspects of the learning and mining approaches applied to social networks but also on the business potentials of such methods.

Sign in / Sign up

Export Citation Format

Share Document