Towards a distributed local-search approach for partitioning large-scale social networks

2020 ◽  
Vol 508 ◽  
pp. 200-213
Author(s):  
Bin Zheng ◽  
Ouyang Liu ◽  
Jing Li ◽  
Yong Lin ◽  
Chong Chang ◽  
...  
Keyword(s):  
Social Networks ◽  
Local Search ◽  
Large Scale ◽  
Search Approach

scholarly journals Spikyball Sampling: Exploring Large Networks via an Inhomogeneous Filtered Diffusion

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 275
Author(s):  
Benjamin Ricaud ◽  
Nicolas Aspert ◽  
Volodymyr Miz
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Sampling Methods ◽  
Breadth First Search ◽  
Large Graphs ◽  
New Approach ◽  
Random Subset ◽  
Large Size ◽  
Large Scale Networks ◽  
Search Approach

Studying real-world networks such as social networks or web networks is a challenge. These networks often combine a complex, highly connected structure together with a large size. We propose a new approach for large scale networks that is able to automatically sample user-defined relevant parts of a network. Starting from a few selected places in the network and a reduced set of expansion rules, the method adopts a filtered breadth-first search approach, that expands through edges and nodes matching these properties. Moreover, the expansion is performed over a random subset of neighbors at each step to mitigate further the overwhelming number of connections that may exist in large graphs. This carries the image of a “spiky” expansion. We show that this approach generalize previous exploration sampling methods, such as Snowball or Forest Fire and extend them. We demonstrate its ability to capture groups of nodes with high interactions while discarding weakly connected nodes that are often numerous in social networks and may hide important structures.

scholarly journals Optimization Algorithms for Detection of Social Interactions

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 139 ◽  
Author(s):  
Vincenzo Cutello ◽  
Georgia Fargetta ◽  
Mario Pavone ◽  
Rocco A. Scollo
Keyword(s):  
Social Networks ◽  
Local Search ◽  
Social Interactions ◽  
Community Detection ◽  
Experimental Analysis ◽  
Search Strategy ◽  
Random Search ◽  
Optimization Methods ◽  
Research Areas ◽  
Greedy Optimization

Community detection is one of the most challenging and interesting problems in many research areas. Being able to detect highly linked communities in a network can lead to many benefits, such as understanding relationships between entities or interactions between biological genes, for instance. Two different immunological algorithms have been designed for this problem, called Opt-IA and Hybrid-IA, respectively. The main difference between the two algorithms is the search strategy and related immunological operators developed: the first carries out a random search together with purely stochastic operators; the last one is instead based on a deterministic Local Search that tries to refine and improve the current solutions discovered. The robustness of Opt-IA and Hybrid-IA has been assessed on several real social networks. These same networks have also been considered for comparing both algorithms with other seven different metaheuristics and the well-known greedy optimization Louvain algorithm. The experimental analysis conducted proves that Opt-IA and Hybrid-IA are reliable optimization methods for community detection, outperforming all compared algorithms.

Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search

2021 ◽  
Vol 16 (2) ◽  
pp. 1-34
Author(s):  
Rediet Abebe ◽  
T.-H. HUBERT Chan ◽  
Jon Kleinberg ◽  
Zhibin Liang ◽  
David Parkes ◽  
...  
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Iterative Process ◽  
Large Scale ◽  
Opinion Dynamics ◽  
Theoretical Models ◽  
Global Optimum ◽  
Local Optimum ◽  
Opinion Formation ◽  
Long Line

A long line of work in social psychology has studied variations in people’s susceptibility to persuasion—the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theoretical models of opinion formation by interacting parties in a network: in addition to considering interventions that directly modify people’s intrinsic opinions, it is also natural to consider interventions that modify people’s susceptibility to persuasion. In this work, motivated by this fact, we propose an influence optimization problem. Specifically, we adopt a popular model for social opinion dynamics, where each agent has some fixed innate opinion, and a resistance that measures the importance it places on its innate opinion; agents influence one another’s opinions through an iterative process. Under certain conditions, this iterative process converges to some equilibrium opinion vector. For the unbudgeted variant of the problem, the goal is to modify the resistance of any number of agents (within some given range) such that the sum of the equilibrium opinions is minimized; for the budgeted variant, in addition the algorithm is given upfront a restriction on the number of agents whose resistance may be modified. We prove that the objective function is in general non-convex. Hence, formulating the problem as a convex program as in an early version of this work (Abebe et al., KDD’18) might have potential correctness issues. We instead analyze the structure of the objective function, and show that any local optimum is also a global optimum, which is somehow surprising as the objective function might not be convex. Furthermore, we combine the iterative process and the local search paradigm to design very efficient algorithms that can solve the unbudgeted variant of the problem optimally on large-scale graphs containing millions of nodes. Finally, we propose and evaluate experimentally a family of heuristics for the budgeted variant of the problem.

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 Combining Heuristics with Simulation and Fuzzy Logic to Solve a Flexible-Size Location Routing Problem under Uncertainty

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 45
Author(s):  
Rafael D. Tordecilla ◽  
Pedro J. Copado-Méndez ◽  
Javier Panadero ◽  
Carlos L. Quintero-Araujo ◽  
Jairo R. Montoya-Torres ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Local Search ◽  
Vehicle Routing Problem ◽  
Large Scale ◽  
Iterated Local Search ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Routing ◽  
Fuzzy Pattern ◽  
Reasonable Computing

The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that need to be solved in reasonable computing times. This paper discusses a realistic variant of the problem that considers facilities of different sizes and two types of uncertainty conditions. In particular, we assume that some customers’ demands are stochastic, while others follow a fuzzy pattern. An iterated local search metaheuristic is integrated with simulation and fuzzy logic to solve the aforementioned problem, and a series of computational experiments are run to illustrate the potential of the proposed algorithm.

scholarly journals A Matheuristic Approach Combining Local Search and Mathematical Programming

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Carolina Lagos ◽  
Guillermo Guerrero ◽  
Enrique Cabrera ◽  
Stefanie Niklander ◽  
Franklin Johnson ◽  
...  
Keyword(s):  
Mathematical Programming ◽  
Local Search ◽  
Large Scale ◽  
Search Algorithm ◽  
Facility Location Problem ◽  
Specific Information ◽  
Local Search Algorithm ◽  
Capacitated Facility Location Problem ◽  
Capacitated Facility Location ◽  
Installation Cost

A novel matheuristic approach is presented and tested on a well-known optimisation problem, namely, capacitated facility location problem (CFLP). The algorithm combines local search and mathematical programming. While the local search algorithm is used to select a subset of promising facilities, mathematical programming strategies are used to solve the subproblem to optimality. Proposed local search is influenced by instance-specific information such as installation cost and the distance between customers and facilities. The algorithm is tested on large instances of the CFLP, where neither local search nor mathematical programming is able to find good quality solutions within acceptable computational times. Our approach is shown to be a very competitive alternative to solve large-scale instances for the CFLP.

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
Sign in / Sign up

Export Citation Format

Share Document