Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 41 publications
(45 reference statements)
0
6
0
Order By: Relevance
“…Numerous methods to identify network hubs exist, but in the last years there was a great interest in using and apply the Auto-Contractive map (AutoCM). AutoCM system is a fourth-generation unsupervised artificial neural network (ANN) that can outperform numerous unsupervised algorithms ( Buscema and Sacco, 2016 ). The system uses the minimum spanning tree (MST) theory to underline the natural connections between variables ( Buscema and Grossi, 2008 ; Buscema et al, 2008 ).…”
Section: Microbial Network: New Insights Into Bacterial Ecologymentioning
confidence: 99%
See 1 more Smart Citation
“…Numerous methods to identify network hubs exist, but in the last years there was a great interest in using and apply the Auto-Contractive map (AutoCM). AutoCM system is a fourth-generation unsupervised artificial neural network (ANN) that can outperform numerous unsupervised algorithms ( Buscema and Sacco, 2016 ). The system uses the minimum spanning tree (MST) theory to underline the natural connections between variables ( Buscema and Grossi, 2008 ; Buscema et al, 2008 ).…”
Section: Microbial Network: New Insights Into Bacterial Ecologymentioning
confidence: 99%
“…This approach allows to both highlight the relevant nodes of the system and show the network of the main relations among variables. Nodes, also defined as “hubs,” are defined as variables with the highest number of relations in the map ( Buscema and Grossi, 2008 ; Buscema et al, 2008 ; Buscema and Sacco, 2016 ).…”
Section: Microbial Network: New Insights Into Bacterial Ecologymentioning
confidence: 99%
“…14b a, b, c show the graph of the attractors according to the Markov Chain inferred from . The Non-Linear Minimum Spanning Tree (NL-MST) that represents the minimum-energy tree configuration that connects all the points of the distribution, pruning away all the edges that are not indispensable to maintain the connectedness among points by means of the most relevant interactions [ 20 ].
Fig.
…”
Section: Resultsmentioning
confidence: 99%
“…In this section, we show that AutoCM performs better than several well-known alternatives in terms of the informational content of the MST that it generates to organize the structure of the relationship among the descriptor variables, as compared to the MSTs generated by alternative techniques. This approach to the comparative evaluation of alternative computational techniques has been developed in Buscema and Sacco (2016) and is based on the notion of MST fitness. In particular, by main MST fitness, we mean the amount of meaningful associations among the descriptor variables that is coded by the MST generated by the corresponding algorithm and by recursive (or global) fitness the amount of meaningful associations among the more strongly associated descriptor variables as obtained through a suitable selective recursion of the corresponding MSTs.…”
Section: Methodsmentioning
confidence: 99%