Showing papers on "Prim's algorithm published in 2020"
TL;DR: A novel feature selection method based on the minimum spanning tree (MST) to seek neuromarkers for ASD and shows improved classification performance, i.e., the accuracy, accuracy, and specificity were 86.7, 87.5, and 85.7%, respectively.
Abstract: Autism spectrum disorder (ASD) is a neurodevelopmental disorder originating in infancy and childhood that may cause language barriers and social difficulties. However, in the diagnosis of ASD, the current machine learning methods still face many challenges in determining the location of biomarkers. Here, we proposed a novel feature selection method based on the minimum spanning tree (MST) to seek neuromarkers for ASD. First, we constructed an undirected graph with nodes of candidate features. At the same time, a weight calculation method considering both feature redundancy and discriminant ability was introduced. Second, we utilized the Prim algorithm to construct the MST from the initial graph structure. Third, the sum of the edge weights of all connected nodes was sorted for each node in the MST. Then, N features corresponding to the nodes with the first N smallest sum were selected as classification features. Finally, the support vector machine (SVM) algorithm was used to evaluate the discriminant performance of the aforementioned feature selection method. Comparative experiments results show that our proposed method has improved the ASD classification performance, i.e., the accuracy, sensitivity, and specificity were 86.7%, 87.5%, and 85.7%, respectively.
8 citations
TL;DR: The results show that WWM2 is the best algorithms for solving the Minimum Spanning Tree problem and GNU OCTAVE is used for coding and visualization.
Abstract: The Minimum Spanning Tree (MST) is one of the famous problems that is
used mostly as the backbone in many network design problems. Given a graph G(V,E),
where V is the set of vertices and E is the set of edges connecting vertices in V, and for
every edge eij there is an associated weight cij ≥0. The Multi Period Degree Constrained
Minimum Spanning Tree (MPDCMST) is a problem of finding an MST while also
considering the degree constrained on every vertex, and satisfying vertices installation
requirement on every period. Two algorithms (WWM1 and WWM2) are proposed for solving this problem. GNU OCTAVE is used for coding and visualization. GNU is a recursive acronym for "GNU's Not Unix!", and that name is chosen because it is likeUnix but differs from Unix because it is free and contains no Unix code. Those algorithms were implemented using 300 randomly generated problems. Moreover, we
compare WWM1 and WWM2 algorithms using existing data from the literature and the results show that WWM2 is the best.
4 citations
16 Oct 2020
TL;DR: In this paper, the optimal network reconfiguration using beetle antennae search based on the Prim algorithm is proposed to find the optimal structure of a distribution system This problem can be formulated as a multi-objective optimization problem and beetle antenna search is used to solve it, applying Prim algorithm to make sure that a radial network structure would remain after reconfigure and all loads would be energized Roulette wheel selection is used in the path selection procedure to avoid trapping in local optimum.
Abstract: Network reconfiguration is always used to find the optimal structure of a distribution network, with less power loss, higher power quality, and better load balancing In this paper, optimal network reconfiguration using beetle antennae search based on the Prim algorithm is proposed to find the optimal structure of a distribution system This problem can be formulated as a multi-objective optimization problem and beetle antennae search is used to solve it, applying Prim algorithm to make sure that a radial network structure would remain after reconfiguration and all loads would be energized Roulette wheel selection is used in the path selection procedure to avoid trapping in local optimum The proposed method is validated in a system The results proved that the proposed method completes the integrated optimization of network reconfiguration and leads to significant reduction on the calculation amount and fast convergence, which is suitable for engineering application
2 citations
28 Oct 2020
TL;DR: This research was conducted to answer the crucial needs of a weighted graph settlement application that is useful for completing a graph with the Kruskal algorithm and Prim algorithm.
Abstract: A graph has several algorithms in its solution, including the Kruskal algorithm and Prim algorithm, both of which are greedy algorithms for determining the minimum spanning tree. Completion of graphs is useful in various fields of life, so an accurate graph calculation is important. Making an application to solve a graph, especially the Kruskal algorithm and Prim algorithm aims to facilitate the work of the graph so as to produce an accurate final result. The flow of research carried out are: a background review of research, study of literature and relevant literature, application design, building desktop-based applications, as well as implementation and application tests. The level of technological readiness or TKT in this research is based on self-assessment which is at level 7, meaning the prototype demonstration system in the actual environment, with details of the TKT indicators as follows: TKT indicator 1 is met, TKT indicator 2 is met, TKT indicator 3 is not met, TKT indicator 4, TKT indicator 5 are met, TKT indicator 6 are met, TKT indicator 7 is met, TKT indicator 8 and 9 are not met. The application that has been built is useful for completing a graph with the Kruskal algorithm and Prim algorithm. This research was conducted to answer the crucial needs of a weighted graph settlement application.
18 Jul 2020
TL;DR: Wang et al. as discussed by the authors proposed an optimal solution analysis of octagonal Steiner tree problem based on GPU acceleration, which can effectively improve the data convergence and fully meet the research requirements.
Abstract: In order to improve the effect of solving the octagonal Steiner tree problem better, the optimal solution analysis of octagonal Steiner tree problem based on GPU acceleration is proposed. Combining with prim algorithm, the relay point of octagonal Steiner tree is cut in. In order to better shorten the routing path, the GPU acceleration principle is used for global search, the routing path is scientifically standardized, the range of inflection point is reasonably defined, and the research requirements for effective analysis of the optimal solution of octagonal Steiner tree problem are finally realized. Finally, it is proved by experiments that the GPU accelerated optimal solution analysis method for octagonal Steiner tree problem is more effective in practical application, and can effectively improve the data convergence and fully meet the research requirements.
Patent•
21 Jan 2020
TL;DR: In this paper, a Prim's algorithm-based method for reconstructing a distribution network with a high proportion of distributed generation is presented, which is more economical, safe, and reliable.
Abstract: The invention discloses a Prim's algorithm-based method for reconstructing a distribution network with a high proportion of distributed generation, including the following steps: S1, obtaining the output and the load of the distributed generation the distribution network; S2, constructing a demand response model for regulating the load and the distributed generation output, and regulating the loadand the distributed generation output; S3, constructing a reconstruction model of the distribution network with a high proportion of distributed generation; S4, solving the reconstruction model of the distribution network with a high proportion of distributed generation by using a Prim's binary particle swarm algorithm to obtain a reconstruction result. The method obtains a network reconstructionscheme by constructing a reconstruction model of the distribution network with a high proportion of distributed generation, and using the Prim's binary particle swarm algorithm to solve the model. The distribution network running under this scheme is more economical, safe, and reliable, and has important practical significance for the sustainable development of a power grid.
23 Oct 2020
TL;DR: Wang et al. as mentioned in this paper proposed a practical urban light rail route planning problem, and transformed it into a classic graph model, that is, the minimum spanning tree, and defined the data library, the probe library and the probe operation graph, respectively.
Abstract: With economic development and technological progress accelerating, people’s demand for urban light rail transportation is becoming more and more urgent Considering the existence of interchange stations, how to construct the route with the lowest cost is crucial for decision makers This paper first proposes a practical urban light rail route planning problem, and transforms it into a classic graph model, that is, the minimum spanning tree Then for this problem, the data library, the probe library and the probe operation graph are defined, respectively Finally, on the computing platform, only one probe operation is needed to get the true solution of the problem As a comparison, the solving process of two classic algorithms, ie, the Prim algorithm and the Kruskal algorithm, are given Analysis shows that the probe machine significantly outperforms the above two algorithms in terms of computing efficiency