CRB:A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization

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.

Application of Self-Organizing Feature Map Neural Network Based on K-means Clustering in Network Intrusion Detection

Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one of the most important technologies in network security detection.The accuracy of network intrusion detection has reached higher accuracy so far.However,these methods have very low efficiency in network intrusion detection,even the most popular SOM neural network method.In this paper,an efficient and fast network intrusion detection method was proposed.Firstly,the fundamental of the two different methods are introduced respectively.Then,the selforganizing feature map neural network based on K-means clustering(KSOM)algorithms was presented to improve the efficiency of network intrusion detection.Finally,the NSLKDD is used as network intrusion data set to demonstrate that the KSOM method can significantly reduce the number of clustering iteration than SOM method without substantially affecting the clustering results and the accuracy is much higher than Kmeans method.The Experimental results show that our method can relatively improve the accuracy of network intrusion and significantly reduce the number of clustering iteration.

Co-evolution of the brand effect and competitiveness in evolving networks

The principle that ＇the brand effect is attractive＇ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general frame- work that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general, the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes＇ properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment, the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model.

Modified imperialist competitive algorithm-based neural network to determine shear strength of concrete beams reinforced with FRP

Fiber reinforced polymers (FRPs), unlike steel, are corrosion-resistant and therefore are of interest;however, their use is hindered because their brittle shear is formulated in most specifications using limited data available at the time. We aimed to predict the shear strength of concrete beams reinforced with FRP bars and without stirrups by compiling a relatively large database of 198 previously published test results (available in appendix). To model shear strength, an artificial neural network was trained by an ensemble of Levenberg-Marquardt and imperialist competitive algorithms. The results suggested superior accuracy of model compared to equations available in specifications and literature.

New results on global exponential stability of competitive neural networks with different time scales and time-varying delays

This paper studies the global exponential stability of competitive neural networks with different time scales and time-varying delays. By using the method of the proper Lyapunov functions and inequality technique, some sufficient conditions are presented for global exponential stability of delay competitive neural networks with different time scales. These conditions obtained have important leading significance in the designs and applications of global exponential stability for competitive neural networks. Finally, an example with its simulation is provided to demonstrate the usefulness of the proposed criteria.

Waterlogging risk assessment based on self-organizing map(SOM)artificial neural networks:a case study of an urban storm in Beijing

Due to rapid urbanization, waterlogging induced by torrential rainfall has become a global concern and a potential risk affecting urban habitant's safety. Widespread waterlogging disasters haveoccurred almost annuallyinthe urban area of Beijing, the capital of China. Based on a selforganizing map(SOM) artificial neural network(ANN), a graded waterlogging risk assessment was conducted on 56 low-lying points in Beijing, China. Social risk factors, such as Gross domestic product(GDP), population density, and traffic congestion, were utilized as input datasets in this study. The results indicate that SOM-ANNis suitable for automatically and quantitatively assessing risks associated with waterlogging. The greatest advantage of SOM-ANN in the assessment of waterlogging risk is that a priori knowledge about classification categories and assessment indicator weights is not needed. As a result, SOM-ANN can effectively overcome interference from subjective factors,producing classification results that are more objective and accurate. In this paper, the risk level of waterlogging in Beijing was divided into five grades. The points that were assigned risk grades of IV or Vwere located mainly in the districts of Chaoyang, Haidian, Xicheng, and Dongcheng.

A SPEECH RECOGNITION METHOD USING COMPETITIVE AND SELECTIVE LEARNING NEURAL NETWORKS

On the basis of asymptotic theory of Gersho, the isodistortion principle of vector clustering was discussed and a kind of competitive and selective learning method (CSL) which may avoid local optimization and have excellent result in application to clusters of HMM model was also proposed. In combining the parallel, self organizational hierarchical neural networks (PSHNN) to reclassify the scores of every form output by HMM, the CSL speech recognition rate is obviously elevated.

Research of Dynamic Competitive Learning in Neural Networks

Introduce a method of generation of new units within a cluster and aalgorithm of generating new clusters. The model automatically builds up its dynamically growinginternal representation structure during the learning process. Comparing model with other typicalclassification algorithm such as the Kohonen's self-organizing map, the model realizes a multilevelclassification of the input pattern with an optional accuracy and gives a strong support possibilityfor the parallel computational main processor. The idea is suitable for the high-level storage ofcomplex datas structures for object recognition.

A self-organizing shortest path finding strategy on complex networks

The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.

A novel fractional uplink power control framework for self-organizing networks

Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).

Self-Organizing Genetic Algorithm Based Method for Constructing Bayesian Networks from Databases

The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed.

A Self-Organizing Memory Neural Network for Aerosol Concentration Prediction

Haze-fog,which is an atmospheric aerosol caused by natural or man-made factors,seriously affects the physical and mental health of human beings.PM2.5(a particulate matter whose diameter is smaller than or equal to 2.5 microns)is the chief culprit causing aerosol.To forecast the condition of PM2.5,this paper adopts the related the meteorological data and air pollutes data to predict the concentration of PM2.5.Since the meteorological data and air pollutes data are typical time series data,it is reasonable to adopt a machine learning method called Single Hidden-Layer Long Short-Term Memory Neural Network(SSHL-LSTMNN)containing memory capability to implement the prediction.However,the number of neurons in the hidden layer is difficult to decide unless manual testing is operated.In order to decide the best structure of the neural network and improve the accuracy of prediction,this paper employs a self-organizing algorithm,which uses Information Processing Capability(IPC)to adjust the number of the hidden neurons automatically during a learning phase.In a word,to predict PM2.5 concentration accurately,this paper proposes the SSHL-LSTMNN to predict PM2.5 concentration.In the experiment,not only the hourly precise prediction but also the daily longer-term prediction is taken into account.At last,the experimental results reflect that SSHL-LSTMNN performs the best.

An Interval-valued Fuzzy Competitive Neural Network

Because interval value is quite natural in clustering, an interval-valued fuzzy competitive neural network is proposed. Firstly, this paper proposes several definitions of distance relating to interval number. And then, it indicates the method of preprocessing input data, the structure of the network and the learning algorithm of the interval-valued fuzzy competitive neural network. This paper also analyses the principle of the learning algorithm. At last, an experiment is used to test the validity of the network.

Unequal Development and Territorial Competitiveness of Network Economy

The territorial consideration is enclosed in the development of network economy and e-Business, and there is no departure of the cultivation of e-Business from the establishment of territorial competitiveness. The traditional theory of the territorial competitiveness has come across a serious impact from the Internet. So the development of Intemet infrastructures and institutional environment would be something new to the theory of territorial competitiveness in the Internet era.

Research on the credit classification of practicing qualification personnel in construction market based on self-organizing neural network

Combining with the characters of the practicing qualification personnel in construction market,evaluation method based on the self-organizing neural network is brought out to analyze the credit classification of the practicing qualification personnel. And the impact factors on the credit classification of the practicing qualification personnel,such as the number of neurons,the training steps,the dimension of neurons and the field of winning neurons are studied. Then a self-organizing competitive neural network is built. At last,a case study is conducted by taking practicing qualification personnel as an example. The research result reveals that the method can efficiently evaluate the credit of the practicing qualification personnel;thus,it could provide scientific advice to the construction enterprise to prevent relevant discreditable behaviors of some practicing qualification personnel.

Enhanced Self-Organizing Map Neural Network for DNA Sequence Classification

The artificial neural networks (ANNs), among different soft computing methodologies are widely used to meet the challenges thrown by the main objectives of data mining classification techniques, due to their robust, powerful, distributed, fault tolerant computing and capability to learn in a data-rich environment. ANNs has been used in several fields, showing high performance as classifiers. The problem of dealing with non numerical data is one major obstacle prevents using them with various data sets and several domains. Another problem is their complex structure and how hands to interprets. Self-Organizing Map (SOM) is type of neural systems that can be easily interpreted, but still can’t be used with non numerical data directly. This paper presents an enhanced SOM structure to cope with non numerical data. It used DNA sequences as the training dataset. Results show very good performance compared to other classifiers. For better evaluation both micro-array structure and their sequential representation as proteins were targeted as dataset accuracy is measured accordingly.

Impact of Self-Organizing Networks Deployment on Wireless Service Provider Businesses in China

Decoupling of revenues with network traffic and extreme penetration of expenses in wireless network leads to the critical situation for wireless service providers (WSP), as more wireless network is complex due to its heterogeneity in the context of planning, software & hardware installation, radio parameters setting, drive testing, optimization, healing and maintenance. These operations are time-consuming, labor & budget-intensive and error-prone if activated manually. Hence new approaches have to be designed and applied to meet those demands in a cost-effective way, Self-organizing networks (SON), is a promising approach to handle manual tasks with autonomous manners. More specifically the self-directed functions (self-planning, self-deployment, self-configuration, self-optimization and self-healing) are aid to reduce capital expenditure (CAPEX), implementation expenditure (IMPEX) and operational expenditure (OPEX). In this study, first we investigate the aforementioned impact factors of cost combined with self-functions. Then, we analyze the relative cost benefits causing from deploying the SON functions, using the economical method to have more precise results concerning those potential benefits. At last, the result shows that there is a significant difference in expenses and revenues of WSP with and without SON after enabling self-functions in wireless network.

An Evaluation of Network Competitiveness and the Effects of LCCs on South Korea’s Network Connectivity:Using Aviation Market Data

LCCs(low cost carriers)are expanding their routes,which is affecting airport network connectivity.The subsequent increases in market competition and the number of airlines operating in air network routes have made the centrality analysis more significant because it can be used to identify airport network connectivity competitiveness.This study analyzes the network connectivity competitiveness of South Korea among Asian airports using the MIDT(marketing information data transfer)dataset provided by OAG Traffic Analyser,which provides data collected from regional Asian airports since 2011.The network centrality of individual airports is estimated to compare network connectivity competitiveness in Asia.Measures for overall network centrality include degree,closeness and betweenness centrality.This network centrality analysis may be helpful for South Korean airports in identifying their network performance and competitive position in Asia and confirming the effects that LCCs have on airport network connectivity.The results indicate that South Korea’s aviation market needs to expand its network via a strategy that prioritizes the strengthening of airport connectivity and the pursuit of liberalization.In addition,LCC operations will support Korea’s network growth via the various strategies that they employ.Consequently,this in turn will bolster the overall market competitiveness of South Korean airports.

Selecting Seeds for Competitive Influence Spread Maximization in Social Networks

There exist two or more competing products in viral marketing, and the companies can exploit the social interactions of users to propagate the awareness of products. In this paper, we focus on selecting seeds for maximizing the competitive influence spread in social networks. First, we establish the possible graphs based on the propagation probability of edges, and then we use the competitive influence spread model (CISM) to model the competitive spread under the possible graph. Further, we consider the objective function of selecting k seeds of one product under the CISM when the seeds of another product have been known, which is monotone and submodular, and thus we use the CELF (cost-effective lazy forward) algorithm to accelerate the greedy algorithm that can approximate the optimal with 1 ? 1/e. Experimental results verify the feasibility and effectiveness of our method.

Tele-Network Design Based on Queue Competition Algorithm

In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.