SIAM Journal on Scientific Computing · 2016 · 118 citations · 19 references
ComputingComputational EngineeringComputer ScienceBig Data AnalyticsMachine LearningPredictive AnalyticsDimension ReductionDimensionality ReductionGaussian ProcessesMachine Learning For Big DataAutocorrelation FunctionAutocorrelation StructureAutoregressive ModelsDimensionality Reduction For Large DataHigh-dimensional StatisticsInformation-theoretic FusionMultifidelity ModelingStochastic Dynamical Systems
We develop a framework for multifidelity information fusion and predictive inference in high-dimensional input spaces and in the presence of massive data sets. Hence, we tackle simultaneously the “big N" problem for big data and the curse of dimensionality in multivariate parametric problems. The proposed methodology establishes a new paradigm for constructing response surfaces of high-dimensional stochastic dynamical systems, simultaneously accounting for multifidelity in physical models as well as multifidelity in probability space. Scaling to high dimensions is achieved by data-driven dimensionality reduction techniques based on hierarchical functional decompositions and a graph-theoretic approach for encoding custom autocorrelation structure in Gaussian process priors. Multifidelity information fusion is facilitated through stochastic autoregressive schemes and frequency-domain machine learning algorithms that scale linearly with the data. Taking together these new developments leads to linear complexity algorithms as demonstrated in benchmark problems involving deterministic and stochastic fields in up to $10^{5}$ input dimensions and $10^{5}$ training points on a standard desktop computer.
19
Finn Lindgren, Håvard Rue, Johan Lindström · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 2011 · 2.7K citations · Full text
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch · Communications of the ACM · 1973 · 2.5K citations · Full text