research
∙
09/19/2023
TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions
Many real-world datasets are represented as tensors, i.e., multi-dimensi...
share
research
∙
07/06/2023
Learning Disentangled Representations in Signed Directed Graphs without Social Assumptions
Signed graphs are complex systems that represent trust relationships or ...
research
∙
02/09/2023
NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors
Many real-world data are naturally represented as a sparse reorderable m...
research
∙
11/02/2022
Time-aware Random Walk Diffusion to Improve Dynamic Graph Learning
How can we augment a dynamic graph for improving the performance of dyna...
research
∙
06/09/2022
Accurate Node Feature Estimation with Structured Variational Graph Autoencoder
Given a graph with partial observations of node features, how can we est...
research
∙
12/28/2020
Signed Graph Diffusion Network
Given a signed social graph, how can we learn appropriate node represent...
research
∙
12/19/2020
T-GAP: Learning to Walk across Time for Temporal Knowledge Graph Completion
Temporal knowledge graphs (TKGs) inherently reflect the transient nature...
research
∙
11/09/2020
Fast and Accurate Pseudoinverse with Sparse Matrix Reordering and Incremental Approach
How can we compute the pseudoinverse of a sparse feature matrix efficien...
research
∙
05/02/2018
Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range
Given multiple time series data, how can we efficiently find latent patt...
research
∙
05/02/2018
TR-SVD: Fast and Memory Efficient Method for Time Ranged Singular Value Decomposition
Given multiple time series data, how can we efficiently find latent patt...
research
∙
08/30/2017
