{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T10:21:09Z","timestamp":1771064469159,"version":"3.50.1"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Tertiary Education Research Fund","award":["MOE2021-TRF-013"],"award-info":[{"award-number":["MOE2021-TRF-013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tkde.2023.3303465","type":"journal-article","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T17:34:52Z","timestamp":1691602492000},"page":"1328-1340","source":"Crossref","is-referenced-by-count":7,"title":["Topic Modeling on Document Networks With Dirichlet Optimal Transport Barycenter"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5571-9766","authenticated-orcid":false,"given":"Delvin Ce","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8245-8677","authenticated-orcid":false,"given":"Hady W.","family":"Lauw","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, Singapore Management University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref2","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref3","first-page":"81","article-title":"Relational topic models for document networks","volume-title":"Proc. 12 Int. Conf. Artif. Intell. Statist.","author":"Chang"},{"key":"ref4","first-page":"2292","article-title":"Sinkhorn distances: Lightspeed computation of optimal transport","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Cuturi"},{"key":"ref5","first-page":"18573","article-title":"OTLDA: A geometry-aware optimal transport approach for topic modeling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Huynh"},{"key":"ref6","first-page":"1","article-title":"Neural topic model via optimal transport","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhao"},{"key":"ref7","first-page":"685","article-title":"Fast computation of Wasserstein Barycenters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cuturi"},{"key":"ref8","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref9","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/362"},{"key":"ref11","first-page":"5274","article-title":"Dirichlet graph variational autoencoder","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00177"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/518"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1512"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3280859"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101582"},{"key":"ref17","article-title":"Auto-encoding variational bayes","author":"Kingma","year":"2013"},{"key":"ref18","first-page":"1727","article-title":"Neural variational inference for text processing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Miao"},{"key":"ref19","first-page":"1","article-title":"Autoencoding variational inference for topic models","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Srivastava"},{"issue":"131","key":"ref20","first-page":"1","article-title":"Decoupling sparsity and smoothness in the dirichlet variational autoencoder topic model","volume":"20","author":"Burkhardt","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380102"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1495"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1077"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00325"},{"key":"ref25","first-page":"1723","article-title":"Distilled Wasserstein learning for word embedding and topic modeling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Xu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1640"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271696"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7566-5"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6152"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450045"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/433"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3404995"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3390\/app12157387"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482398"},{"key":"ref35","first-page":"9912","article-title":"Unsupervised learning of visual features by contrasting cluster assignments","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Caron"},{"key":"ref36","first-page":"29 512","article-title":"Unified optimal transport framework for universal domain adaptation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chang"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/WACV56688.2023.00539"},{"key":"ref38","first-page":"489","article-title":"Reparameterization gradients through acceptance-rejection sampling algorithms","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Naesseth"},{"key":"ref39","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mikolov"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"issue":"2","key":"ref42","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1009953814988","article-title":"Automating the construction of internet portals with machine learning","volume":"3","author":"McCallum","year":"2000","journal-title":"Inf. Retrieval"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557077"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.310"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.230"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3473973"},{"key":"ref48","first-page":"26 281","article-title":"Dynamic topic models for temporal document networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539310"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3191086"},{"key":"ref51","first-page":"2837","article-title":"Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance","volume":"11","author":"Vinh","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref52","first-page":"32","article-title":"Google web 1T 5-grams made easy (but not for the computer)","volume-title":"Proc. NAACL HLT 6th Web Corpus Workshop","author":"Evert"},{"issue":"11","key":"ref53","first-page":"2579","article-title":"Visualizing data using t-SNE","volume":"9","author":"Van der Maaten","year":"2008","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10422839\/10214042.pdf?arnumber=10214042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T19:51:19Z","timestamp":1707767479000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10214042\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":53,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3303465","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}