Search Results for author:
Found 3 papers, 2 papers with code
Deep Graph Learning for Anomalous Citation Detection
To address this open issue, we propose a novel deep graph learning model, namely GLAD (Graph Learning for Anomaly Detection), to identify anomalies in citation networks.
Faster Matrix Completion Using Randomized SVD
Then, with the rSVD-BKI algorithm and a new subspace recycling technique, we accelerate the singular value thresholding (SVT) method in [1] to realize faster matrix completion.
Fast Randomized PCA for Sparse Data
The algorithm has similar accuracy to the basic randomized SVD (rPCA) algorithm (Halko et al., 2011), but is largely optimized for sparse data.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
