no code implementations • 10 Jan 2024 • Quan Li, Shixiong Jing, Lingwei Chen
Experiments on social media datasets demonstrate the state-of-the-art performance of our model on attribute inferences with considerably fewer labeled texts.
no code implementations • 18 Sep 2023 • Laixin Xie, Yang Ouyang, Longfei Chen, Ziming Wu, Quan Li
These approaches rely on the observed data to estimate the missing values and therefore encounter three main shortcomings in imputation, including the need for different imputation methods for various missing data mechanisms, heavy dependence on the assumption of data distribution, and potential introduction of bias.
no code implementations • 6 Aug 2021 • Qiangqiang Liu, Quan Li, Zhihua Zhu, Tangzhi Ye, Xiaojuan Ma
We propose RatingVis to assist experts in exploring and comparing different bank credit rating schemes.
no code implementations • 29 Jul 2019 • Haipeng Zeng, Xingbo Wang, Aoyu Wu, Yong Wang, Quan Li, Alex Endert, Huamin Qu
Our visualization system features a channel coherence view and a sentence clustering view that together enable users to obtain a quick overview of emotion coherence and its temporal evolution.
no code implementations • 11 Jul 2019 • Chen Xu, Quan Li, Junfeng Ge, Jinyang Gao, Xiaoyong Yang, Changhua Pei, Fei Sun, Jian Wu, Hanxiao Sun, Wenwu Ou
To guarantee the consistency of off-line training and on-line serving, we usually utilize the same features that are both available.
no code implementations • 8 Feb 2017 • David Gamarnik, Quan Li, Hongyi Zhang
Under a certain incoherence assumption on $M$ and for the case when both the rank and the condition number of $M$ are bounded, it was shown in \cite{CandesRecht2009, CandesTao2010, keshavan2010, Recht2011, Jain2012, Hardt2014} that $M$ can be recovered exactly or approximately (depending on some trade-off between accuracy and computational complexity) using $O(n \, \text{poly}(\log n))$ samples in super-linear time $O(n^{a} \, \text{poly}(\log n))$ for some constant $a \geq 1$.