Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks,...Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.展开更多
The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is sprea...The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time.展开更多
Influence maximization of temporal social networks(IMT)is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread.To solve the IMT ...Influence maximization of temporal social networks(IMT)is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread.To solve the IMT problem,we propose an influence maximization algorithm based on an improved K-shell method,namely improved K-shell in temporal social networks(KT).The algorithm takes into account the global and local structures of temporal social networks.First,to obtain the kernel value Ks of each node,in the global scope,it layers the network according to the temporal characteristic of nodes by improving the K-shell method.Then,in the local scope,the calculation method of comprehensive degree is proposed to weigh the influence of nodes.Finally,the node with the highest comprehensive degree in each core layer is selected as the seed.However,the seed selection strategy of KT can easily lose some influential nodes.Thus,by optimizing the seed selection strategy,this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization(KTIM).According to the hierarchical distribution of cores,the algorithm adds nodes near the central core to the candidate seed set.It then searches for seeds in the candidate seed set according to the comprehensive degree.Experiments showthatKTIMis close to the best performing improved method for influence maximization of temporal graph(IMIT)algorithm in terms of effectiveness,but runs at least an order of magnitude faster than it.Therefore,considering the effectiveness and efficiency simultaneously in temporal social networks,the KTIM algorithm works better than other baseline algorithms.展开更多
Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most exi...Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.展开更多
In micro-blogging contexts such as Twitter,the number of content producers can easily reach tens of thousands,and many users can participate in discussion of any given topic.While many users can introduce diversity,as...In micro-blogging contexts such as Twitter,the number of content producers can easily reach tens of thousands,and many users can participate in discussion of any given topic.While many users can introduce diversity,as not all users are equally influential,it makes it challenging to identify the true influencers,who are generally rated as being interesting and authoritative on a given topic.In this study,the influence of users is measured by performing random walks of the multi-relational data in micro-blogging:retweet,reply,reintroduce,and read.Due to the uncertainty of the reintroduce and read operations,a new method is proposed to determine the transition probabilities of uncertain relational networks.Moreover,we propose a method for performing the combined random walks for the multi-relational influence network,considering both the transition probabilities for intra-and inter-networking.Experiments were conducted on a real Twitter dataset containing about 260 000 users and 2.7million tweets,and the results show that our method is more effective than TwitterRank and other methods used to discover influencers.展开更多
Online social networks have gradually permeated into every aspect of people's life.As a research hotspot in social network, user influence is of theoretical and practical significant for information transmission, ...Online social networks have gradually permeated into every aspect of people's life.As a research hotspot in social network, user influence is of theoretical and practical significant for information transmission, optimization and integration. A prominent application is a viral marketing campaign which aims to use a small number of targeted infl uence users to initiate cascades of infl uence that create a global increase in product adoption. In this paper, we analyze mainly evaluation methods of user infl uence based on IDM evaluation model, Page Rank evaluation model, use behavior model and some other popular influence evaluation models in currently social network. And then, we extract the core idea of these models to build our influence evaluation model from two aspects, relationship and activity. Finally, the proposed approach was validated on real world datasets,and the result of experiments shows that our method is both effective and stable.展开更多
This paper aims to effectively solve the problem of the influence maximization in social networks.For this purpose,an influence maximization method that can identify influential nodes via the community structure and t...This paper aims to effectively solve the problem of the influence maximization in social networks.For this purpose,an influence maximization method that can identify influential nodes via the community structure and the influence distribution difference is proposed.Firstly,the network embedding-based community detection approach is developed,by which the social network is divided into several high-quality communities.Secondly,the solution of influence maximization is composed of the candidate stage and the greedy stage.The candidate stage is to select candidate nodes from the interior and the boundary of each community using a heuristic algorithm,and the greedy stage is to determine seed nodes with the largest marginal influence increment from the candidate set through the sub-modular property-based Greedy algorithm.Finally,experimental results demonstrate the superiority of the proposed method compared with existing methods,from which one can further find that our work can achieve a good tradeoff between the influence spread and the running time.展开更多
Public opinion propagation control is one of the hot topics in contemporary social network research. With the rapid dissemination of information over the Internet, the traditional isolation and vaccination strategies ...Public opinion propagation control is one of the hot topics in contemporary social network research. With the rapid dissemination of information over the Internet, the traditional isolation and vaccination strategies can no longer achieve satisfactory results. A positive guidance technology for public opinion diffusion is urgently needed. First, based on the analysis of influence network controllability and public opinion diffusion, a positive guidance technology is proposed and a new model that supports external control is established. Second, in combination with the influence network, a public opinion propagation influence network model is designed and a public opinion control point selection algorithm(POCDNSA) is proposed. Finally, An experiment verified that this algorithm can lead to users receiving the correct guidance quickly and accurately, reducing the impact of false public opinion information; the effect of CELF is no better than that of the POCDNSA algorithm. The main reason is that the former is completely based on the diffusion cascade information contained in the training data, but does not consider the specific situation of the network structure and the diffusion of public opinion information in the closed set. thus, the effectiveness and feasibility of the algorithm is proven. The findings of this article therefore provide useful insights for the implementation of public opinion control.展开更多
The interception probability of a single missile is the basis for combat plan design and weapon performance evaluation,while its influencing factors are complex and mutually coupled.Existing calculation methods have v...The interception probability of a single missile is the basis for combat plan design and weapon performance evaluation,while its influencing factors are complex and mutually coupled.Existing calculation methods have very limited analysis of the influence mechanism of influencing factors,and none of them has analyzed the influence of the guidance law.This paper considers the influencing factors of both the interceptor and the target more comprehensively.Interceptor parameters include speed,guidance law,guidance error,fuze error,and fragment killing ability,while target performance includes speed,maneuverability,and vulnerability.In this paper,an interception model is established,Monte Carlo simulation is carried out,and the influence mechanism of each factor is analyzed based on the model and simulation results.Finally,this paper proposes a classification-regression neural network to quickly estimate the interception probability based on the value of influencing factors.The proposed method reduces the interference of invalid interception data to valid data,so its prediction accuracy is significantly better than that of pure regression neural networks.展开更多
The authors propose an informed search greedy approach that efficiently identifies the influencer nodes in the social Internet of Things with the ability to provide legitimate information.Primarily,the proposed approa...The authors propose an informed search greedy approach that efficiently identifies the influencer nodes in the social Internet of Things with the ability to provide legitimate information.Primarily,the proposed approach minimizes the network size and eliminates undesirable connections.For that,the proposed approach ranks each of the nodes and prioritizes them to identify an authentic influencer.Therefore,the proposed approach discards the nodes having a rank(α)lesser than 0.5 to reduce the network complexity.αis the variable value represents the rank of each node that varies between 0 to 1.Node with the higher value ofαgets the higher priority and vice versa.The threshold valueα=0.5 defined by the authors with respect to their network pruning requirements that can be vary with respect to other research problems.Finally,the algorithm in the proposed approach traverses the trimmed network to identify the authentic node to obtain the desired information.The performance of the proposed method is evaluated in terms of time complexity and accuracy by executing the algorithm on both the original and pruned networks.Experimental results show that the approach identifies authentic influencers on a resultant network in significantly less time than in the original network.Moreover,the accuracy of the proposed approach in identifying the influencer node is significantly higher than that of the original network.Furthermore,the comparison of the proposed approach with the existing approaches demonstrates its efficiency in terms of time consumption and network traversal through the minimum number of hops.展开更多
In real-world networks,there usually exist a small set of nodes that play an important role in the structure and function of networks.Those vital nodes can influence most of other nodes in the network via a spreading ...In real-world networks,there usually exist a small set of nodes that play an important role in the structure and function of networks.Those vital nodes can influence most of other nodes in the network via a spreading process.While most of the existing works focused on vital nodes that can maximize the spreading size in the final stage,which we call final influencers,recent work proposed the idea of fast influencers,which emphasizes nodes’spreading capacity at the early stage.Despite the recent surge of efforts in identifying these two types of influencers in networks,there remained limited research on untangling the differences between the fast influencers and final influencers.In this paper,we firstly distinguish the two types of influencers:fast-only influencers and final-only influencers.The former is defined as individuals who can achieve a high spreading effect at the early stage but lose their superiority in the final stage,and the latter are those individuals that fail to exhibit a prominent spreading performance at the early stage but influence a large fraction of nodes at the final stage.Further experiments are based on eight empirical datasets,and we reveal the key differences between the two types of influencers concerning their spreading capacity and the local structures.We also analyze how network degree assortativity influences the fraction of the proposed two types of influencers.The results demonstrate that with the increase of degree assortativity,the fraction of the fast-only influencers decreases,which indicates that more fast influencers tend to keep their superiority at the final stage.Our study provides insights into the differences and evolution of different types of influencers and has important implications for various empirical applications,such as advertisement marketing and epidemic suppressing.展开更多
On the basis of measuring the regional high-quality development in China from 2011 to 2020,this study uses gravity model to build spatial correlation network,and uses social network analysis method to analyze the stru...On the basis of measuring the regional high-quality development in China from 2011 to 2020,this study uses gravity model to build spatial correlation network,and uses social network analysis method to analyze the structural characteristics and influencing factors of correlation network.The results are shown as follows.First,from 2011 to 2020,the level of regional high-quality development in China is rising gradually,and the discrete characteristics between regions are gradually obvious,showing a step-like distribution structure decreasing from east to west.Second,the network density of regional high-quality development is generally low and tends to decline,but it has strong stability and correlation strength.Third,the spatial correlation network has an obvious core-edge structure.Shanghai is always at the center of the network and plays a significant intermediary role,while Qinghai and Xinjiang are always at the edge of the network.Fourth,the regional high-quality development association network can be divided into four major sectors:main benefit,net benefit,net spillover,and broker,showing the spatial correlation characteristics of inter-plate contact and intra-plate agglomeration.Fifth,the level of economic development,the level of urbanization and geographical proximity have a significant impact on the formation of regional high-quality development correlation network.展开更多
In a social network analysis the output provided includes many measures and metrics. For each of these measures and metric, the output provides the ability to obtain a rank ordering of the nodes in terms of these meas...In a social network analysis the output provided includes many measures and metrics. For each of these measures and metric, the output provides the ability to obtain a rank ordering of the nodes in terms of these measures. We might use this information in decision making concerning disrupting or deceiving a given network. All is fine when all the measures indicate the same node as the key or influential node. What happens when the measures indicate different key nodes? Our goal in this paper is to explore two methodologies to identify the key players or nodes in a given network. We apply TOPSIS to analyze these outputs to find the most influential nodes as a function of the decision makers' inputs as a process to consider both subjective and objectives inputs through pairwise comparison matrices. We illustrate our results using two common networks from the literature: the Kite network and the Information flow network from Knoke and Wood. We discuss some basic sensitivity analysis can may be applied to the methods. We find the use of TOPSIS as a flexible method to weight the criterion based upon the decision makers' inputs or the topology of the network.展开更多
Purpose: This paper intends to explore methodologies and indicators for the analysis of overlapping structures and evolution properties in a co-citation network, and provide reference for overlapping structure analysi...Purpose: This paper intends to explore methodologies and indicators for the analysis of overlapping structures and evolution properties in a co-citation network, and provide reference for overlapping structure analysis of other scientific networks.Design/methodology/approach: The Q-value variance is defined to achieve overlapping structures of different levels in the scientific networks. At the same time, analyses for time correlation variance and subject correlation variance are used to present the formation of overlapping structures in scientific networks. As a test, a co-citation network of highly cited papers on Molecular Biology & Genetics from Essential Science Indicator(ESI) is taken as an example for an empirical analysis.Findings: Our research showed that the Q-value variance is effective for achieving the desired overlapping structures. Meanwhile, the time correlation variance and subject correlation variance are equally useful for uncovering the evolution progress of scientific research, and the properties of overlapping structures in the research of co-citation network as well.Research limitations: In this paper, the theoretical analysis and verification of time and subject correlation variances are still at its initial stage. Further studies in this regard need to take actual evolution of research areas into consideration.Practical implications: Evolution properties of overlapping structures pave the way for overlapping and evolution analysis of disciplines or areas, this study is of practical value for the planning of scientific and technical innovation.Originality/value: This paper proposes an analytical method of time correlation variance and subject correlation variance based on the evolution properties of overlapping structures, which would provide the foundation for the evolution analysis of disciplines and interdisciplinary research.展开更多
The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy ...The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.展开更多
The problem of influence maximizing in social networks refers to obtaining a set of nodes of a specified size under a specific propagation model so that the aggregation of the node-set in the network has the greatest ...The problem of influence maximizing in social networks refers to obtaining a set of nodes of a specified size under a specific propagation model so that the aggregation of the node-set in the network has the greatest influence.Up to now,most of the research has tended to focus on monolayer network rather than on multiplex networks.But in the real world,most individuals usually exist in multiplex networks.Multiplex networks are substantially different as compared with those of a monolayer network.In this paper,we integrate the multi-relationship of agents in multiplex networks by considering the existing and relevant correlations in each layer of relationships and study the problem of unbalanced distribution between various relationships.Meanwhile,we measure the distribution across the network by the similarity of the links in the different relationship layers and establish a unified propagation model.After that,place on the established multiplex network propagation model,we propose a basic greedy algorithm on it.To reduce complexity,we combine some of the characteristics of triggering model into our algorithm.Then we propose a novel MNStaticGreedy algorithm which is based on the efficiency and scalability of the StaticGreedy algorithm.Our experiments show that the novel model and algorithm are effective,efficient and adaptable.展开更多
A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the unc...A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method(RIM)to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered(SIR) model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness,and eigenvector centrality methods.展开更多
Information diffusion on social media has become a key strategy in people’s daily interactions. This paper studies consumers’ participation in the product information diffusion, and analyzes the complexity of inform...Information diffusion on social media has become a key strategy in people’s daily interactions. This paper studies consumers’ participation in the product information diffusion, and analyzes the complexity of information diffusion which is affected by many factors. Prior investigations of information diffusion have primarily focused on the composition of diffusion networks with independent factors and the intricacy of the process has not been completely evaluated. The majority of prior investigations have focused on strategies and the moving forces in social media processes and the determination of influential seed nodes, with few evaluations conducted about the factors affecting consumers’ choices in information diffusion. In this study, a Bayesian network model of product information diffusion was created to examine the links between factors and consumer deportment. It revealed how those factors had an impact on each other and on consumer deportment choice. The innovation of the thesis is reflected in the exploration and analysis of the specific communication path of product information diffusion, which provides a better marketing idea and practical method for the development of mobile e-commerce. The research findings can help identify the quantitative relationships between the factors affecting the process of product information diffusion and user behavior.展开更多
In the rapid development of science and technology,the Internet has been widely used in the daily life and work of people,which has greatly changed the way people live and work.At this stage,people regard the Internet...In the rapid development of science and technology,the Internet has been widely used in the daily life and work of people,which has greatly changed the way people live and work.At this stage,people regard the Internet as the main way to obtain news information,and they have supervised the news contents[1].Based on this,the article expounds the relevant content of network public opinion,analyzes the role of network public opinion in the public management of Chinese government,and studies the influence of public opinion on the public management of Chinese government.展开更多
Both the "Interim Provisions on Sino-foreign Cooperative Education" and the "Regulation of the People's Republic of China on Sino-Foreigu Cooperative Education" are not specifically mentioned the implementation p...Both the "Interim Provisions on Sino-foreign Cooperative Education" and the "Regulation of the People's Republic of China on Sino-Foreigu Cooperative Education" are not specifically mentioned the implementation proposals to the foreign imported courses.The implementation methods of those introduced courses of China are basically like someone crossing a river by feeling the stones, which lacks the mature theoretical guidance and successful practical experience.The release of "Implementation Proposal to Construction of Excellent Open Courses of Ministry of Education" and the "Notice of 'Construction Measures of the Top-quality Sharing Courses'" have pushed the excellent course construction of vocational colleges into a restructuring and upgrading stage. Focused on the poor teaching effect of current introduced courses appeared in the Sino-foreigu cooperative education, this paper aims to expand teaching time and space of the Sino-foreign cooperative education through the excellent courses construction and network sharing technology.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant Nos.72071153 and 72231008)Laboratory of Science and Technology on Integrated Logistics Support Foundation (Grant No.6142003190102)the Natural Science Foundation of Shannxi Province (Grant No.2020JM486)。
文摘Identifying critical nodes or sets in large-scale networks is a fundamental scientific problem and one of the key research directions in the fields of data mining and network science when implementing network attacks, defense, repair and control.Traditional methods usually begin from the centrality, node location or the impact on the largest connected component after node destruction, mainly based on the network structure.However, these algorithms do not consider network state changes.We applied a model that combines a random connectivity matrix and minimal low-dimensional structures to represent network connectivity.By using mean field theory and information entropy to calculate node activity,we calculated the overlap between the random parts and fixed low-dimensional parts to quantify the influence of node impact on network state changes and ranked them by importance.We applied this algorithm and the proposed importance algorithm to the overall analysis and stratified analysis of the C.elegans neural network.We observed a change in the critical entropy of the network state and by utilizing the proposed method we can calculate the nodes that indirectly affect muscle cells through neural layers.
基金supported by the National Social Science Fund of China (Grant No.23BGL270)。
文摘The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time.
基金Thiswork is supported by theYouth Science and Technology Innovation Personnel Training Project of Heilongjiang(No.UNPYSCT-2020072)the FundamentalResearch Funds for the Universities of Heilongjiang(Nos.145109217,135509234)+1 种基金the Education Science Fourteenth Five-Year Plan 2021 Project of Heilongjiang(No.GJB1421344)the Innovative Research Projects for Postgraduates of Qiqihar University(No.YJSCX2022048).
文摘Influence maximization of temporal social networks(IMT)is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread.To solve the IMT problem,we propose an influence maximization algorithm based on an improved K-shell method,namely improved K-shell in temporal social networks(KT).The algorithm takes into account the global and local structures of temporal social networks.First,to obtain the kernel value Ks of each node,in the global scope,it layers the network according to the temporal characteristic of nodes by improving the K-shell method.Then,in the local scope,the calculation method of comprehensive degree is proposed to weigh the influence of nodes.Finally,the node with the highest comprehensive degree in each core layer is selected as the seed.However,the seed selection strategy of KT can easily lose some influential nodes.Thus,by optimizing the seed selection strategy,this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization(KTIM).According to the hierarchical distribution of cores,the algorithm adds nodes near the central core to the candidate seed set.It then searches for seeds in the candidate seed set according to the comprehensive degree.Experiments showthatKTIMis close to the best performing improved method for influence maximization of temporal graph(IMIT)algorithm in terms of effectiveness,but runs at least an order of magnitude faster than it.Therefore,considering the effectiveness and efficiency simultaneously in temporal social networks,the KTIM algorithm works better than other baseline algorithms.
基金supported by the Fundamental Research Funds for the Universities of Heilongjiang(Nos.145109217,135509234)the Youth Science and Technology Innovation Personnel Training Project of Heilongjiang(No.UNPYSCT-2020072)the Innovative Research Projects for Postgraduates of Qiqihar University(No.YJSCX2022048).
文摘Influence Maximization(IM)aims to select a seed set of size k in a social network so that information can be spread most widely under a specific information propagation model through this set of nodes.However,most existing studies on the IM problem focus on static social network features,while neglecting the features of temporal social networks.To bridge this gap,we focus on node features reflected by their historical interaction behavior in temporal social networks,i.e.,interaction attributes and self-similarity,and incorporate them into the influence maximization algorithm and information propagation model.Firstly,we propose a node feature-aware voting algorithm,called ISVoteRank,for seed nodes selection.Specifically,before voting,the algorithm sets the initial voting ability of nodes in a personalized manner by combining their features.During the voting process,voting weights are set based on the interaction strength between nodes,allowing nodes to vote at different extents and subsequently weakening their voting ability accordingly.The process concludes by selecting the top k nodes with the highest voting scores as seeds,avoiding the inefficiency of iterative seed selection in traditional voting-based algorithms.Secondly,we extend the Independent Cascade(IC)model and propose the Dynamic Independent Cascade(DIC)model,which aims to capture the dynamic features in the information propagation process by combining node features.Finally,experiments demonstrate that the ISVoteRank algorithm has been improved in both effectiveness and efficiency compared to baseline methods,and the influence spread through the DIC model is improved compared to the IC model.
基金supported by National Natural Science Foundation of China under Grants No. 60933005, No. 91124002under Grants No. 012505, No. 2011AA010702, No. 2012AA01A401, No. 2012AA01A402 (863 program)+1 种基金under Grant No.2011A010 (242)NSTM under Grants No.2012BAH38B04, No.2012BAH38B06
文摘In micro-blogging contexts such as Twitter,the number of content producers can easily reach tens of thousands,and many users can participate in discussion of any given topic.While many users can introduce diversity,as not all users are equally influential,it makes it challenging to identify the true influencers,who are generally rated as being interesting and authoritative on a given topic.In this study,the influence of users is measured by performing random walks of the multi-relational data in micro-blogging:retweet,reply,reintroduce,and read.Due to the uncertainty of the reintroduce and read operations,a new method is proposed to determine the transition probabilities of uncertain relational networks.Moreover,we propose a method for performing the combined random walks for the multi-relational influence network,considering both the transition probabilities for intra-and inter-networking.Experiments were conducted on a real Twitter dataset containing about 260 000 users and 2.7million tweets,and the results show that our method is more effective than TwitterRank and other methods used to discover influencers.
基金supported by the Research Fund for the Doctoral Program(New Teachers)Ministry of Education of China under Grant No.20121103120032+2 种基金Humanity and Social Science Youth foundation of Ministry of Education of China under Grant No.13YJCZH065General Program of Science and Technology Development Project of Beijing Municipal Education Commission of China under Grant No.km201410005012Open Research Fund of Beijing Key Laboratory of Trusted Computing,Open Research Fund of Key Laboratory of Trustworthy Distributed Computing and Service(BUPT),Ministry of Education
文摘Online social networks have gradually permeated into every aspect of people's life.As a research hotspot in social network, user influence is of theoretical and practical significant for information transmission, optimization and integration. A prominent application is a viral marketing campaign which aims to use a small number of targeted infl uence users to initiate cascades of infl uence that create a global increase in product adoption. In this paper, we analyze mainly evaluation methods of user infl uence based on IDM evaluation model, Page Rank evaluation model, use behavior model and some other popular influence evaluation models in currently social network. And then, we extract the core idea of these models to build our influence evaluation model from two aspects, relationship and activity. Finally, the proposed approach was validated on real world datasets,and the result of experiments shows that our method is both effective and stable.
基金The authors are grateful to the anonymous reviewers and the editor for their valuable comments and suggestions.This work is supported by Natural Science Foundation of China(Grant Nos.61702066 and 11747125)Major Project of Science and Technology Research Program of Chongqing Education Commission of China(Grant No.KJZD-M201900601)+3 种基金Chongqing Research Program of Basic Research and Frontier Technology(Grant Nos.cstc2017jcyjAX0256 and cstc2018jcy-jAX0154)Project Supported by Chongqing Municipal Key Laboratory of Institutions of Higher Education(Grant No.cqupt-mct-201901)Tech-nology Foundation of Guizhou Province(QianKeHeJiChu[2020]1Y269)New academic seedling cultivation and exploration innovation project(QianKeHe Platform Talents[2017]5789-21).
文摘This paper aims to effectively solve the problem of the influence maximization in social networks.For this purpose,an influence maximization method that can identify influential nodes via the community structure and the influence distribution difference is proposed.Firstly,the network embedding-based community detection approach is developed,by which the social network is divided into several high-quality communities.Secondly,the solution of influence maximization is composed of the candidate stage and the greedy stage.The candidate stage is to select candidate nodes from the interior and the boundary of each community using a heuristic algorithm,and the greedy stage is to determine seed nodes with the largest marginal influence increment from the candidate set through the sub-modular property-based Greedy algorithm.Finally,experimental results demonstrate the superiority of the proposed method compared with existing methods,from which one can further find that our work can achieve a good tradeoff between the influence spread and the running time.
基金sponsored by the Natural Science Foundation of Heilongjiang Province of China under Grant No.LC2016024Natural Science Foundation of the Jiangsu Higher Education Institutions Grant No.17KJB520044 and 16KJB510024
文摘Public opinion propagation control is one of the hot topics in contemporary social network research. With the rapid dissemination of information over the Internet, the traditional isolation and vaccination strategies can no longer achieve satisfactory results. A positive guidance technology for public opinion diffusion is urgently needed. First, based on the analysis of influence network controllability and public opinion diffusion, a positive guidance technology is proposed and a new model that supports external control is established. Second, in combination with the influence network, a public opinion propagation influence network model is designed and a public opinion control point selection algorithm(POCDNSA) is proposed. Finally, An experiment verified that this algorithm can lead to users receiving the correct guidance quickly and accurately, reducing the impact of false public opinion information; the effect of CELF is no better than that of the POCDNSA algorithm. The main reason is that the former is completely based on the diffusion cascade information contained in the training data, but does not consider the specific situation of the network structure and the diffusion of public opinion information in the closed set. thus, the effectiveness and feasibility of the algorithm is proven. The findings of this article therefore provide useful insights for the implementation of public opinion control.
基金supported by the Foundation Strengthening Program Technology Field Foundation(2020-JCJQ-JJ-132)。
文摘The interception probability of a single missile is the basis for combat plan design and weapon performance evaluation,while its influencing factors are complex and mutually coupled.Existing calculation methods have very limited analysis of the influence mechanism of influencing factors,and none of them has analyzed the influence of the guidance law.This paper considers the influencing factors of both the interceptor and the target more comprehensively.Interceptor parameters include speed,guidance law,guidance error,fuze error,and fragment killing ability,while target performance includes speed,maneuverability,and vulnerability.In this paper,an interception model is established,Monte Carlo simulation is carried out,and the influence mechanism of each factor is analyzed based on the model and simulation results.Finally,this paper proposes a classification-regression neural network to quickly estimate the interception probability based on the value of influencing factors.The proposed method reduces the interference of invalid interception data to valid data,so its prediction accuracy is significantly better than that of pure regression neural networks.
基金This work was supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(No.2021R1A5A1021944 and 2021R1I1A3048013)Additionally,the research was supported by Kyungpook National University Research Fund,2020.
文摘The authors propose an informed search greedy approach that efficiently identifies the influencer nodes in the social Internet of Things with the ability to provide legitimate information.Primarily,the proposed approach minimizes the network size and eliminates undesirable connections.For that,the proposed approach ranks each of the nodes and prioritizes them to identify an authentic influencer.Therefore,the proposed approach discards the nodes having a rank(α)lesser than 0.5 to reduce the network complexity.αis the variable value represents the rank of each node that varies between 0 to 1.Node with the higher value ofαgets the higher priority and vice versa.The threshold valueα=0.5 defined by the authors with respect to their network pruning requirements that can be vary with respect to other research problems.Finally,the algorithm in the proposed approach traverses the trimmed network to identify the authentic node to obtain the desired information.The performance of the proposed method is evaluated in terms of time complexity and accuracy by executing the algorithm on both the original and pruned networks.Experimental results show that the approach identifies authentic influencers on a resultant network in significantly less time than in the original network.Moreover,the accuracy of the proposed approach in identifying the influencer node is significantly higher than that of the original network.Furthermore,the comparison of the proposed approach with the existing approaches demonstrates its efficiency in terms of time consumption and network traversal through the minimum number of hops.
基金supported by the National Natural Science Foundation of China(Grant Nos.61673150 and 11622538)Special Project for the Central Guidance on Local Science and Technology Development of Sichuan Province,China(Project No.2021ZYD0029)。
文摘In real-world networks,there usually exist a small set of nodes that play an important role in the structure and function of networks.Those vital nodes can influence most of other nodes in the network via a spreading process.While most of the existing works focused on vital nodes that can maximize the spreading size in the final stage,which we call final influencers,recent work proposed the idea of fast influencers,which emphasizes nodes’spreading capacity at the early stage.Despite the recent surge of efforts in identifying these two types of influencers in networks,there remained limited research on untangling the differences between the fast influencers and final influencers.In this paper,we firstly distinguish the two types of influencers:fast-only influencers and final-only influencers.The former is defined as individuals who can achieve a high spreading effect at the early stage but lose their superiority in the final stage,and the latter are those individuals that fail to exhibit a prominent spreading performance at the early stage but influence a large fraction of nodes at the final stage.Further experiments are based on eight empirical datasets,and we reveal the key differences between the two types of influencers concerning their spreading capacity and the local structures.We also analyze how network degree assortativity influences the fraction of the proposed two types of influencers.The results demonstrate that with the increase of degree assortativity,the fraction of the fast-only influencers decreases,which indicates that more fast influencers tend to keep their superiority at the final stage.Our study provides insights into the differences and evolution of different types of influencers and has important implications for various empirical applications,such as advertisement marketing and epidemic suppressing.
文摘On the basis of measuring the regional high-quality development in China from 2011 to 2020,this study uses gravity model to build spatial correlation network,and uses social network analysis method to analyze the structural characteristics and influencing factors of correlation network.The results are shown as follows.First,from 2011 to 2020,the level of regional high-quality development in China is rising gradually,and the discrete characteristics between regions are gradually obvious,showing a step-like distribution structure decreasing from east to west.Second,the network density of regional high-quality development is generally low and tends to decline,but it has strong stability and correlation strength.Third,the spatial correlation network has an obvious core-edge structure.Shanghai is always at the center of the network and plays a significant intermediary role,while Qinghai and Xinjiang are always at the edge of the network.Fourth,the regional high-quality development association network can be divided into four major sectors:main benefit,net benefit,net spillover,and broker,showing the spatial correlation characteristics of inter-plate contact and intra-plate agglomeration.Fifth,the level of economic development,the level of urbanization and geographical proximity have a significant impact on the formation of regional high-quality development correlation network.
文摘In a social network analysis the output provided includes many measures and metrics. For each of these measures and metric, the output provides the ability to obtain a rank ordering of the nodes in terms of these measures. We might use this information in decision making concerning disrupting or deceiving a given network. All is fine when all the measures indicate the same node as the key or influential node. What happens when the measures indicate different key nodes? Our goal in this paper is to explore two methodologies to identify the key players or nodes in a given network. We apply TOPSIS to analyze these outputs to find the most influential nodes as a function of the decision makers' inputs as a process to consider both subjective and objectives inputs through pairwise comparison matrices. We illustrate our results using two common networks from the literature: the Kite network and the Information flow network from Knoke and Wood. We discuss some basic sensitivity analysis can may be applied to the methods. We find the use of TOPSIS as a flexible method to weight the criterion based upon the decision makers' inputs or the topology of the network.
基金supported by the National Science Library of Chinese Academy of Sciences
文摘Purpose: This paper intends to explore methodologies and indicators for the analysis of overlapping structures and evolution properties in a co-citation network, and provide reference for overlapping structure analysis of other scientific networks.Design/methodology/approach: The Q-value variance is defined to achieve overlapping structures of different levels in the scientific networks. At the same time, analyses for time correlation variance and subject correlation variance are used to present the formation of overlapping structures in scientific networks. As a test, a co-citation network of highly cited papers on Molecular Biology & Genetics from Essential Science Indicator(ESI) is taken as an example for an empirical analysis.Findings: Our research showed that the Q-value variance is effective for achieving the desired overlapping structures. Meanwhile, the time correlation variance and subject correlation variance are equally useful for uncovering the evolution progress of scientific research, and the properties of overlapping structures in the research of co-citation network as well.Research limitations: In this paper, the theoretical analysis and verification of time and subject correlation variances are still at its initial stage. Further studies in this regard need to take actual evolution of research areas into consideration.Practical implications: Evolution properties of overlapping structures pave the way for overlapping and evolution analysis of disciplines or areas, this study is of practical value for the planning of scientific and technical innovation.Originality/value: This paper proposes an analytical method of time correlation variance and subject correlation variance based on the evolution properties of overlapping structures, which would provide the foundation for the evolution analysis of disciplines and interdisciplinary research.
基金Project supported by the Zhejiang Provincial Natural Science Foundation (Grant No.LQ20F020011)the Gansu Provincial Foundation for Distinguished Young Scholars (Grant No.23JRRA766)+1 种基金the National Natural Science Foundation of China (Grant No.62162040)the National Key Research and Development Program of China (Grant No.2020YFB1713600)。
文摘The influence maximization problem aims to select a small set of influential nodes, termed a seed set, to maximize their influence coverage in social networks. Although the methods that are based on a greedy strategy can obtain good accuracy, they come at the cost of enormous computational time, and are therefore not applicable to practical scenarios in large-scale networks. In addition, the centrality heuristic algorithms that are based on network topology can be completed in relatively less time. However, they tend to fail to achieve satisfactory results because of drawbacks such as overlapped influence spread. In this work, we propose a discrete two-stage metaheuristic optimization combining quantum-behaved particle swarm optimization with Lévy flight to identify a set of the most influential spreaders. According to the framework,first, the particles in the population are tasked to conduct an exploration in the global solution space to eventually converge to an acceptable solution through the crossover and replacement operations. Second, the Lévy flight mechanism is used to perform a wandering walk on the optimal candidate solution in the population to exploit the potentially unidentified influential nodes in the network. Experiments on six real-world social networks show that the proposed algorithm achieves more satisfactory results when compared to other well-known algorithms.
基金This work is supported in part by the National Natural Science Foundation of China under Grant No.61672022.
文摘The problem of influence maximizing in social networks refers to obtaining a set of nodes of a specified size under a specific propagation model so that the aggregation of the node-set in the network has the greatest influence.Up to now,most of the research has tended to focus on monolayer network rather than on multiplex networks.But in the real world,most individuals usually exist in multiplex networks.Multiplex networks are substantially different as compared with those of a monolayer network.In this paper,we integrate the multi-relationship of agents in multiplex networks by considering the existing and relevant correlations in each layer of relationships and study the problem of unbalanced distribution between various relationships.Meanwhile,we measure the distribution across the network by the similarity of the links in the different relationship layers and establish a unified propagation model.After that,place on the established multiplex network propagation model,we propose a basic greedy algorithm on it.To reduce complexity,we combine some of the characteristics of triggering model into our algorithm.Then we propose a novel MNStaticGreedy algorithm which is based on the efficiency and scalability of the StaticGreedy algorithm.Our experiments show that the novel model and algorithm are effective,efficient and adaptable.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61374180 and 61373136)the Ministry of Education Research in the Humanities and Social Sciences Planning Fund Project,China(Grant No.12YJAZH120)the Six Projects Sponsoring Talent Summits of Jiangsu Province,China(Grant No.RLD201212)
文摘A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method(RIM)to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered(SIR) model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness,and eigenvector centrality methods.
文摘Information diffusion on social media has become a key strategy in people’s daily interactions. This paper studies consumers’ participation in the product information diffusion, and analyzes the complexity of information diffusion which is affected by many factors. Prior investigations of information diffusion have primarily focused on the composition of diffusion networks with independent factors and the intricacy of the process has not been completely evaluated. The majority of prior investigations have focused on strategies and the moving forces in social media processes and the determination of influential seed nodes, with few evaluations conducted about the factors affecting consumers’ choices in information diffusion. In this study, a Bayesian network model of product information diffusion was created to examine the links between factors and consumer deportment. It revealed how those factors had an impact on each other and on consumer deportment choice. The innovation of the thesis is reflected in the exploration and analysis of the specific communication path of product information diffusion, which provides a better marketing idea and practical method for the development of mobile e-commerce. The research findings can help identify the quantitative relationships between the factors affecting the process of product information diffusion and user behavior.
文摘In the rapid development of science and technology,the Internet has been widely used in the daily life and work of people,which has greatly changed the way people live and work.At this stage,people regard the Internet as the main way to obtain news information,and they have supervised the news contents[1].Based on this,the article expounds the relevant content of network public opinion,analyzes the role of network public opinion in the public management of Chinese government,and studies the influence of public opinion on the public management of Chinese government.
文摘Both the "Interim Provisions on Sino-foreign Cooperative Education" and the "Regulation of the People's Republic of China on Sino-Foreigu Cooperative Education" are not specifically mentioned the implementation proposals to the foreign imported courses.The implementation methods of those introduced courses of China are basically like someone crossing a river by feeling the stones, which lacks the mature theoretical guidance and successful practical experience.The release of "Implementation Proposal to Construction of Excellent Open Courses of Ministry of Education" and the "Notice of 'Construction Measures of the Top-quality Sharing Courses'" have pushed the excellent course construction of vocational colleges into a restructuring and upgrading stage. Focused on the poor teaching effect of current introduced courses appeared in the Sino-foreigu cooperative education, this paper aims to expand teaching time and space of the Sino-foreign cooperative education through the excellent courses construction and network sharing technology.