default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaixun Hua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Kang Liu, Jipeng Qiang, Yun Li, Yunhao Yuan, Yi Zhu, Kaixun Hua:
Multilingual Lexical Simplification via Paraphrase Generation. ECAI 2023: 1529-1535- [i5]Jiayang Ren, Ningning You, Kaixun Hua, Chaojie Ji, Yankai Cao:
A Global Optimization Algorithm for K-Center Clustering of One Billion Samples. CoRR abs/2301.00061 (2023) - [i4]Kang Liu, Jipeng Qiang, Yun Li, Yunhao Yuan, Yi Zhu, Kaixun Hua:
Multilingual Lexical Simplification via Paraphrase Generation. CoRR abs/2307.15286 (2023) - [i3]Jiayang Ren, Valentín Osuna-Enciso, Morimasa Okamoto
, Qiangqiang Mao, Chaojie Ji, Liang Cao, Kaixun Hua, Yankai Cao:
A GPU-Accelerated Moving-Horizon Algorithm for Training Deep Classification Trees on Large Datasets. CoRR abs/2311.06952 (2023) - 2022
- [j2]Yun Li, Kaixun Hua, Yankai Cao:
Using stochastic programming to train neural network approximation of nonlinear MPC laws. Autom. 146: 110665 (2022) - [j1]Qian Chen, Lili Zuo, Changchun Wu, Yun Li, Kaixun Hua, Mahdi Mehrtash, Yankai Cao:
Optimization of compressor standby schemes for gas transmission pipeline systems based on gas delivery reliability. Reliab. Eng. Syst. Saf. 221: 108351 (2022) - [c8]Mingfei Shi, Kaixun Hua, Jiayang Ren, Yankai Cao:
Global Optimization of K-Center Clustering. ICML 2022: 19956-19966 - [c7]Kaixun Hua, Jiayang Ren, Yankai Cao:
A Scalable Deterministic Global Optimization Algorithm for Training Optimal Decision Tree. NeurIPS 2022 - [c6]Jiayang Ren, Kaixun Hua, Yankai Cao:
Global Optimal K-Medoids Clustering of One Million Samples. NeurIPS 2022 - [i2]Yun Li, Yixiu Wang, Yifu Chen, Kaixun Hua, Jiayang Ren, Ghazaleh Mozafari, Qiugang Lu, Yankai Cao:
Deep Learning-based Predictive Control of Battery Management for Frequency Regulation. CoRR abs/2201.01166 (2022) - 2021
- [c5]Kaixun Hua, Mingfei Shi, Yankai Cao:
A Scalable Deterministic Global Optimization Algorithm for Clustering Problems. ICML 2021: 4391-4401
2010 – 2019
- 2019
- [i1]Dan A. Simovici, Kaixun Hua:
Data ultrametricity and clusterability. CoRR abs/1908.10833 (2019) - 2018
- [c4]Kaixun Hua, Dan A. Simovici:
Dual Criteria Determination of the Number of Clusters in Data. SYNASC 2018: 201-208 - 2016
- [c3]Kaixun Hua, Dan A. Simovici:
Long-lead term precipitation forecasting by Hierarchical Clustering-based Bayesian Structural Vector Autoregression. ICNSC 2016: 1-6 - 2015
- [c2]Dan A. Simovici, Rosanne Vetro, Kaixun Hua:
Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining. EGC 2015: 89-100 - [c1]Dan A. Simovici, Rosanne Vetro, Kaixun Hua:
Ultrametricity of Dissimilarity Spaces and Its Significance for Data Mining. EGC (best of volume) 2015: 141-155
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-11-07 20:36 CET 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:
