57 citations · 144 across the 14 of their papers we have counts for
14 papers
DiffIM: Differentiable Influence Minimization with Surrogate Modeling and Continuous Relaxation
Junghun Lee, Hyunju Kim, Fanchen Bu +2
In social networks, people influence each other through social links, which can be represented as propagation among nodes in graphs. Influence minimization (IMIN) is the problem of…
Hypergraph Motifs and Their Extensions Beyond Binary
Geon Lee, Seokbum Yoon, Jihoon Ko +2
Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, and joint interactions of proteins,…
TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions
Taehyung Kwon, Jihoon Ko, Jinhong Jung +1
Many real-world datasets are represented as tensors, i.e., multi-dimensional arrays of numerical values. Storing them without compression often requires substantial space, which gr…
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).…
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…
BeGin: Extensive Benchmark Scenarios and An Easy-to-use Framework for Graph Continual Learning
Jihoon Ko, Shinhwan Kang, Taehyung Kwon +2
Continual Learning (CL) is the process of learning ceaselessly a sequence of tasks. Most existing CL methods deal with independent data (e.g., images and text) for which many bench…