Zobrazeno 1 - 10
of 22
pro vyhledávání: '"JUN-GI JANG"'
Publikováno v:
PLoS ONE, Vol 18, Iss 3, p e0280630 (2023)
How can we recommend existing bundles to users accurately? How can we generate new tailored bundles for users? Recommending a bundle, or a group of various items, has attracted widespread attention in e-commerce owing to the increased satisfaction of
Externí odkaz:
https://doaj.org/article/bde5c5b5304b4a479c9c17ee31d676f3
Publikováno v:
PLoS ONE, Vol 18, Iss 3, p e0282595 (2023)
How can we interpret predictions of a workload classification model? A workload is a sequence of operations executed in DRAM, where each operation contains a command and an address. Classifying a given sequence into a correct workload type is importa
Externí odkaz:
https://doaj.org/article/ab54e8aa847847e7a665da159c96e6b6
Publikováno v:
PLoS ONE, Vol 14, Iss 6, p e0217316 (2019)
How can we extract hidden relations from a tensor and a matrix data simultaneously in a fast, accurate, and scalable way? Coupled matrix-tensor factorization (CMTF) is an important tool for this purpose. Designing an accurate and efficient CMTF metho
Externí odkaz:
https://doaj.org/article/92da412c94984848a58ed2a20ea857eb
Autor:
Jun-Gi Jang, U Kang
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 17:1-34
Given a dense tensor, how can we efficiently discover hidden relations and patterns in static and online streaming settings? Tucker decomposition is a fundamental tool to analyze multidimensional arrays in the form of tensors. However, existing Tucke
Publikováno v:
Knowledge and Information Systems. 65:2225-2249
Publikováno v:
ACM Transactions on Knowledge Discovery from Data; Nov2023, Vol. 17 Issue 9, p1-14, 14p
Publikováno v:
ACM Transactions on Knowledge Discovery from Data. 16:1-21
What are the key structures existing in a large real-world MMORPG (Massively Multiplayer Online Role-Playing Game) graph? How can we compactly summarize an MMORPG graph with hierarchical node labels, considering consistent substructures at different
Publikováno v:
The Journal of Supercomputing. 78:17992-18022
How can we accurately identify new memory workloads while classifying known memory workloads? Verifying DRAM (Dynamic Random Access Memory) using various workloads is an important task to guarantee the quality of DRAM. A crucial component in the proc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f1179fb3eda6e3b133d3aa354831c919
http://arxiv.org/abs/2212.08817
http://arxiv.org/abs/2212.08817
Publikováno v:
2022 IEEE International Conference on Big Data (Big Data).