Hao Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hao Lin has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
Junjie Wu
School of Economics and Management, Beihang University, China and Beijing Advanced Innovation Center for Big Data and Brain Computing, Beihang University, Beijing, China
8 shared publications- Junjie Wu
Beihang University
8 shared publications - Guannan Liu
Beihang University
5 shared publications Guannan Liu
Beihang University, Beijing, China
4 shared publicationsYuan Zuo
School of Economics and Management, Beihang University, Beijing, China
4 shared publications- Yuan Zuo
MIIT Key Laboratory of Data Intelligence and Management Beihang University
4 shared publications
Latest Publications
- 10 August 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 208, 258-264
REDNet: Two-stage knowledge distillation for robust edge time series forecasting
- 10 August 2026
- Published by Elsevier in Pattern Recognition Letters
- Vol. 208, 258-264
REDNet: Two-stage knowledge distillation for robust edge time series forecasting
- 17 April 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (7)
Catching fraudulent “invisible hands”: An approach to finding associative dense blocks in bipartite graphs
- 17 April 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (7)
Catching fraudulent “invisible hands”: An approach to finding associative dense blocks in bipartite graphs
- 1 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (2) , 571-586
Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series
A gray market emerges when some distributors divert products to unauthorized distributors/retailers to make sneaky profits from the manufacturers’ differential channel incentives, such as quantity discounts. Traditionally, manufacturers rely heavily on internal audits to periodically investigate the flows of products and funds so as to deter the gray market; however, this is too costly given the large number of distributors and their huge volumes of orders. Owing to the advances in data analytics techniques, the ordering quantities of a distributor over time, which form multivariate time series, can help reveal suspicious product diversion behaviors and narrow the audit scope drastically. To that end, in this paper, we build on the recent advancement of representation learning for time series and adopt a sequence autoencoder to automatically characterize the overall demand patterns. To cope with the underlying entangled factors and interfering information in the multivariate time series of ordering quantities, we develop a disentangled learning scheme to construct more effective sequence representations. An interdistributor correlation regularization is also proposed to ensure more reliable representations. Finally, given the highly scarce anomaly labels for the detection task, an unsupervised deep generative model based on the learned representations of the distributors is developed to estimate the densities of distributions, which enables the anomaly scores generated through end-to-end learning. Extensive experiments on a real-world distribution channel data set and a larger simulated data set empirically validate our model’s superior and robust performances compared with several state-of-the-art baselines. Additionally, our illustrative economic analysis demonstrates that the manufacturers can launch more targeted and cost-effective audits toward the suspected distributors recommended by our model so as to deter the gray market. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72031001, 72301017, 72371011, and 72242101]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0155 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0155 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 March 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (2) , 571-586
Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series
A gray market emerges when some distributors divert products to unauthorized distributors/retailers to make sneaky profits from the manufacturers’ differential channel incentives, such as quantity discounts. Traditionally, manufacturers rely heavily on internal audits to periodically investigate the flows of products and funds so as to deter the gray market; however, this is too costly given the large number of distributors and their huge volumes of orders. Owing to the advances in data analytics techniques, the ordering quantities of a distributor over time, which form multivariate time series, can help reveal suspicious product diversion behaviors and narrow the audit scope drastically. To that end, in this paper, we build on the recent advancement of representation learning for time series and adopt a sequence autoencoder to automatically characterize the overall demand patterns. To cope with the underlying entangled factors and interfering information in the multivariate time series of ordering quantities, we develop a disentangled learning scheme to construct more effective sequence representations. An interdistributor correlation regularization is also proposed to ensure more reliable representations. Finally, given the highly scarce anomaly labels for the detection task, an unsupervised deep generative model based on the learned representations of the distributors is developed to estimate the densities of distributions, which enables the anomaly scores generated through end-to-end learning. Extensive experiments on a real-world distribution channel data set and a larger simulated data set empirically validate our model’s superior and robust performances compared with several state-of-the-art baselines. Additionally, our illustrative economic analysis demonstrates that the manufacturers can launch more targeted and cost-effective audits toward the suspected distributors recommended by our model so as to deter the gray market. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72031001, 72301017, 72371011, and 72242101]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0155 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0155 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- Open Access
- 15 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (4) , 1-27
Algorithm 1038: KCC: A MATLAB Package for k -Means-based Consensus Clustering
Consensus clustering is gaining increasing attention for its high quality and robustness. In particular, k -means-based Consensus Clustering (KCC) converts the usual computationally expensive problem to a classic k -means clustering with generalized utility functions, bringing potentials for large-scale data clustering on different types of data. Despite KCC’s applicability and generalizability, implementing this method such as representing the binary dataset in the k -means heuristic is challenging and has seldom been discussed in prior work. To fill this gap, we present a MATLAB package, KCC, that completely implements the KCC framework and utilizes a sparse representation technique to achieve a low space complexity. Compared to alternative consensus clustering packages, the KCC package is of high flexibility, efficiency, and effectiveness. Extensive numerical experiments are also included to show its usability on real-world datasets.
- 15 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 49 (4) , 1-27
Open AccessAlgorithm 1038: KCC: A MATLAB Package for k -Means-based Consensus Clustering
Consensus clustering is gaining increasing attention for its high quality and robustness. In particular, k -means-based Consensus Clustering (KCC) converts the usual computationally expensive problem to a classic k -means clustering with generalized utility functions, bringing potentials for large-scale data clustering on different types of data. Despite KCC’s applicability and generalizability, implementing this method such as representing the binary dataset in the k -means heuristic is challenging and has seldom been discussed in prior work. To fill this gap, we present a MATLAB package, KCC, that completely implements the KCC framework and utilizes a sparse representation technique to achieve a low space complexity. Compared to alternative consensus clustering packages, the KCC package is of high flexibility, efficiency, and effectiveness. Extensive numerical experiments are also included to show its usability on real-world datasets.
- 6 December 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series
The goal of this software is to facilitate readers to reproduce the experimental results in this paper. The experiments verify the effectiveness of the proposed model on both real-world and synthetic data sets.
- 6 December 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series
The goal of this software is to facilitate readers to reproduce the experimental results in this paper. The experiments verify the effectiveness of the proposed model on both real-world and synthetic data sets.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (11) , 15292-15305
BoostXML: Gradient Boosting for Extreme Multilabel Text Classification With Tail Labels
Multilabel learning involving hundreds of thousands or even millions of labels is referred to as extreme multilabel learning (XML), in which the labels often follow a power-law distribution with the majority occurring in very few data points as tail labels. Recent years have witnessed the intensive use of deep-learning methods for high-performance XML, but they are typically optimized for the head labels with abundant training instances and less consider the performance on tail labels, which, however, like the needles in haystacks, are often the focus of attention in real-life applications. In light of this, we present BoostXML, a deep learning-based XML method for extreme multilabel text classification, enhanced greatly by gradient boosting. In BoostXML, we pay more attention to tail labels in each Boosting Step by optimizing the residual mostly from unfitted training instances with tail labels. A Corrective Step is further proposed to avoid the mismatching between the text encoder and weak learners during optimization, which reduces the risk of falling into local optima and improves model performance. A Pretraining Step is also introduced in the initial stage of BoostXML to avoid exorbitant bias to tail labels. Extensive experiments on five benchmark datasets with state-of-the-art baselines demonstrate the advantage of BoostXML in tail-label prediction.
- 26 June 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (11) , 15292-15305
BoostXML: Gradient Boosting for Extreme Multilabel Text Classification With Tail Labels
Multilabel learning involving hundreds of thousands or even millions of labels is referred to as extreme multilabel learning (XML), in which the labels often follow a power-law distribution with the majority occurring in very few data points as tail labels. Recent years have witnessed the intensive use of deep-learning methods for high-performance XML, but they are typically optimized for the head labels with abundant training instances and less consider the performance on tail labels, which, however, like the needles in haystacks, are often the focus of attention in real-life applications. In light of this, we present BoostXML, a deep learning-based XML method for extreme multilabel text classification, enhanced greatly by gradient boosting. In BoostXML, we pay more attention to tail labels in each Boosting Step by optimizing the residual mostly from unfitted training instances with tail labels. A Corrective Step is further proposed to avoid the mismatching between the text encoder and weak learners during optimization, which reduces the risk of falling into local optima and improves model performance. A Pretraining Step is also introduced in the initial stage of BoostXML to avoid exorbitant bias to tail labels. Extensive experiments on five benchmark datasets with state-of-the-art baselines demonstrate the advantage of BoostXML in tail-label prediction.
- Open Access
- 1 January 2023
- Published by Clausius Scientific Press, Inc. in Lecture Notes on Language and Literature
- Vol. 6 (3) , 27-32
A Study of Synonyms Based on COCA Corpus Road and Street as Examples
There are a large number of near-synonyms in English, differentiating these words have always been one of the major difficulties in English learning. The participation of the corpus provides a new approach to the identification of near-synonyms.Based on the Corpus of Contemporary American English (COCA), this study identifies Road and Street, a group of near-synonyms in terms of register, collocation and semantic rhyme, and the results show that the main difference between the prosody is in semantic and lexical collocation.The purpose of this paper is to help learners further improve their vocabulary recognition skills by means of the corpus.
- 1 January 2023
- Published by Clausius Scientific Press, Inc. in Lecture Notes on Language and Literature
- Vol. 6 (3) , 27-32
Open AccessA Study of Synonyms Based on COCA Corpus Road and Street as Examples
There are a large number of near-synonyms in English, differentiating these words have always been one of the major difficulties in English learning. The participation of the corpus provides a new approach to the identification of near-synonyms.Based on the Corpus of Contemporary American English (COCA), this study identifies Road and Street, a group of near-synonyms in terms of register, collocation and semantic rhyme, and the results show that the main difference between the prosody is in semantic and lexical collocation.The purpose of this paper is to help learners further improve their vocabulary recognition skills by means of the corpus.
- 14 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Topic Modeling of Short Texts: A Pseudo-Document View with Word Embedding Enhancement
Recent years have witnessed the unprecedented growth of online social media, resulting in short texts being the prevalent format of information on the Internet. Given the sparsity of data, however, short-text topic modeling remains a critical yet much-watched challenge in both academia and industry. Research has been devoted to building different types of probabilistic topic models for short texts, among which self-aggregation methods emerged recently to provide informative cross-text word co-occurrences. However, models along this line are still in their infancy and typically yield overfit results and exhibit high computational costs. In this paper, we propose a novel model called Pseudo-document-based Topic Model (PTM), which introduces the concept of pseudo-document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo-documents rather than short texts, PTM yields excellent performance in accuracy and efficiency. A word embedding-enhanced PTM (WE-PTM) is also proposed to leverage pre-trained word embeddings, which is essential to further alleviating data sparsity. Extensive experiments with self-aggregation or word embedding-based baselines on four real-world datasets including two online media short texts, demonstrate the high-quality topics learned by our models. Robustness to limited training samples and the explainable semantics of topics are also investigated.
- 14 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Topic Modeling of Short Texts: A Pseudo-Document View with Word Embedding Enhancement
Recent years have witnessed the unprecedented growth of online social media, resulting in short texts being the prevalent format of information on the Internet. Given the sparsity of data, however, short-text topic modeling remains a critical yet much-watched challenge in both academia and industry. Research has been devoted to building different types of probabilistic topic models for short texts, among which self-aggregation methods emerged recently to provide informative cross-text word co-occurrences. However, models along this line are still in their infancy and typically yield overfit results and exhibit high computational costs. In this paper, we propose a novel model called Pseudo-document-based Topic Model (PTM), which introduces the concept of pseudo-document to implicitly aggregate short texts against data sparsity. By modeling the topic distributions of latent pseudo-documents rather than short texts, PTM yields excellent performance in accuracy and efficiency. A word embedding-enhanced PTM (WE-PTM) is also proposed to leverage pre-trained word embeddings, which is essential to further alleviating data sparsity. Extensive experiments with self-aggregation or word embedding-based baselines on four real-world datasets including two online media short texts, demonstrate the high-quality topics learned by our models. Robustness to limited training samples and the explainable semantics of topics are also investigated.
- 23 July 2020
- Published by Springer Nature in World Wide Web
- Vol. 23 (6) , 3001-3023
A Pseudo-document-based Topical N-grams model for short texts
- 23 July 2020
- Published by Springer Nature in World Wide Web
- Vol. 23 (6) , 3001-3023
A Pseudo-document-based Topical N-grams model for short texts
- Open Access
- 23 May 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 38 (4) , 1-33
Enhancing Employer Brand Evaluation with Collaborative Topic Regression Models
Employer Brand Evaluation (EBE) is to understand an employer’s unique characteristics to identify competitive edges. Traditional approaches rely heavily on employers’ financial information, including financial reports and filings submitted to the Securities and Exchange Commission (SEC), which may not be readily available for private companies. Fortunately, online recruitment services provide a variety of employers’ information from their employees’ online ratings and comments, which enables EBE from an employee’s perspective. To this end, in this article, we propose a method named Company Profiling–based Collaborative Topic Regression (CPCTR) to collaboratively model both textual (i.e., reviews) and numerical information (i.e., salaries and ratings) for learning latent structural patterns of employer brands. With identified patterns, we can effectively conduct both qualitative opinion analysis and quantitative salary benchmarking. Moreover, a Gaussian processes--based extension, GPCTR, is proposed to capture the complex correlation among heterogeneous information. Extensive experiments are conducted on three real-world datasets to validate the effectiveness and generalizability of our methods in real-life applications. The results clearly show that our methods outperform state-of-the-art baselines and enable a comprehensive understanding of EBE.
- 23 May 2020
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 38 (4) , 1-33
Open AccessEnhancing Employer Brand Evaluation with Collaborative Topic Regression Models
Employer Brand Evaluation (EBE) is to understand an employer’s unique characteristics to identify competitive edges. Traditional approaches rely heavily on employers’ financial information, including financial reports and filings submitted to the Securities and Exchange Commission (SEC), which may not be readily available for private companies. Fortunately, online recruitment services provide a variety of employers’ information from their employees’ online ratings and comments, which enables EBE from an employee’s perspective. To this end, in this article, we propose a method named Company Profiling–based Collaborative Topic Regression (CPCTR) to collaboratively model both textual (i.e., reviews) and numerical information (i.e., salaries and ratings) for learning latent structural patterns of employer brands. With identified patterns, we can effectively conduct both qualitative opinion analysis and quantitative salary benchmarking. Moreover, a Gaussian processes--based extension, GPCTR, is proposed to capture the complex correlation among heterogeneous information. Extensive experiments are conducted on three real-world datasets to validate the effectiveness and generalizability of our methods in real-life applications. The results clearly show that our methods outperform state-of-the-art baselines and enable a comprehensive understanding of EBE.