Results 1 to 10 of about 109,247 (252)

Alzheimer Classification Using a Minimum Spanning Tree of High-Order Functional Network on fMRI Dataset [PDF]

Frontiers in Neuroscience, 2017
Functional magnetic resonance imaging (fMRI) is one of the most useful methods to generate functional connectivity networks of the brain. However, conventional network generation methods ignore dynamic changes of functional connectivity between brain ...
Hao Guo, Hao Guo, Lei Liu, Junjie Chen, Yong Xu, Xiang Jie   +5 more
doaj   +3 more sources

Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO). [PDF]

Magn Reson Med, 2021
Purpose To develop a rapid and accurate MRI phase unwrapping technique for challenging phase topographies encountered at high magnetic fields, around metal implants or post-operative cavities, that is sufficiently fast to be applied to large group ...
Dymerska B, Eckstein K, Bachrata B, Siow B, Trattnig S, Shmueli K, Robinson SD.   +6 more
europepmc   +2 more sources

Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants [PDF]

Data in Brief, 2023
This article proposes a benchmark instance generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. The generator is developed in C++ and does not uses external
Iago A. Carvalho, Amadeu A. Coco
doaj   +2 more sources

Minimum spanning tree analysis of the human connectome. [PDF]

Hum Brain Mapp, 2018
One of the challenges of brain network analysis is to directly compare network organization between subjects, irrespective of the number or strength of connections.
van Dellen E, Sommer IE, Bohlken MM, Tewarie P, Draaisma L, Zalesky A, Di Biase M, Brown JA, Douw L, Otte WM, Mandl RCW, Stam CJ.   +11 more
europepmc   +2 more sources

BALANCED PARTITION OF MINIMUM SPANNING TREES [PDF]

International Journal of Computational Geometry & Applications, 2003
To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve dividing a task into a number of smaller tasks, while optimizing a specific objective function. In this paper we consider the problem of partitioning a given set [Formula: see text] of n points in the plane ...
Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan   +3 more
openalex   +7 more sources

Pruning a minimum spanning tree [PDF]

Physica A: Statistical Mechanics and its Applications, 2011
This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the ...
Leonidas Sandoval
openalex   +3 more sources

MS2OD: outlier detection using minimum spanning tree and medoid selection

Machine Learning: Science and Technology
As an essential task in data mining, outlier detection identifies abnormal patterns in numerous applications, among which clustering-based outlier detection is one of the most popular methods for its effectiveness in detecting cluster-related outliers ...
Jia Li, Jiangwei Li, Chenxu Wang, Fons J Verbeek, Tanja Schultz, Hui Liu   +5 more
doaj   +2 more sources

Drawing a tree as a minimum spanning tree approximation

Journal of Computer and System Sciences, 2011
AbstractWe introduce and study (1+ε)-EMST drawings, i.e., planar straight-line drawings of trees such that, for any fixed ε>0, the distance between any two vertices is at least 11+ε the length of the longest edge in the path connecting them. (1+ε)-EMST drawings are good approximations of Euclidean minimum spanning trees.
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer   +3 more
openalex   +5 more sources

PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL

Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012
One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj   +3 more sources

Graph analysis of functional brain network topology using minimum spanning tree in driver drowsiness. [PDF]

Cogn Neurodyn, 2018
Chen J, Wang H, Hua C, Wang Q, Liu C.
europepmc   +2 more sources