43 citations · 139 across the 21 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.NA2018★ 12 cited
Zoom-SVD: Fast and Memory Efficient Method for Extracting Key Patterns in an Arbitrary Time Range
Jun-Gi Jang, Dongjin Choi, Jinhong Jung +1
Given multiple time series data, how can we efficiently find latent patterns in an arbitrary time range? Singular value decomposition (SVD) is a crucial tool to discover hidden fac…
cs.AI2018★ 3 cited
Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets
Mauro Scanagatta, Giorgio Corani, Marco Zaffalon +2
Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, w…