research
∙
05/11/2023
Automated Data Denoising for Recommendation
In real-world scenarios, most platforms collect both large-scale, natura...
share
research
∙
05/31/2022
Robust Projection based Anomaly Extraction (RPE) in Univariate Time-Series
This paper presents a novel, closed-form, and data/computation efficient...
research
∙
01/08/2022
Provable Clustering of a Union of Linear Manifolds Using Optimal Directions
This paper focuses on the Matrix Factorization based Clustering (MFC) me...
research
∙
08/16/2021
Non-Local Feature Aggregation on Graphs via Latent Fixed Data Structures
In contrast to image/text data whose order can be used to perform non-lo...
research
∙
08/16/2021
Provable Data Clustering via Innovation Search
This paper studies the subspace clustering problem in which data points ...
research
∙
06/23/2021
Closed-Form, Provable, and Robust PCA via Leverage Statistics and Innovation Search
The idea of Innovation Search, which was initially proposed for data clu...
research
∙
12/30/2019
Outlier Detection and Data Clustering via Innovation Search
The idea of Innovation Search was proposed as a data clustering method i...
research
∙
10/03/2019
Graph Analysis and Graph Pooling in the Spatial Domain
The spatial convolution layer which is widely used in the Graph Neural N...
research
∙
05/25/2018
Randomized Robust Matrix Completion for the Community Detection Problem
This paper focuses on the unsupervised clustering of large partially obs...
research
∙
12/04/2017
Data Dropout in Arbitrary Basis for Deep Network Regularization
An important problem in training deep networks with high capacity is to ...
research
∙
06/12/2017
Subspace Clustering via Optimal Direction Search
This letter presents a new spectral-clustering-based approach to the sub...
research
∙
05/09/2017
Spatial Random Sampling: A Structure-Preserving Data Sketching Tool
Random column sampling is not guaranteed to yield data sketches that pre...
research
∙
02/07/2017
Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption
We study a data model in which the data matrix D can be expressed as D =...
research
∙
11/18/2016
Robust and Scalable Column/Row Sampling from Corrupted Big Data
Conventional sampling techniques fall short of drawing descriptive sketc...
research
∙
09/15/2016
Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis
This paper presents a remarkably simple, yet powerful, algorithm termed ...
research
∙
12/02/2015
Innovation Pursuit: A New Approach to Subspace Clustering
In subspace clustering, a group of data points belonging to a union of s...
research
∙
05/21/2015
Randomized Robust Subspace Recovery for High Dimensional Data Matrices
This paper explores and analyzes two randomized designs for robust Princ...
research
∙
02/01/2015