Haesun Park
Knowledge Discovery and Data Mining · with Papalexakis · 2018
A researcher in the Science corpus: 1 paper; trusts 0 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Haesun Park trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Haesun Park's perspective
Ordered by how strongly the researchers Haesun Park trusts endorse each paper. Same corpus, a different order for every researcher.
- Learning the parts of objects by non-negative matrix factorization
- Multi-Way Analysis: Applications in the Chemical Sciences
- Efficient MATLAB Computations with Sparse and Factored Tensors (SIAM Journal on Scientific Computing)
- Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations (IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences)
- Orthogonal nonnegative matrix t-factorizations for clustering (Knowledge Discovery and Data Mining)
- PheWAS: demonstrating the feasibility of a phenome-wide scan to discover gene–disease associations
- The Expression of a Tensor or a Polyadic as a Sum of Products
- Clinical phenotyping in selected national networks: demonstrating the need for high-throughput, portable, and computational methods
- Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons (SIAM Journal on Scientific Computing)
Their papers
- SUSTain: Scalable Unsupervised Scoring for Tensors and its Application to Phenotyping (2018) — 589 citations