Network Datasets Research Articles

A survey on feature extraction and learning techniques for link prediction in homogeneous and heterogeneous complex networks

Complex networks are commonly observed in several real-world areas, such as social, biological, and technical systems, where they exhibit complicated patterns of connectedness and organised clusters. These networks have intricate topological characteristics that frequently elude conventional characterization. Link prediction in complex networks, like data flow in telecommunications networks, protein interactions in biological systems, and social media interactions on platforms like Facebook, etc., is an essential element of network analytics and presents fresh research challenges. Consequently, there is a growing emphasis in research on creating new link prediction methods for different network applications. This survey investigates several strategies related to link prediction, ranging from feature extraction based to feature learning based techniques, with a specific focus on their utilisation in dynamic and developing network topologies. Furthermore, this paper emphasises on a wide variety of feature learning techniques that go beyond basic feature extraction and matrix factorization. It includes advanced learning-based algorithms and neural network techniques specifically designed for link prediction. The study also presents evaluation results of different link prediction techniques on homogeneous and heterogeneous network datasets, and provides a thorough examination of existing methods and potential areas for further investigation.

Improved identification of network anomalies through optimal CURE clustering

Abstract In this paper, we propose an advanced network anomaly behavior identification framework to overcome the constraints inherent in conventional rule- or signature-based approaches, which often struggle with emerging and previously unknown threats. Central to our framework is an Enhanced CURE (Cluster Updating and REfining) clustering algorithm, meticulously tailored and refined to incorporate a density-based methodology. This enhancement enables the algorithm to discern subtle shifts in network anomaly patterns with heightened precision. The implementation workflow commences with the application of the optimized CURE algorithm to analyze network data, followed by the deployment of a sophisticated anomaly degree ranking mechanism. This mechanism, through meticulous calculation of individual data points' anomaly degrees and subsequent ranking, effectively isolates those deviating significantly from standard behavioral norms, incorporating a strategic threshold to filter out false positives. To validate our methodology's efficacy and its superiority over existing techniques, experiments were conducted utilizing a substantial real-world network dataset. These tests affirm not only a marked increase in the accuracy of abnormal behavior recognition and a reduction in computational intricacy but also demonstrate the adaptability across diverse network ecosystems. Our approach has proven successful in pinpointing a wide array of network anomalies, encompassing malicious cyberattacks, fraudulent activities, unauthorized intrusions, and breaches of security protocols, thereby highlighting its comprehensive capability in bolstering network defense strategies. Despite the notable advancements and successful identification of various network anomalies, our framework currently lacks integration with real-time learning capabilities, limiting its immediate responsiveness to rapidly evolving attack patterns and necessitating ongoing research for dynamic updates and adaptive learning mechanisms.

Trustworthiness-Driven Graph Convolutional Networks for Signed Network Embedding

The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks (GCNs) have been proposed for this problem, we point out that they significantly rely on the assumption that the decades-old balance theory always holds in the real-world. To address this limitation, we propose a novel GCN-based SNE approach, named as TrustSGCN, which corrects for incorrect embedding propagation in GCN by utilizing the trustworthiness on edge signs for high-order relationships inferred by the balance theory. The proposed approach consists of three modules: (M1) generation of each node’s extended ego-network; (M2) measurement of trustworthiness on edge signs; and (M3) trustworthiness-aware propagation of embeddings. Specifically, TrustSGCN leverages topological information to measure trustworthiness on edge sign for high-order relationships inferred by balance theory. It then considers structural properties inherent to an input network, such as the ratio of triads, to correct for incorrect embedding propagation. Furthermore, TrustSGCN learns the node embeddings by leveraging two well-known social theories, i.e., balance and status, to jointly preserve the edge sign and direction between nodes connected by existing edges in the embedding space. The experiments on six real-world signed network datasets demonstrate that TrustSGCN consistently outperforms six state-of-the-art GCN-based SNE methods. The code is available at https://github.com/kmj0792/TrustSGCN .

IMUNE: A novel evolutionary algorithm for influence maximization in UAV networks

In a network, influence maximization addresses identifying an optimal set of nodes to initiate influence propagation, thereby maximizing the influence spread. Current approaches for influence maximization encounter limitations in accuracy and efficiency. Furthermore, most existing methods are aimed at the IC (Independent Cascade) diffusion model, and few solutions concern dynamic networks. In this study, we focus on dynamic networks consisting of UAV (Unmanned Aerial Vehicle) clusters that perform coverage tasks and introduce IMUNE, an evolutionary algorithm for influence maximization in UAV networks. We first generate dynamic networks that simulate UAV coverage tasks and give the representation of dynamic networks. Novel fitness functions in the evolutionary algorithm are designed to estimate the influence ability of a set of seed nodes in a dynamic process. On this basis, an integrated fitness function is proposed to fit both the IC and SI (Susceptible–Infected) models. IMUNE can find seed nodes for maximizing influence spread in dynamic UAV networks with different diffusion models through the improvements in fitness functions and search strategies. Experimental results on UAV network datasets show the effectiveness and efficiency of the IMUNE algorithm in solving influence maximization problems.

Research on the Delineation Method of Urban Community Living Circle Based on Transportation Network Analysis in Yuanping, China

In the context of accelerating global urbanization and the demands for high-quality and sustainable development, the exploration of an urban community living area delineation method based on traffic network analysis offers a fresh perspective for defining urban living areas. This paper employs a traffic network analysis method rooted in objective analysis. It leverages open-source big data on Points of Interest (POI) from public facilities and road network data obtained from relevant urban planning to construct a comprehensive road network dataset for the central urban area. Following the construction of the road network dataset, the paper conducts a service area and accessibility analysis of public facilities, which serves as an initial step in outlining the boundaries of the urban community living area. Subsequently, the delineation is further refined by considering factors such as development boundaries, as well as natural and man-made constraints such as rivers, railways, and major roads. The boundaries of the urban community living area undergo further adjustments, taking into account the scope of the development boundary and various constraining elements such as rivers, railways, and main roads. A final revision is made by considering subjective factors, where the boundaries of the ten-minute urban community living area are ultimately determined through extensive communication and coordination with various stakeholders. This approach is aimed at meeting the current societal development needs, which include breaking down segregation, fostering social interactions, strengthening neighbourly relationships, enhancing overall quality of life, promoting sustainable development, and creating a more humane and sustainable city. Its ultimate goal is to enable residents to feel a sense of belonging and happiness within the bustling urban environment.

A specialized inclusive road dataset with elevation profiles for realistic pedestrian navigation using open geospatial data and deep learning

Built environment characteristics can greatly influence pedestrians' route choices with factors beyond distance, such as accessibility, convenience, safety, and aesthetics, playing crucial roles. Although current navigation apps, such as Google Maps and Waze, have successfully provided driving directions, their navigation services are insufficient and sometimes unrealistic for addressing pedestrians' needs, largely due to the lack of dedicated pedestrian networks and the associated navigation algorithms. To address the research gaps, this paper proposes a novel approach that integrates freely available geospatial data and computer vision technology to create a specialized inclusive network dataset for outdoor pedestrian navigation. Moreover, a pedestrian navigation algorithm is developed to generate more practical “shortest” and “alternative” paths by incorporating various sidewalk attributes. We applied the method to create a pedestrian navigation network in Las Vegas. SpaceNet's open imagery dataset was used to extract Las Vegas's road networks. A virtual audit process assessed the visual and operational properties of the sidewalk networks using Google street-level images, evaluating factors including sidewalk presence, widths, surface types and conditions, missing curb ramps, greenery, protection from weather conditions, and lighting. Google Earth's open elevation data were used to analyze road elevation profiles as meaningful 3D indicators of sidewalk accessibility for wheelchair users. Further, additional geometric properties of the network, including road curviness, proximity to road intersections, and directional changes, were detected and analyzed. A navigation experiment conducted with individuals having varying mobility abilities, including regular pedestrians, older adults, and wheelchair users demonstrated the effectiveness of the newly developed network and algorithm in meeting the diverse needs of pedestrians.

Network Data Intrusion Detection and Data Feature Extraction of Electromechanical Facilities from Machine Learning

With the rapid development of Internet technology, network security issues have become more complex and changeable. Various intrusion methods threaten the information network environment in the Electromechanical Facility (EF) system. This paper focuses on EF to study the relevant detection methods and data feature extraction in complex network intrusions. Firstly, four common machine learning algorithms are used to calculate the data set. The advantages and disadvantages of each algorithm are analyzed after tuning and comparison. Secondly, a network intrusion detection algorithm is proposed based on Recursive Feature Elimination (RFE) principal component analysis. It uses RFE to reduce the number of features and improve the elimination judgment index to align with the detection requirements of information network datasets. Finally, a fault diagnosis method is proposed based on empirical pattern decomposition and support vector machine under Renyi entropy complexity measurement. This method trains and identifies the Renyi entropy of several basic pattern components obtained by decomposing empirical patterns as feature vectors. The results show that the RFE method judged by random forest removes irrelevant features, and the evaluation index is improved to align with the network dataset’s detection requirements. It reduces the data dimension, reduces the operation time, and improves the accuracy of a few attack types. The comprehensive final detection effect is better than other algorithms. Additionally, the embedded operating system construction method based on the protection mechanism realizes the separate storage of the operating system and key data. Also, it can prevent the network system from being maliciously invaded, ensuring the stability of the instrument operation under harsh working conditions.

Methods for Corrosion Detection in Pipes Using Thermography: A Case Study on Synthetic Datasets

This study reviews advanced methods for corrosion detection and characterization in pipes using thermography, with a focus on addressing the limitations posed by small datasets. Thermography captures temperature distributions on the surface of pipes to identify subsurface defects. The challenges of sequential data processing, neural network performance, feature extraction, and dataset size are discussed, with proposed solutions such as advanced algorithms, feature selection techniques, and data augmentation. Given the significant gap in the current literature, there is a need for larger, more diverse datasets to train more robust and accurate machine learning models. A case study combining experimental data with Finite Element Method (FEM) simulations demonstrates that augmenting datasets with synthetic data significantly improves defect detection accuracy. These findings highlight the potential of integrating thermography with machine learning to enhance defect detection, providing insights for future research and practical applications.

Size-fixed group discovery via multi-constrained graph pattern matching

Multi-Constrained Graph Pattern Matching (MC-GPM) aims to match a pattern graph with multiple attribute constraints on its nodes and edges, and has garnered significant interest in various fields, including social-based e-commerce and trust-based group discovery. However, the existing MC-GPM methods do not consider situations where the number of each node in the pattern graph needs to be fixed, such as finding experts group with expert quantities and relations specified. In this paper, a Multi-Constrained Strong Simulation with the Fixed Number of Nodes (MCSS-FNN) matching model is proposed, and then a Trust-oriented Optimal Multi-constrained Path (TOMP) matching algorithm is designed for solving it. Additionally, two heuristic optimization strategies are designed, one for combinatorial testing and the other for edge matching, to enhance the efficiency of the TOMP algorithm. Empirical experiments are conducted on four real social network datasets, and the results demonstrate the effectiveness and efficiency of the proposed algorithm and optimization strategies.

Economic and environmental benefits of optimized waste transportation routes in Khulna

Urban transportation is a big source of pollution and greenhouse gas emissions. Khulna City handles the waste of 1.23 million people daily, using Heavy Duty Diesel Vehicles (HDDV) that release major environmental pollutants. The current waste transportation routes lack proper planning, leading to extra fuel consumption and pollutant emissions. This study aims to reduce fuel consumption and socio-environmental costs by improving waste transportation routes. Present collection routes, collecting points, and the speed of 30 waste collector vehicles were tracked using GPS devices for ten months between July 2023 and April 2024. The network dataset was modified according to four types of waste collector vehicles. ArcGIS Pro was used to find the optimal paths and their lengths. Fuel usage and prices were estimated using simple fuel consumption rate calculations. The lengths of current and optimal routes were used in COPERT to measure pollutant emissions. The results show that improved routes lower fuel consumption costs by approximately USD 55.39 per day and CO2 emissions by about 38.242 tonnes per year. Reductions in CO, CH4, NMVOC, NO2, PM10, and PM2.5 were roughly 9.3%, 9.53%, 9.21%, 9.29%, 9.35%, and 9.3%, respectively. This study demonstrates a comprehensive approach for improving solid waste management covering both financial efficiency and environmental effects.

Research on satellite structural health monitoring based on ultrashort femtosecond grating array and artificial neural network

The safety of spacecraft and satellite in orbit is very important, and structural health monitoring is needed. At present, the existing technology is limited by load and difficult to realize. In this paper, we propose a feasible method to detect and locate the damage of satellite by combining ultrashort femtosecond grating array inscribed on oxide-doped fiber with multilayer artificial neural network. An oxide-doped fiber with high robustness is designed, and ultrashort grating arrays are fabricated on the fiber by femtosecond laser point-by-point writing technology. The effects of impactor velocity and angle on impact response was investigated by numerical simulations and physical experiments. Subsequently, repeated impact experiments were conducted on the satellite to obtain the training dataset and testing dataset for two-dimensional convolutional neural network. The network with symmetric convention kernels has an 88.12% localization accuracy and a better performance in boundary region, and the network architecture with asymmetric convention kernels has a 90.31% accuracy and a better performance in middle region.

Study on Fast Temporal Prediction Method of Flame Propagation Velocity in Methane Gas Deflagration Experiment Based on Neural Network

To address the challenges of high experimental costs, complexity, and time consumption associated with pre-mixed combustible gas deflagration experiments under semi-open space obstacle conditions, a rapid temporal prediction method for flame propagation velocity based on Ranger-GRU neural networks is proposed. The deflagration experiment data are employed as the training dataset for the neural network, with the coefficient of determination (R2) and mean squared error (MSE) used as evaluation metrics to assess the predictive performance of the network. First, 108 sets of pre-mixed methane gas deflagration experiments were conducted, varying obstacle parameters to investigate methane deflagration mechanisms under different conditions. The experimental results demonstrate that obstacle-to-ignition source distance, obstacle shape, obstacle length, obstacle quantity, and thick and fine wire mesh obstacles all significantly influence flame propagation velocity. Subsequently, the GRU neural network was trained, and different activation functions (Sigmoid, Relu, PReLU) and optimizers (Lookahead, RAdam, Adam, Ranger) were incorporated into the backpropagation updating process of the network. The training results show that the Ranger-GRU neural network based on the PReLU activation function achieves the highest mean R2 value of 0.96 and the lowest mean MSE value of 7.16759. Therefore, the Ranger-GRU neural network with PReLU activation function can be a viable rapid prediction method for flame propagation velocity in pre-mixed methane gas deflagration experiments under semi-open space obstacle conditions.

Accurate segmentation of intracellular organelle networks using low-level features and topological self-similarity.

Intracellular organelle networks (IONs) such as the endoplasmic reticulum (ER) network and the mitochondrial (MITO) network serve crucial physiological functions. The morphology of these networks plays a critical role in mediating their functions. Accurate image segmentation is required for analyzing the morphology and topology of these networks for applications such as molecular mechanism analysis and drug target screening. So far, however, progress has been hindered by their structural complexity and density. In this study, we first establish a rigorous performance baseline for accurate segmentation of these organelle networks from fluorescence microscopy images by optimizing a baseline U-Net model. We then develop the multi-resolution encoder (MRE) and the hierarchical fusion loss (Lhf) based on two inductive components, namely low-level features and topological self-similarity, to assist the model in better adapting to the task of segmenting IONs. Empowered by MRE and Lhf, both U-Net and Pyramid Vision Transformer (PVT) outperform competing state-of-the-art models such as U-Net++, HR-Net, nnU-Net, and TransUNet on custom datasets of the ER network and the MITO network, as well as on public datasets of another biological network, the retinal blood vessel network. In addition, integrating MRE and Lhf with models such as HR-Net and TransUNet also enhances their segmentation performance. These experimental results confirm the generalization capability and potential of our approach. Furthermore, accurate segmentation of the ER network enables analysis that provides novel insights into its dynamic morphological and topological properties. Code and data are openly accessible at https://github.com/cbmi-group/MRE.

Copula Approximate Bayesian Computation Using Distribution Random Forests

Ongoing modern computational advancements continue to make it easier to collect increasingly large and complex datasets, which can often only be realistically analyzed using models defined by intractable likelihood functions. This Stats invited feature article introduces and provides an extensive simulation study of a new approximate Bayesian computation (ABC) framework for estimating the posterior distribution and the maximum likelihood estimate (MLE) of the parameters of models defined by intractable likelihoods, that unifies and extends previous ABC methods proposed separately. This framework, copulaABCdrf, aims to accurately estimate and describe the possibly skewed and high-dimensional posterior distribution by a novel multivariate copula-based meta-t distribution based on univariate marginal posterior distributions that can be accurately estimated by distribution random forests (drf), while performing automatic summary statistics (covariates) selection, based on robustly estimated copula dependence parameters. The copulaABCdrf framework also provides a novel multivariate mode estimator to perform MLE and posterior mode estimation and an optional step to perform model selection from a given set of models using posterior probabilities estimated by drf. The posterior distribution estimation accuracy of the ABC framework is illustrated and compared with previous standard ABC methods through several simulation studies involving low- and high-dimensional models with computable posterior distributions, which are either unimodal, skewed, or multimodal; and exponential random graph and mechanistic network models, each defined by an intractable likelihood from which it is costly to simulate large network datasets. This paper also proposes and studies a new solution to the simulation cost problem in ABC involving the posterior estimation of parameters from datasets simulated from the given model that are smaller compared to the potentially large size of the dataset being analyzed. This proposal is motivated by the fact that, for many models defined by intractable likelihoods, such as the network models when they are applied to analyze massive networks, the repeated simulation of large datasets (networks) for posterior-based parameter estimation can be too computationally costly and vastly slow down or prohibit the use of standard ABC methods. The copulaABCdrf framework and standard ABC methods are further illustrated through analyses of large real-life networks of sizes ranging between 28,000 and 65.6 million nodes (between 3 million and 1.8 billion edges), including a large multilayer network with weighted directed edges. The results of the simulation studies show that, in settings where the true posterior distribution is not highly multimodal, copulaABCdrf usually produced similar point estimates from the posterior distribution for low-dimensional parametric models as previous ABC methods, but the copula-based method can produce more accurate estimates from the posterior distribution for high-dimensional models, and, in both dimensionality cases, usually produced more accurate estimates of univariate marginal posterior distributions of parameters. Also, posterior estimation accuracy was usually improved when pre-selecting the important summary statistics using drf compared to ABC employing no pre-selection of the subset of important summaries. For all ABC methods studied, accurate estimation of a highly multimodal posterior distribution was challenging. In light of the results of all the simulation studies, this article concludes by discussing how the copulaABCdrf framework can be improved for future research.

An efficient network clustering approach using graph-boosting and nonnegative matrix factorization

Network clustering is a critical task in data analysis, aimed at uncovering the underlying structure and patterns within complex networks. Traditional clustering methods often struggle with large-scale and noisy data, leading to suboptimal results. Also, the efficiency of positive samples in network clustering depends on the carefully constructed data augmentation, and the pre-training process of the model deals with large-scale data. To address these issues, in this paper, we introduce an efficient network clustering approach that leverages Graph-Boosting and Nonnegative Matrix Factorization to enhance clustering performance (GBNMF). Our algorithm addresses the limitations of traditional clustering techniques by incorporating the strengths of graph-boosting, which iteratively improves the quality of clusters, and Nonnegative Matrix Factorization (NMF), which effectively captures latent structures within the data. We validate our algorithm through extensive experiments on various benchmark network datasets, demonstrating significant improvements in clustering accuracy and robustness. The proposed algorithm not only achieves superior clustering results but also exhibits remarkable computational efficiency, making it a valuable tool for large-scale network analysis applications.

PLLM-CS: Pre-trained Large Language Model (LLM) for cyber threat detection in satellite networks

Satellite networks are vital in facilitating communication services for various critical infrastructures. These networks can seamlessly integrate with a diverse array of systems. However, some of these systems are vulnerable due to the absence of effective intrusion detection systems, which can be attributed to limited research and the high costs associated with deploying, fine-tuning, monitoring, and responding to security breaches. To address these challenges, we propose a pre-trained Large Language Model for Cyber Security, for short PLLM-CS, which is a variant of pre-trained Transformers, which includes a specialized module for transforming network data into contextually suitable inputs. This transformation enables the proposed LLM to encode contextual information within the cyber data. To validate the efficacy of the proposed method, we conducted empirical experiments using two publicly available network datasets, UNSW_NB 15 and TON_IoT, both providing Internet of Things (IoT)-based traffic data. Our experiments demonstrate that proposed LLM method outperforms state-of-the-art techniques such as BiLSTM, GRU, and CNN. Notably, the PLLM-CS method achieves an outstanding accuracy level of 100% on the UNSW_NB 15 dataset, setting a new standard for benchmark performance in this domain.

Intelligent resource allocation in wireless networks: Predictive models for efficient access point management

With the significant increase in mobile users connected to the wireless network, coupled with the escalating energy consumption and the risk of network saturation, the search for resource management has become paramount. Managing several access points throughout a whole region is hugely relevant in this context. Moreover, a wireless network must keep its Service Level Agreement, regardless of the number of connected users. With that in mind, in this work, we propose four prediction models that allow one to predict the number of connected users on a wireless network. Once the number of users has been predicted, the network resources can be properly allocated, minimizing the number of active access points. We investigate the use of Particle Swarm Optimization and Genetic Algorithms to hyper-parameterize a Multilayer Perceptron neural network and a Decision Tree. We evaluate our proposal using a campus-based wireless network dataset with more than 20,000 connected users. As a result, our model can considerably improve network performance by intelligently allocating the number of access points, thereby addressing concerns related to energy consumption and network saturation. The results have shown an average accuracy of 95.18%, managing to save network resources effectively.

Residual-enhanced graph convolutional networks with hypersphere mapping for anomaly detection in attributed networks

In the burgeoning field of anomaly detection within attributed networks, traditional methodologies often encounter the intricacies of network complexity, particularly in capturing nonlinearity and sparsity. This study introduces an innovative approach that synergizes the strengths of Graph Convolutional Networks (GCNs) with advanced deep residual learning and a unique residual-based attention mechanism, thereby creating a more nuanced and efficient method for anomaly detection in complex networks. The heart of our model lies in the integration of GCNs that capture complex structural relationships within the network data. This is further bolstered by deep residual learning, which is employed to model intricate nonlinear connections directly from input data. A pivotal innovation in our approach is the incorporation of a residual-based attention mechanism. This mechanism dynamically adjusts the importance of nodes based on their residual information, thereby significantly enhancing the sensitivity of the model to subtle anomalies. Furthermore, we introduce a novel hypersphere mapping technique in the latent space to distinctly separate normal and anomalous data. This mapping is the key to our model’s ability to pinpoint anomalies with greater precision. An extensive experimental setup was used to validate the efficacy of the proposed model. Using attributed social network datasets, we demonstrate that our model not only competes with but also surpasses existing state-of-the-art methods in anomaly detection. The results show the exceptional capability of our model to handle the multifaceted nature of real-world networks.

MARML: Motif-Aware Deep Representation Learning in Multilayer Networks.

The rapid increase in high-throughput, complex, and heterogeneous data has led to the adoption of network-structured models and analyses for interpretation. However, these data are inherently complex and challenging to understand, prompting researchers to turn to graph embedding methods to facilitate analysis. While general network embedding techniques have shown promise in improving downstream prediction and classification tasks, real-world data are complicated due to cross-domain interactions between different types of entities. Multilayered networks have been successful in integrating biological data to represent biological systems' hierarchy, but embedding nodes based on different types of interactions remains an unsolved problem. To address this challenge, we propose the Motif-aware deep representation learning in multilayer (MARML) networks for learning network representations. Our method considers recurring motif patterns, topological information, and attributive information from other sources as node features. We validated the MARML method using various multilayer network datasets. In addition, by incorporating motif information, MARML considers higher order connections across different hierarchies. The learned features exhibited excellent accuracy in tasks related to link prediction and link differentiation, enabling us to distinguish between existing and disconnected triplets. Through the integration of both intrinsic node attributes and topological network structures, we enhance our understanding of complex biological systems.

A Dominance Approach for Influence Maximization with Incomplete Information in Social Network

Influence maximization plays an important role in social network analysis and has been extensively explored due to its emergence in a great deal of applications. However, a vast majority of researchers have only considered the influence of one factor on the spread of information among individuals. In addition, this factor which is mainly the influence probability, has been considered to be fixed which is estimated based on the number of neighbors of each individual. While, in reality, we do not have complete information about this probability and it is not a fixed value. Moreover, in the spread of information, other factors including trust, are also involved, which cannot be easily combined due to their different nature. In this paper, a dominance approach to influence maximization is studied under the condition, in which, complete information about influence of users on each other is not available and users infect each other based on an unknown influence probability. Furthermore, in order to make the proposed model closer to reality, trust factor is also considered as an independent factor. The proposed method is compared to several state-of-the-art influence maximization algorithms and attained results on several synthetic and real social network datasets verify effectiveness of the proposed method compared to previous methods in the context of influence maximization.