Hong-Wei Hao

Hong-Wei Hao

Auto-generated profile, based on publicly available information

Hong-Wei Hao

Institute of Automation Chinese Academy of Sciences 100190 Beijing P.R. China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2014 in Neurocomputing
Verified
Journal Article
Closed access
XYXu-Cheng Yin
Xu-Cheng Yin
Kaizhu HuangKaizhu Huang
Kaizhu Huang
HHHong-Wei Hao
Hong-Wei Hao
KIKhalid Iqbal
Khalid Iqbal
ZWZhi-Bin Wang
Zhi-Bin Wang

1 January 2013
Verified
Conference Paper
Closed access
LSLi Song
Li Song
XYXu-Cheng Yin
Xu-Cheng Yin
BZBo-Wen Zhang
Bo-Wen Zhang
HHHong-Wei Hao
Hong-Wei Hao

26 September 2013
Verified
Closed access
XYXu-Cheng Yin
Xu-Cheng Yin
XYXuwang Yin
Xuwang Yin
Kaizhu HuangKaizhu Huang
Kaizhu Huang
HHHong-Wei Hao
Hong-Wei Hao

10 March 2015 in arXiv
Verified
Preprint
Open access
PDF file
JXJiaming Xu
Jiaming Xu
BXBo Xu
Bo Xu
GTGuanhua Tian
Guanhua Tian
JZJun Zhao
Jun Zhao
FWFangyuan Wang
Fangyuan Wang
HHHongwei Hao
Hongwei Hao
Due to computational and storage efficiencies of compact binary codes, hashing has been widely used for large-scale similarity search. Unfortunately, many existing hashing methods based on observed keyword features are not effective for short texts due to the sparseness and shortness. Recently, some researchers try to utilize latent topics of certain granularity to preserve semantic similarity in hash codes beyond keyword matching. However, topics of certain granularity are not adequate to represent the intrinsic semantic information. In this paper, we present a novel unified approach for short text Hashing using Multi-granularity Topics and Tags, dubbed HMTT. In particular, we propose a selection method to choose the optimal multi-granularity topics depending on the type of dataset, and design two distinct hashing strategies to incorporate multi-granularity topics. We also propose a simple and effective method to exploit tags to enhance the similarity of related texts. We carry out extensive experiments on one short text dataset as well as on one normal text dataset. The results demonstrate that our approach is effective and significantly outperforms baselines on several evaluation metrics.