default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingu Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Minho Lee
, Minwoo Choi, Taehoon Yang, Jingu Kim, Jaeoh Kim, Ojeong Kwon, Namsuk Cho:
A Study on the Advancement of Intelligent Military Drones: Focusing on Reconnaissance Operations. IEEE Access 12: 55964-55975 (2024)- 2021
- [c13]Ziwei Zhu, Jingu Kim, Trung Nguyen, Aish Fenton, James Caverlee:
Fairness among New Items in Cold Start Recommender Systems. SIGIR 2021: 767-776
2010 – 2019
- 2017
- [c12]KangUn Jo, JungHyuk Im, Jingu Kim, Dae-Shik Kim:
A real-time multi-class multi-object tracker using YOLOv2. ICSIPA 2017: 507-511 - 2015
- [c11]Hannah Kim, Jaegul Choo, Jingu Kim, Chandan K. Reddy, Haesun Park:
Simultaneous Discovery of Common and Discriminative Topics via Joint Nonnegative Matrix Factorization. KDD 2015: 567-576 - 2014
- [j3]Jingu Kim, Yunlong He, Haesun Park:
Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. J. Glob. Optim. 58(2): 285-319 (2014) - [c10]Jingu Kim, Taneli Mielikäinen:
Conditional Log-linear Models for Mobile Application Usage Prediction. ECML/PKDD (1) 2014: 672-687 - 2013
- [c9]Jingu Kim, Naren Ramakrishnan, Manish Marwah, Amip Shah, Haesun Park:
Regularization Paths for Sparse Nonnegative Least Squares Problems with Applications to Life Cycle Assessment Tree Discovery. ICDM 2013: 360-369 - 2012
- [c8]Ryder C. Winck, Jingu Kim, Wayne J. Book, Haesun Park:
A control loop structure based on semi-nonnegative matrix factorization for input-coupled systems. ACC 2012: 3484-3489 - [c7]Jingu Kim, Renato D. C. Monteiro, Haesun Park:
Group Sparsity in Nonnegative Matrix Factorization. SDM 2012: 851-862 - [c6]Ryder C. Winck, Jingu Kim, Wayne J. Book, Haesun Park:
Command Generation Techniques for a Pin Array Using the SVD and the SNMF. SyRoCo 2012: 411-416 - [c5]Bo Thiesson, Jingu Kim:
Fast Variational Mode-Seeking. AISTATS 2012: 1230-1242 - [p1]Jingu Kim, Haesun Park:
Fast Nonnegative Tensor Factorization with an Active-Set-Like Method. High-Performance Scientific Computing 2012: 311-326 - 2011
- [j2]Wooyoung Kim, Bernard Chen, Jingu Kim, Yi Pan, Haesun Park:
Sparse nonnegative matrix factorization for protein sequence motif discovery. Expert Syst. Appl. 38(10): 13198-13207 (2011) - [j1]Jingu Kim, Haesun Park:
Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons. SIAM J. Sci. Comput. 33(6): 3261-3281 (2011) - [c4]Anoop Korattikara Balan, Levi Boyles, Max Welling, Jingu Kim, Haesun Park:
Statistical Optimization of Non-Negative Matrix Factorization. AISTATS 2011: 128-136 - 2010
- [c3]Barry L. Drake, Jingu Kim, Mahendra Mallick, Haesun Park:
Supervised Raman spectra estimation based on nonnegative rank deficient least squares. FUSION 2010: 1-8 - [c2]Jingu Kim, Haesun Park:
Fast Active-set-type Algorithms for L1-regularized Linear Regression. AISTATS 2010: 397-404
2000 – 2009
- 2008
- [c1]Jingu Kim, Haesun Park:
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons. ICDM 2008: 353-362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-06 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
