Improved Label Propagation Algorithm Research Articles

Dynamic Division of Control Subareas for Highway Networks Based on Improved Label Propagation Algorithm

Dynamic Division of Control Subareas for Highway Networks Based on Improved Label Propagation Algorithm

Author Name Disambiguation Based on Heterogeneous Graph

<p>Since multiple people share the same name in the real world, this will cause performance degradation to academic search systems and lead to misattribution of publications. The author name disambiguation algorithm has not yet to be well solved. In this paper, we propose a disambiguation method that combines heterogeneous graph-based and improved label propagation, first we construct a publication heterogeneous graph network, then graph neural networks is applied to aggregate the nodes representation and relation types, finally combined with the improved label propagation algorithm to realize clustering. The task of author name disambiguation is completed to improve the retrieval performance. Experimental results on two public datasets show that our method was improved by 2.8% and 4.9% over the suboptimal method, respectively. Our method can effectively reduce the number of publications returning the wrong author and improve the performance of the academic retrieval system.</p> <p> </p>

An improved label propagation algorithm based on community core node and label importance for community detection in sparse network

An improved label propagation algorithm based on community core node and label importance for community detection in sparse network

Semi-supervised feature selection for partially labeled mixed-type data based on multi-criteria measure approach

In many real applications, the data are always collected from different types and they are subjected to obtain partial labeling information of objects. Such data are referred to as partially labeled mixed-type data. There is currently few work on feature selection approaches for these data. Motivated by this issue, this paper aims at selecting the informative feature subset from partially labeled mixed-type data. At first, to improve the classification performance, an improved label propagation algorithm based on K-nearest neighbor is proposed, which marks the decision labels of unlabeled objects by making use of the information between unlabeled objects and labeled objects. On this basis, a feature multi-criteria measure based on the dependency, information entropy and information granulation is proposed for selecting candidate features. Finally, the corresponding semi-supervised feature selection algorithm is developed to select the feature subset for the partially labeled mixed-type data. Experimental results on UCI data sets demonstrate the effectiveness of the proposed feature selection algorithm and the superiority in terms of the classification accuracy compared with other algorithms.

CLCLP: Overlapping Community Detection in Networks Using a Combination of Link Community and Label Propagation Algorithm

Overlapping Community Detection is a tremendous method for accepting a crucial shape and complicated network software. As of overlapping communities descriptions of real-world networks must subsist quantified for community identification, this research suggested a method for discovering overlapping communities termed the Combination of Link Community with Label Propagation (CLCLP) algorithm. CLCLP converts a node separation issue into a link division issue because of its simplicity and competency of the label propagation technique, an improved label propagation algorithm that prioritizes connections over nodes to perceive communities has been developed. The proposed CLCLP then employs post-processing to develop discovered overlapping communities by removing over-overlapping and inaccurate fragile secures partitions. When tested on a large scale of synthetic and real-world networks, the proposed CLCLP approach attains good precision (i.e., accuracy) and NMI (Normalized Mutual Information) in recognizing overlapping communities in networks

GravCPA: Controller Placement Algorithm Based on Traffic Gravitation in SDN

Software-defined network separates the control plane and the data plane, making the network more flexible. With the expansion of the network scale, one centralized controller cannot meet the latency needs of large-scale networks. Therefore, it is necessary to use multicontroller architecture, which has some problems with the controller placement. In this article, we take both the average latency and the worst latency between switch and controller into consideration and make a multi-objective optimization model. An improved label propagation algorithm based on traffic gravitation is proposed to solve the subdomain division problem, and a heuristic method is for subdomain controller placement. The simulation experiments show the effectiveness of the proposed algorithm and the time complexity guarantee for large-scale networks.

Label propagation algorithm for community detection based on Coulomb’s law

Community detection is an important field in social network analysis; it provides a higher level of structure and greater understanding of the network. In this paper, we develop an improved label propagation algorithm for solving the community detection problem based on Coulomb’s Law abbreviated as LPA_CL. Coulomb’s Law in analogy with particles in the physics domain captures the importance of a node within a network by computing a proximity index using the geodesic distance between nodes as punishment. In other words, the adopted proximity index between two nodes of a network integrates both the local and the global structural information of a given network. Moreover, experimental results on real-world networks and artificial networks indicate that the proposed algorithm (LPA_CL) is efficient and effective to be used for community detection of medium and large networks. It has better accuracy and stability and converges LPA in shorter iteration.

Machinery New Emerge Fault Diagnosis Based on Deep Convolution Variational Autoencoder and Adaptive Label Propagation

In the research field of mechanical equipment fault diagnosis, usually only the existing fault types are identified, and the new emerge class of the fault is ignored, however, the new emerge fault class may also occur actually. In order to solve the problem, a novel fault diagnosis model based on deep convolution variational autoencoder network and adaptive label propagation (DCVAN-ALP) is proposed. Firstly, the initial high dimensional features are constructed by using the double tree complex wavelet packet method as the input of the model. Secondly, the convolutional neural network architecture is applied to construct the variational autoencoder, and the local and non-local characteristics of samples are embedded into the loss function for training, which is considered to improve the identification of hidden layer features of the neural network. Finally, t-SNE and the improved label propagation algorithm are adopted to process the hidden features of the neural network, which can achieve the purpose of diagnosing the existing fault class and especially new emerge fault class. Experimental results show that the proposed model can effectively extract the fault characteristics of the vibration signal, and it also has a significantly higher recognition accuracy rate than other typical deep learning methods and traditional classifiers in diagnosing new emerge fault class.

LPA-MNI: An Improved Label Propagation Algorithm Based on Modularity and Node Importance for Community Detection.

Community detection is of great significance in understanding the structure of the network. Label propagation algorithm (LPA) is a classical and effective method, but it has the problems of randomness and instability. An improved label propagation algorithm named LPA-MNI is proposed in this study by combining the modularity function and node importance with the original LPA. LPA-MNI first identify the initial communities according to the value of modularity. Subsequently, the label propagation is used to cluster the remaining nodes that have not been assigned to initial communities. Meanwhile, node importance is used to improve the node order of label updating and the mechanism of label selecting when multiple labels are contained by the maximum number of nodes. Extensive experiments are performed on twelve real-world networks and eight groups of synthetic networks, and the results show that LPA-MNI has better accuracy, higher modularity, and more reasonable community numbers when compared with other six algorithms. In addition, LPA-MNI is shown to be more robust than the traditional LPA algorithm.

TNS-LPA: An Improved Label Propagation Algorithm for Community Detection Based on Two-Level Neighbourhood Similarity

Community detection can not only help people understand organizational structure and function of complex networks, but also attributes to many potential applications including targeted advertising and customer relationship management. Due to the low time complexity, the label propagation algorithm is widely used, but there is still room to improve the community quality and the detection stability. Inspired by resource allocation and local path similarity, we first give a new two-level neighbourhood similarity measure called TNS, and on this basis we propose an improved label propagation algorithm for community detection. In this new algorithm, the minimum distance and local centrality index are considered to select the initial community centers, to ensure that they are both important and far away from each other. In the process of forming initial community, we employ the new similarity measure and an optimization strategy of asynchronously updating labels according to node importance. To further improve the accuracy of community division, we introduce the label influence based on the new similarity measure to further optimize the community division of networks. The experimental results on both the artificial network and ten real-world networks show that our proposed algorithm has better comprehensive performance than several existing algorithms in terms of modularity, normalized mutual information and adjusted rand index.

Improved label propagation algorithm for overlapping community detection

Community detection plays an important role in the analysis of complex networks. However, overlapping community detection in real networks is still a challenge. To address the problems of pre-input parameters and label redundancy, an improved label propagation algorithm (ILPA) that adopts a method based on the influence factor is proposed in this paper. Theoretical analysis and experimental results on both synthetic and real datasets show that the ILPA detects that the overlapping community has higher accuracy compared to other existing methods.

Detecting the Structural Hole for Social Communities Based on Conductance–Degree

It has been shown that identifying the structural holes in social networks may help people analyze complex networks, which is crucial in community detection, diffusion control, viral marketing, and academic activities. Structural holes bridge different communities and gain access to multiple sources of information flow. In this paper, we devised a structural hole detection algorithm, known as the Conductance–Degree structural hole detection algorithm (CD-SHA), which computes the conductance and degree score of a vertex to identify the structural hole spanners in social networks. Next, we proposed an improved label propagation algorithm based on conductance (C-LPA) to filter the jamming nodes, which have a high conductance and degree score but are not structural holes. Finally, we evaluated the performance of the algorithm on different real-world networks, and we calculated several metrics for both structural holes and communities. The experimental results show that the algorithm can detect the structural holes and communities accurately and efficiently.

A Feasible Community Detection Algorithm for Multilayer Networks

As a more complicated network model, multilayer networks provide a better perspective for describing the multiple interactions among social networks in real life. Different from conventional community detection algorithms, the algorithms for multilayer networks can identify the underlying structures that contain various intralayer and interlayer relationships, which is of significance and remains a challenge. In this paper, aiming at the instability of the label propagation algorithm (LPA), an improved label propagation algorithm based on the SH-index (SH-LPA) is proposed. By analyzing the characteristics and deficiencies of the H-index, the SH-index is presented as an index to evaluate the importance of nodes, and the stability of the SH-LPA algorithm is verified by a series of experiments. Afterward, considering the deficiency of the existing multilayer network aggregation model, we propose an improved multilayer network aggregation model that merges two networks into a weighted single-layer network. Finally, considering the influence of the SH-index and the weight of the edge of the weighted network, a community detection algorithm (MSH-LPA) suitable for multilayer networks is exhibited in terms of the SH-LPA algorithm, and the superiority of the mentioned algorithm is verified by experimental analysis.

Label propagation-based approach for detecting review spammer groups on e-commerce websites

Online product reviews are very important information resources on e-commerce websites and significantly influence consumers’ purchase decisions. Driven by interests, however, some merchants might hire a group of reviewers working together to promote or demote a set of target products by writing fake reviews. Such a collusive fraudulent reviewer group is generally termed a review spammer group and is more harmful to e-commerce websites than individual review spammers. To address this issue, in this paper we propose a label propagation-based approach to detect review spammer groups on e-commerce websites. First, based on the evaluation data of reviewers, we extract the associations between reviewers with respect to review time and product ratings to construct a relationship graph of reviewers. Second, we propose an improved label propagation algorithm with a propagation intensity and an automatic filtering mechanism to find candidate spammer groups based on the constructed reviewer relationship graph. Finally, we propose a ranking algorithm that combines the entropy method and the analytic hierarchy process to rank the candidate spammer groups and thus identify the top-k review spammer groups. The experimental results of the real-world Amazon and Yelp datasets show that the proposed approach performs better than the baseline methods.

Community detection in social networks based on improved Label Propagation Algorithm and balanced link density

Nowadays, community detection has been raised as one of the key research areas in the online social networks mining. One of the most common algorithms in this field is label propagation algorithm (LPA). Even though the LPA method has advantages such as simplicity in understanding and implementation, as well as linear time complexity, it has an important disadvantage of the uncertainty and instability in outcomes, that is, the algorithm detects and reports different combinations of communities in each run. This problem originates from the nature of random selection in the LPA method. In this paper, a novel method is proposed based on the LPA method and the inherent structure, that is, link density feature, of the input network. The proposed method uses a sensitivity parameter (balance parameter); by choosing the appropriate values for it, the desired qualities of the identified communities can be achieved. The proposed method is called Balanced Link Density-based Label Propagation (BLDLP). In comparison with the basic LPA, the proposed method has an advantage of certainty and stability in the output results, whereas its time complexity is still comparable with the basic LPA and of course lowers than many other approaches. The proposed method has been evaluated on real-world known datasets, such as the Facebook social network and American football clubs, and by comparing it with the basic LPA, the effectiveness of the proposed method in terms of the quality of the communities found and the time complexity has been shown.

An improved label propagation algorithm based on node intimacy for community detection in networks

Community detection in complex network analysis is a quite challenging problem spanning many applications in various disciplines such as biology, physics and social network. A large number of methods have been developed for this problem, among which the label propagation algorithm (LPA) has attracted much attention because of its advantages of nearly-linear running time and easy implementation. Nevertheless, the random updating order and tie-breaking strategy in LPA make the algorithm unstable and may even lead to the formation of a monster community. In this paper, an improved LPA called LPA-INTIM is proposed for solving the community detection problem. Firstly, an intimacy matrix is constructed using local topology information for measuring the intimacy between nodes. And then, the node importance is calculated to ensure that nodes are updated in a specific order. Finally, the label influence is evaluated for updating node label during the label propagation process. In addition, we introduce a novel tightness function to improve the stability of the proposed algorithm. By the comparison with the methods presented in the literatures, experimental results on real-world and synthetic networks show the efficiency and effectiveness of our proposed algorithm.

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

In Network Function Virtualization, in order to improve the utilization of the underlying resources and effectively deploy the service chain dynamically, we will use the management and orchestration to monitor the network resources and virtual function status in real time, but real-time monitoring will result in a certain communication overhead. In this paper, a resource state agent monitoring strategy is designed. The improved label propagation algorithm divides network to subnet and selects the agent monitoring node, which realizes the real-time monitoring of resource status and minimizes the monitoring information communication overhead. Simulation results show that the monitoring strategy proposed in this paper reduces the overhead of monitoring information communication about 15%.

Research on Web Page Classification Method Based on Query Log

Web page classification is an important application in many fields of Internet information retrieval, such as providing directory classification and vertical search. Methods based on query log which is a light weight version of Web page classification can avoid Web content crawling, making it relatively high in efficiency, but the sparsity of user click data makes it difficult to be used directly for constructing a classifier. To solve this problem, we explore the semantic relations among different queries through word embedding, and propose three improved graph structure classification algorithms. To reflect the semantic relevance between queries, we map the user query into the low-dimensional space according to its query vector in the first step. Then, we calculate the uniform resource locator (URL) vector according to the relationship between the query and URL. Finally, we use the improved label propagation algorithm (LPA) and the bipartite graph expansion algorithm to classify the unlabeled Web pages. Experiments show that our methods make about 20% more increase in F1-value than other Web page classification methods based on query log.

LPA-CBD an improved label propagation algorithm based on community belonging degree for community detection

In order to deal with stochasticity in center node selection and instability in community detection of label propagation algorithm, this paper proposes an improved label propagation algorithm named label propagation algorithm based on community belonging degree (LPA-CBD) that employs community belonging degree to determine the number and the center of community. The general process of LPA-CBD is that the initial community is identified by the nodes with the maximum degree, and then it is optimized or expanded by community belonging degree. After getting the rough structure of network community, the remaining nodes are labeled by using label propagation algorithm. The experimental results on 10 real-world networks and three synthetic networks show that LPA-CBD achieves reasonable community number, better algorithm accuracy and higher modularity compared with other four prominent algorithms. Moreover, the proposed algorithm not only has lower algorithm complexity and higher community detection quality, but also improves the stability of the original label propagation algorithm.

An improved label propagation algorithm based on node importance and random walk for community detection

Currently, with the rapid development of information technology, the electronic media for social communication is becoming more and more popular. Discovery of communities is a very effective way to understand the properties of complex networks. However, traditional community detection algorithms consider the structural characteristics of a social organization only, with more information about nodes and edges wasted. In the meanwhile, these algorithms do not consider each node on its merits.Label propagation algorithm (LPA) is a near linear time algorithm which aims to find the community in the network. It attracts many scholars owing to its high efficiency. In recent years, there are more improved algorithms that were put forward based on LPA. In this paper, an improved LPA based on random walk and node importance (NILPA) is proposed. Firstly, a list of node importance is obtained through calculation. The nodes in the network are sorted in descending order of importance. On the basis of random walk, a matrix is constructed to measure the similarity of nodes and it avoids the random choice in the LPA. Secondly, a new metric IAS (importance and similarity) is calculated by node importance and similarity matrix, which we can use to avoid the random selection in the original LPA and improve the algorithm stability.Finally, a test in real-world and synthetic networks is given. The result shows that this algorithm has better performance than existing methods in finding community structure.