☆ 4.7 Article

Influence Maximization in social networks using discretized Harris' Hawks Optimization algorithm

APPLIED SOFT COMPUTING (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Artificial Intelligence

Opinion formation analysis for Expressed and Private Opinions (EPOs) models: Reasoning private opinions from behaviors in group decision-making systems

Jianglin Dong et al.

Summary: This study proposes a novel model of expressed and private opinions, taking into account the behavioral characteristics of individuals and the influence of social pressure on opinion formation. The simulation results show that increasing social pressure leads to consensus formation in the group, but individual private opinions and behaviors exhibit polarization.

EXPERT SYSTEMS WITH APPLICATIONS (2024)

Add to Collection

Article Computer Science, Artificial Intelligence

Influence maximization in social networks using transfer learning via graph-based LSTM

Sanjay Kumar et al.

Summary: In this study, a novel approach using graph-based long short-term memory (GLSTM) is proposed to solve the influence maximization problem. Inspired by deep learning techniques, the problem is formulated as a regression task, where node centrality methods and individual influence under the SIR information diffusion model are used as features and labels for training the model. Experimental results demonstrate that the proposed model outperforms other algorithms in influence maximization.

EXPERT SYSTEMS WITH APPLICATIONS (2023)

Add to Collection

Article Computer Science, Information Systems

Targeted influence maximization in competitive social networks

Ziwei Liang et al.

Summary: Advertising using word-of-mouth effect is effective in promoting products. This paper focuses on the problem of influence maximization in marketing, aiming to identify a small group of people in a social network as seeds to trigger the largest influence spread. The proposed algorithm, Reverse Reachable set-based Greedy (RRG), tackles the Targeted Influence Maximization in Competitive social networks (TIMC) problem and shows promising results.

INFORMATION SCIENCES (2023)

Add to Collection

Article Computer Science, Information Systems

On The Role of Community Structure in Evolution of Opinion Formation: A New Bounded Confidence Opinion Dynamics

Yuan Peng et al.

Summary: This study proposes a novel bounded confidence opinion dynamics model (LPA-HK) to investigate the relationship between opinion evolution and community structure. The model introduces the label propagation algorithm (LPA) to study this relationship from a micro perspective. Simulation experiments are conducted to verify the effectiveness and performance of the model.

INFORMATION SCIENCES (2023)

Add to Collection

Article Geosciences, Multidisciplinary

Emergency response process for sudden rainstorm and flooding: scenario deduction and Bayesian network analysis using evidence theory and knowledge meta-theory

Xiaoliang Xie et al.

Summary: The traditional forecast-response paradigm is facing practical challenges due to the need for different reaction mechanisms in different scenarios. This paper proposes a shift to the scenario-response paradigm, which analyzes the impact of measures on events from a microscopic perspective.

NATURAL HAZARDS (2023)

Add to Collection

Article Business

Do fake followers mitigate influencers? perceived influencing power on social media platforms? The mere number effect and boundary conditions

Liying Zhou et al.

Summary: The rapid advancement of influencer marketing in the digital age has led to marketers partnering with social media influencers to influence consumer opinions. This is done by identifying influencers with large follower numbers and the ability to influence. However, influencers sometimes purchase fake followers to appear more influential. Contrary to conventional wisdom, a study shows that the number of followers is positively associated with perceptions of influencing power, even when consumers recognize the existence of fake followers. Implications for brands' social media and influencer marketing are discussed.

JOURNAL OF BUSINESS RESEARCH (2023)

Add to Collection

Article Computer Science, Cybernetics

Influence-Based Community Partition With Sandwich Method for Social Networks

Qiufen Ni et al.

Summary: This article focuses on the community partition problem in social networks and formulates it as a combinatorial optimization problem. Continuous greedy algorithms and discrete implementations are proposed to solve the upper and lower bound problems, achieving a good approximation ratio. The effectiveness and advantages of the proposed method are demonstrated through experiments on real datasets.

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS (2023)

Add to Collection

Article Computer Science, Theory & Methods

APMSA: Adversarial Perturbation Against Model Stealing Attacks

Jiliang Zhang et al.

Summary: To prevent model stealing, researchers propose a method called APMSA, which adds small noise to each input query to make the model's returned confidence distribution consistent, thus reducing information leakage to attackers and effectively defending against model stealing attacks.

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY (2023)

Add to Collection

Article Computer Science, Artificial Intelligence

Influence maximization based on community structure and second-hop neighborhoods

Jianjun Cheng et al.

Summary: This paper presents a new heuristic method called IMCAN for influence maximization, which uses community structure to select seed nodes and calculates influence scores for each node. Experiments on real-world networks demonstrate the effectiveness of IMCAN.

APPLIED INTELLIGENCE (2022)

Add to Collection

Article Physics, Multidisciplinary

An improved influence maximization method for social networks based on genetic algorithm

Jalil Jabari Lotf et al.

Summary: Research in the field of social networks over the past decade has shown that the structure of these networks is complex, dynamic, and irregular, requiring seed sets to change over time. This study utilized soft computing methods to address network dynamicity in the classic influence maximization problem and identified influential nodes in snapshot graphs with higher scalability and accuracy compared to other algorithms.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2022)

Add to Collection

Article Computer Science, Information Systems

CSR: A community based spreaders ranking algorithm for influence maximization in social networks

Sanjay Kumar et al.

Summary: This paper discusses the importance of online social networks and the problem of influence maximization. The author proposes a novel method called Communities based Spreader Ranking (CSR), which identifies influential nodes and significant communities based on the concepts of community diversity, community modularity, and community density. Experimental validation shows that the proposed method outperforms other contemporary influence maximization methods.

WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A novel cause analysis approach of grey reasoning Petri net based on matrix operations

Li Li et al.

Summary: Cause analysis is crucial in fault diagnosis system, and a fuzzy Petri net is a commonly used model for knowledge representation. However, existing FPNs have limitations in cause analysis, which inspired the development of an enhanced grey reasoning Petri net (EGRPN) to address these issues. The EGRPN model utilizes grey numbers to tackle uncertain knowledge, enhancing the reliability of knowledge reasoning processes.

APPLIED INTELLIGENCE (2022)

Add to Collection

Article Computer Science, Artificial Intelligence

A two-stage VIKOR assisted multi-operator differential evolution approach for Influence Maximization in social networks

Tarun Kumer Biswas et al.

Summary: This study proposes a two-stage optimization framework to address the Influence Maximization problem in online social networks, utilizing a multi-criteria decision making approach and a modified differential evolution algorithm. The experimental results demonstrate that the proposed algorithm achieves a better trade-off between solution quality and running time compared to existing baseline algorithms.

EXPERT SYSTEMS WITH APPLICATIONS (2022)

Add to Collection

Article Computer Science, Information Systems

An influence maximization method based on crowd emotion under an emotion-based attribute social network

Weimin Li et al.

Summary: This paper introduces a novel approach for attributed influence maximization based on crowd emotion, aiming to analyze the impact of multi-dimensional characteristics on information propagation. The algorithm's effectiveness is demonstrated through experiments on real-world datasets, showing superior performance compared to heuristic methods with improved time efficiency.

INFORMATION PROCESSING & MANAGEMENT (2022)

Add to Collection

Article Engineering, Multidisciplinary

Continuous Influence-Based Community Partition for Social Networks

Qiufen Ni et al.

Summary: Community partition is crucial in social networks, particularly in the face of network growth and increased data and applications. This study focuses on the community partition problem under the Linear Threshold (LT) model, aiming to maximize influence propagation within each community. The proposed continuous greedy algorithm, which exploits the properties of the relaxed function, is able to effectively improve influence spread and accuracy of the community partition. Theoretical analysis demonstrates a 1 - 1/e approximation ratio for the algorithm, while extensive experiments on real-world online social networks datasets validate its performance.

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING (2022)

Add to Collection

Article Computer Science, Information Systems

Influence maximization in social networks using graph embedding and graph neural network

Sanjay Kumar et al.

Summary: With the boom in technologies and mobile networks, online social networks have become integral and influential in our daily lives. This paper proposes a novel method of influence maximization using graph embedding and graph neural networks, which outperforms previous methods according to experimental results on real-life networks.

INFORMATION SCIENCES (2022)

Add to Collection

Article Physics, Multidisciplinary

Influence maximization in social networks using effective community detection

Farzaneh Kazemzadeh et al.

Summary: The influence maximization problem focuses on finding a set of nodes with the highest diffusion in social networks to maximize the spread in the graph. This paper introduces the CTIM algorithm, which selects high-charisma nodes as seed nodes to reduce computational overhead and improve algorithm accuracy.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2022)

Add to Collection

Article Automation & Control Systems

A Distributionally Robust Optimization Based Method for Stochastic Model Predictive Control

Bin Li et al.

Summary: This article proposes two distributionally robust model predictive control algorithms for handling discrete linear systems with unbounded noise. The algorithms consider chance constraints on both state and control, and employ deterministic convex reformulations inspired by distributionally robust optimization. Computational complexity analysis demonstrates the effectiveness of the proposed algorithms, and proofs of recursive feasibility and convergence are provided. Simulation results are presented to show their effectiveness.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2022)

Add to Collection

Article Computer Science, Information Systems

CBIM: Community-based influence maximization in multilayer networks

K. Venkatakrishna Rao et al.

Summary: Selecting seed nodes is crucial for understanding information dynamics in networks. This paper proposes a community-based influence maximization model to identify influential nodes by identifying small communities and merging them into larger ones. Simulation studies demonstrate the effectiveness of the model in detecting influential nodes in various settings.

INFORMATION SCIENCES (2022)

Add to Collection

Article Computer Science, Information Systems

Edge Location Method for Multidimensional Image Based on Edge Symmetry Algorithm

Chen Li

Summary: This paper proposes an edge location method for multidimensional images based on edge symmetry, which verifies real edges by analyzing the symmetry axis position and symmetry of candidate image regions, and synthesizes them using a multidimensional pulse coupled neural network model to achieve accurate edge location results.

SECURITY AND COMMUNICATION NETWORKS (2021)

Add to Collection

Article Computer Science, Hardware & Architecture

CFIN: A community-based algorithm for finding influential nodes in complex social networks

Mohammad Mehdi Daliri Khomami et al.

Summary: Influence maximization is the problem of selecting a set of k users from a social network to maximize the expected number of influenced users. The CFIN algorithm proposed in this paper selects k users based on community structure and outperforms other algorithms in terms of influence spread, coverage ratio, running time, and Dolan-More performance profile.

JOURNAL OF SUPERCOMPUTING (2021)

Add to Collection

Article Telecommunications

Reconfigurable Intelligent Surface (RIS) Assisted Wireless Coverage Extension: RIS Orientation and Location Optimization

Shuhao Zeng et al.

Summary: This letter analyzes the coverage of a downlink RIS-assisted network with one base station (BS) and one user equipment (UE). An RIS placement optimization problem is formulated to maximize the cell coverage by optimizing the RIS orientation and horizontal distance. A coverage maximization algorithm (CMA) is proposed to solve the problem, with a closed-form optimal RIS orientation obtained, and numerical results verifying the analysis.

IEEE COMMUNICATIONS LETTERS (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Identifying Influential Spreaders in Social Networks Through Discrete Moth-Flame Optimization

Lu Wang et al.

Summary: The study focuses on maximizing influence in social networks, proposing an influence assessment model based on both total valuation and variance in valuation of neighbor nodes, and developing a discrete moth-flame optimization method for searching influence-maximizing node sets. Experimental results show the effectiveness and robustness of the proposed method in tackling the influence maximization problem.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Modeling Relation Paths for Knowledge Graph Completion

Ying Shen et al.

Summary: The study introduces a Type-aware Attentive Path Reasoning (TAPR) method to complete knowledge graphs by considering structural information, textual information, and type information. Experimental results demonstrate significant improvement over baseline methods.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2021)

Add to Collection

Article Computer Science, Information Systems

An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks

Tarun K. Biswas et al.

Summary: The paper proposes a multi-criteria decision making (MCDM) based metaheuristic approach to solve the Influence Maximization (IM) problem in social networks. By utilizing an MCDM approach to select candidate nodes and a modified version of Simulated Annealing (SA), the proposed algorithm has shown better trade-off between solution quality and computational run time compared to other algorithms.

INFORMATION SCIENCES (2021)

Add to Collection

Article Computer Science, Theory & Methods

A survey on meta-heuristic algorithms for the influence maximization problem in the social networks

Zahra Aghaee et al.

Summary: The different communications of users in social networks have a significant impact on each other, especially when they can achieve their goals through various communication methods. The influence maximization problem on social networks has been studied by modeling the effect of specific users on others, with various algorithms proposed to improve influence spread and running time. This paper categorizes existing algorithms for this problem and compares the advantages and disadvantages of meta-heuristic algorithms in recent years.

COMPUTING (2021)

Add to Collection

Article Computer Science, Artificial Intelligence

Stock intelligent investment strategy based on support vector machine parameter optimization algorithm

Xuetao Li et al.

NEURAL COMPUTING & APPLICATIONS (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

ACO-IM: maximizing influence in social networks using ant colony optimization

Shashank Sheshar Singh et al.

SOFT COMPUTING (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

Identification of influential users in social network using gray wolf optimization algorithm

Ahmad Zareie et al.

EXPERT SYSTEMS WITH APPLICATIONS (2020)

Add to Collection

Article Computer Science, Interdisciplinary Applications

Influential spreaders identification in complex networks with potential edge weight based k-shell degree neighborhood method

Giridhar Maji

JOURNAL OF COMPUTATIONAL SCIENCE (2020)

Add to Collection

Article Automation & Control Systems

Multiobjective 3-D Topology Optimization of Next-Generation Wireless Data Center Network

Bin Cao et al.

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

Applying graph-based differential grouping for multiobjective large-scale optimization

Bin Cao et al.

SWARM AND EVOLUTIONARY COMPUTATION (2020)

Add to Collection

Article Computer Science, Information Systems

Efficient algorithms based on centrality measures for identification of top-K influential users in social networks

Mohammed Alshahrani et al.

INFORMATION SCIENCES (2020)

Add to Collection

Article Automation & Control Systems

Security-Aware Industrial Wireless Sensor Network Deployment Optimization

Bin Cao et al.

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2020)

Add to Collection

Article Computer Science, Artificial Intelligence

A Niching Memetic Algorithm for Multi-Solution Traveling Salesman Problem

Ting Huang et al.

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2020)

Add to Collection

Article Multidisciplinary Sciences

The problem with unadjusted multiple and sequential statistical testing

Casper Albers

NATURE COMMUNICATIONS (2019)

Add to Collection

Article Computer Science, Theory & Methods

Harris hawks optimization: Algorithm and applications

Ali Asghar Heidari et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

Community-based influence maximization for viral marketing

Huimin Huang et al.

APPLIED INTELLIGENCE (2019)

Add to Collection

Article Computer Science, Theory & Methods

A new local and multidimensional ranking measure to detect spreaders in social networks

Kamal Berahmand et al.

COMPUTING (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

Influence maximization in social networks based on TOPSIS

Ahmad Zareie et al.

EXPERT SYSTEMS WITH APPLICATIONS (2018)

Add to Collection

Article Computer Science, Theory & Methods

Influence maximization in large social networks: Heuristics, models and parameters

N. Sumith et al.

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2018)

Add to Collection

Article Computer Science, Hardware & Architecture

DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks

Laizhong Cui et al.

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS (2018)

Add to Collection

Review Computer Science, Hardware & Architecture

Influence analysis in social networks: A survey

Sancheng Peng et al.

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

Community-based seeds selection algorithm for location aware influence maximization

Xiao Li et al.

NEUROCOMPUTING (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

Maximizing the spread of influence via the collective intelligence of discrete bat algorithm

Jianxin Tang et al.

KNOWLEDGE-BASED SYSTEMS (2018)

Add to Collection

Article Physics, Multidisciplinary

Leveraging local h-index to identify and rank influential spreaders in networks

Qiang Liu et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2018)

Add to Collection

Article Physics, Multidisciplinary

IMPC: Influence maximization based on multi-neighbor potential in community networks

Jiaxing Shang et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2018)

Add to Collection

Article Computer Science, Artificial Intelligence

Bring Order into the Samples: A Novel Scalable Method for Influence Maximization

Xiaoyang Wang et al.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2017)

Add to Collection

Article Computer Science, Information Systems

Influence maximization in social networks based on discrete particle swarm optimization

Maoguo Gong et al.

INFORMATION SCIENCES (2016)

Add to Collection

Article Computer Science, Artificial Intelligence

Big social network influence maximization via recursively estimating influence spread

Wei-Xue Lu et al.

KNOWLEDGE-BASED SYSTEMS (2016)

Add to Collection

Article Physics, Multidisciplinary

Identifying influential spreaders in complex networks based on gravity formula

Ling-ling Ma et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2016)

Add to Collection

Article Physics, Multidisciplinary

Identifying and ranking influential spreaders in complex networks by neighborhood coreness

Joonhyun Bae et al.

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS (2014)

Add to Collection

Article Physics, Multidisciplinary

Ranking spreaders by decomposing complex networks

An Zeng et al.

PHYSICS LETTERS A (2013)

Add to Collection

Article Physics, Multidisciplinary

Identification of influential spreaders in complex networks

Maksim Kitsak et al.

NATURE PHYSICS (2010)

Add to Collection

Article Mechanics

Fast unfolding of communities in large networks

Vincent D. Blondel et al.

JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT (2008)

Add to Collection

Article Physics, Fluids & Plasmas

Subgraph centrality in complex networks -: art. no. 056103

E Estrada et al.

PHYSICAL REVIEW E (2005)

Add to Collection

Article Physics, Fluids & Plasmas

Growing scale-free networks with tunable clustering

P Holme et al.

PHYSICAL REVIEW E (2002)

Add to Collection

Article Business

Talk of the network: A complex systems look at the underlying process of word-of-mouth

J Goldenberg et al.

MARKETING LETTERS (2001)

Add to Collection

© Peeref 2019-2024. All rights reserved.