no code implementations • 22 Aug 2023 • Dongjin Choi, Andy Xiang, Ozgur Ozturk, Deep Shrestha, Barry Drake, Hamid Haidarian, Faizan Javed, Haesun Park
We introduce a novel profile-based patient clustering model designed for clinical data in healthcare.
no code implementations • 2 Mar 2022 • Koby Hayashi, Sinan G. Aksoy, Haesun Park
Cut-based directed graph (digraph) clustering often focuses on finding dense within-cluster or sparse between-cluster connections, similar to cut-based undirected graph clustering methods.
no code implementations • 8 Oct 2020 • Ardavan Afshar, Kejing Yin, Sherry Yan, Cheng Qian, Joyce C. Ho, Haesun Park, Jimeng Sun
In particular, we define the N-th order tensor Wasserstein loss for the widely used tensor CP factorization and derive the optimization algorithm that minimizes it.
no code implementations • 29 Jun 2020 • Koby Hayashi, Sinan G. Aksoy, Cheong Hee Park, Haesun Park
We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights.
no code implementations • 13 Nov 2019 • Ardavan Afshar, Ioakeim Perros, Haesun Park, Christopher deFilippi, Xiaowei Yan, Walter Stewart, Joyce Ho, Jimeng Sun
TASTE combines the PARAFAC2 model with non-negative matrix factorization to model a temporal and a static tensor.
no code implementations • 28 Jul 2019 • Hannah Kim, Dongjin Choi, Barry Drake, Alex Endert, Haesun Park
Topic modeling is commonly used to analyze and understand large document collections.
no code implementations • 6 Apr 2018 • Hannah Kim, Denys Katerenchuk, Daniel Billet, Jun Huan, Haesun Park, Boyang Li
Understanding narrative content has become an increasingly popular topic.
no code implementations • 14 Mar 2018 • Ioakeim Perros, Evangelos E. Papalexakis, Haesun Park, Richard Vuduc, Xiaowei Yan, Christopher deFilippi, Walter F. Stewart, Jimeng Sun
We propose two variants, SUSTain_M and SUSTain_T, to handle both matrix and tensor inputs, respectively.
no code implementations • 28 Mar 2017 • Rundong Du, Barry Drake, Haesun Park
We present a hybrid method for latent information discovery on the data sets containing both text content and connection structure based on constrained low rank approximation.
1 code implementation • 5 Jan 2017 • Ramakrishnan Kannan, Hyenkyun Woo, Charu C. Aggarwal, Haesun Park
In such cases, it often becomes difficult to separate the outliers from the natural variations in the patterns in the underlying data.
1 code implementation • 8 Nov 2016 • Minjeong Kim, Minsuk Choi, Sunwoong Lee, Jian Tang, Haesun Park, Jaegul Choo
Embedding and visualizing large-scale high-dimensional data in a two-dimensional space is an important problem since such visualization can reveal deep insights out of complex data.
1 code implementation • 28 Sep 2016 • Ramakrishnan Kannan, Grey Ballard, Haesun Park
NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks.
no code implementations • 3 Sep 2015 • Da Kuang, Barry Drake, Haesun Park
In this paper, we propose a fast method for hierarchical clustering and topic modeling called HierNMF2.
no code implementations • 14 Sep 2013 • Nicolas Gillis, Da Kuang, Haesun Park
The effectiveness of this approach is illustrated on several synthetic and real-world hyperspectral images, and shown to outperform standard clustering techniques such as k-means, spherical k-means and standard NMF.
no code implementations • NeurIPS 2012 • Yunlong He, Yanjun Qi, Koray Kavukcuoglu, Haesun Park
In this paper, we study latent factor models with the dependency structure in the latent space.
1 code implementation • SDM 2012 • Da Kuang, Chris Ding, Haesun Park
Unlike NMF, however, SymNMF is based on a similarity measure between data points, and factorizes a symmetric matrix containing pairwise similarity values (not necessarily nonnegative).