2017
DOI: 10.1007/978-3-319-57711-1_2
|View full text |Cite
|
Sign up to set email alerts
|

GPU-Based Parallel Search of Relevant Variable Sets in Complex Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
6
2

Relationship

5
3

Authors

Journals

citations
Cited by 13 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…In this respect, we can note that while the collection of time series is an experimentally difficult and costly task, the RI methodology can be applied merely by comparing different steady states (whose data could derive even from different beings), in such a way taking advantage from more common data sources. In case experimental data are available, the RI method can provide an effective idea of the dynamical organization of the observed system without requiring any knowledge of topology, dynamical rules, or parameters [26,31,32]. Fig.…”
Section: Ri Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this respect, we can note that while the collection of time series is an experimentally difficult and costly task, the RI methodology can be applied merely by comparing different steady states (whose data could derive even from different beings), in such a way taking advantage from more common data sources. In case experimental data are available, the RI method can provide an effective idea of the dynamical organization of the observed system without requiring any knowledge of topology, dynamical rules, or parameters [26,31,32]. Fig.…”
Section: Ri Resultsmentioning
confidence: 99%
“…where RI h and σ(RI h ) are, respectively, the average and the standard deviation of the RI of a sample of subsets of size k extracted from a reference homogeneous system U h , and ν = MI h / I h is its normalization constant. A more detailed description can be found in previous work [26,31]. The generation of the homogeneous system is critical, and often, in past papers, a simple but general and easy to compute solution was chosen.…”
Section: Methodsmentioning
confidence: 99%
“…The computation of T c itself is a rather lengthy procedure. Therefore, we tried to limit the computation time needed to run our method, on the one hand, by implementing the T c computation algorithm as massively parallel GPU code [8], while on the other hand, by designing a metaheuristic, in which a genetic algorithm is hybridized with a local search. The latter is described in detail in the following subsections.…”
Section: Methodsmentioning
confidence: 99%
“…The RI method has been applied with interesting results to several systems: some of them had been artificially designed in order to test the effectiveness of the technique, while others referred to interesting physical, chemical, biological, or socio-economic systems [6,7]. In addition, the efficiency of the method has also been improved by using a parallel implementation of the RI computation [8] and some metaheuristics to deal with the "curse of dimensionality" when analysing high-dimensional systems [9,10]. In general, the method can be applied every time a collection of observations of the values of the system variables at different instants or conditions is available.…”
Section: Introductionmentioning
confidence: 99%
“…From now on, in this paper, we refer to the unsupervised zI-based method we tested as ZIFF (zI-based Feature Finder). In ZIFF, the zI computation is carried out by a specifically-designed evolutionary algorithm [4,5], to counteract the curse of dimensionality and find the most relevant variable subsets in reasonable time, given the exponential complexity of an exhaustive search with respect to the number of variables. To further aggregate the variable sets and discard redundant ones, we adopt the iterative sieving procedure described in [6].…”
mentioning
confidence: 99%