3 papers
cs.LG2023
NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors
Taehyung Kwon, Jihoon Ko, Jinhong Jung +1
Many real-world data are naturally represented as a sparse reorderable matrix, whose rows and columns can be arbitrarily ordered (e.g., the adjacency matrix of a bipartite graph).…
cs.SI2023
Characterization of Simplicial Complexes by Counting Simplets Beyond Four Nodes
Hyunju Kim, Jihoon Ko, Fanchen Bu +1
Simplicial complexes are higher-order combinatorial structures which have been used to represent real-world complex systems. In this paper, we concentrate on the local patterns in…
cs.DB2021
SLUGGER: Lossless Hierarchical Summarization of Massive Graphs
Kyuhan Lee, Jihoon Ko, Kijung Shin
Given a massive graph, how can we exploit its hierarchical structure for concisely but exactly summarizing the graph? By exploiting the structure, can we achieve better compression…