Machine Learning K-Means Clustering Algorithm for Interpolative Separable Density Fitting to Accelerate Hybrid Functional Calculations with Numerical Atomic Orbitals

Abstract

The interpolative separable density fitting (ISDF) is an efficient and accurate low-rank decomposition method to reduce the high computational cost and memory usage of the Hartree-Fock exchange (HFX) calculations with numerical atomic orbitals (NAOs). In this work, we present a machine learning K-means clustering algorithm to select the interpolation points in ISDF, which offers a much cheaper alternative to the expensive QR factorization with column pivoting (QRCP) procedure. We implement this K-means-based ISDF decomposition to accelerate hybrid functional calculations with NAOs in the HONPAS package. We demonstrate that this method can yield a similar accuracy for both molecules and solids at a much lower computational cost. In particular, K-means can remarkably reduce the computational cost of selecting the interpolation points by nearly two orders of magnitude compared to QRCP, resulting in a speedup of ∼10 times for ISDF-based HFX calculations.

Necroptosis is Related to Anti-PD-1 Treatment Response and Influences the Tumor Microenvironment in Head and Neck Squamous Cell Carcinoma

“…We collected 26 necroptosis-related genes from previous studies ( Frank and Vince, 2019 ; Robinson et al, 2019 ; Tonnus et al, 2021 ). Based on the expression level of 26 necroptosis-related genes, we used “ClassDiscovery” package in R to analyze datasets ( Qin et al, 2020 ). Single‐sample gene set enrichment analysis (ssGSEA) in R package GSVA was used to construct a system to evaluate the score of the expression of 26 necroptosis-related genes in HNSCC patient.…”

ARDS Patients Exhibiting a “Hyperinflammatory Anasarca” Phenotype Could Benefit From a Conservative Fluid Management Strategy

“…The mice R package conducted three main steps: (1) imputation, (2) analysis, and (3) pooling for missing data. The imputation step identified the characteristic of missing data; then the analysis step provided the predictive mean matching of missing data through modular approach; finally, the pooling step filled up the missing data based on 1,000 imputations iterations ( 13 – 15 ).…”

A Credit Conflict Detection Model Based on Decision Distance and Probability Matrix

“…For the detection of data conflict in multisource data fusion, the abnormal points in conflict are regarded as outliers, and the point outlier detection technology is used to detect and process the conflict [19][20][21][22]. In the traditional data mining work, outlier detection is carried out by using statistics, clustering, classification, proximity, and other methods [23][24][25][26][27][28][29]. These methods are strong, simple, and direct but need to rely on a certain prior knowledge, and processing effects are directly affected by the level of knowledge.…”