Binru Zhang

Dr. Binru Zhang

School of Finance and Economics, Yangtze Normal University
orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
5 January 2020 in Asia Pacific Journal of Tourism Research
Verified
Journal Article
Closed access
BZBinru Zhang
Binru Zhang
NLNao Li
Nao Li
FSFeng Shi
Feng Shi
RLRob Law
Rob Law
This study introduces the concept of long short-term memory (LSTM) network to handle complex time series forecasting problems in the tourism industry. To validate the efficiency of the developed method, we used the daily tourist flow and consumer search data of Jiuzhaigou, a popular tourist spot in China, from 8 October 2013 to 7 August 2017 as the experimental dataset for empirical analysis. According to the 150-day forecasting results, LSTM shows the best statistical performance in the training and test sets compared with its counterparts.

29 August 2019 in Sustainability
Verified
Journal Article
Open access
PDF file
BZBinru Zhang
Binru Zhang
YPYulian Pu
Yulian Pu
YWYuanyuan Wang
Yuanyuan Wang
JLJueyou Li
Jueyou Li
Accurate forecasting of the hotel accommodation demands is extremely critical to the sustainable development of tourism-related industries. In view of the ever-increasing tourism data, this paper constructs a deep learning framework to handle the prediction problem in the hotel accommodation demands. Taking China’s Hainan province as an empirical example, the internet search index is used from August 2008 to May 2019 to forecast the overnight passenger flows for hotels accommodation in Hainan Province, China. Forecasting results indicate that compared to benchmark models, the constructed forecasting method can effectively simulate dynamic characteristics of the overnight passenger flows for the hotel accommodation and significantly improve the forecasting performance of the model. Forecasting results can provide necessary references for decision-making in tourism-related industries, and this forecasting framework can also be extended to other similar complex time series forecasting problems.

7 May 2021 in Tourism Economics
Verified
Journal Article
Open access
PDF file
BZBinru Zhang
Binru Zhang
NLNao Li
Nao Li
RLRob Law
Rob Law
HLHeng Liu
Heng Liu
The large amounts of hospitality and tourism-related search data sampled at different frequencies have long presented a challenge for hospitality and tourism demand forecasting. This study aims to evaluate the applicability of large panels of search series sampled at daily frequencies to improve the forecast precision of monthly hotel demand. In particular, a hybrid mixed-data sampling regression approach integrating a dynamic factor model and forecast combinations is the first reported method to incorporate mixed-frequency data while remaining parsimonious and flexible. A case study is undertaken by investigating Sanya, the southernmost city in Hainan province, as a tourist destination using 9 years of the experimental data set. Dynamic factor analysis is used to extract the information from large panels of web search series, and forecast combinations are attempted to obtain the final prediction results of the individual forecasts to enhance the prediction accuracy further. The empirical analysis results suggest that the developed hybrid forecast approach leads to improvements in monthly forecasts of hotel occupancy over its competitors.

1 January 2021 in Journal of Industrial and Management Optimization
Verified
Journal Article
Open access
PDF file
BZBinru Zhang
Binru Zhang
CGChuanye Gu
Chuanye Gu
JLJueyou Li
Jueyou Li

28 October 2021 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
RHRong Hu
Rong Hu
BZBinru Zhang
Binru Zhang
This paper investigates a constrained distributed optimization problem enabled by differential privacy where the underlying network is time-changing with unbalanced digraphs. To solve such a problem, we first propose a differentially private online distributed algorithm by injecting adaptively adjustable Laplace noises. The proposed algorithm can not only protect the privacy of participants without compromising a trusted third party, but also be implemented on more general time-varying unbalanced digraphs. Under mild conditions, we then show that the proposed algorithm can achieve a sublinear expected bound of regret for general local convex objective functions. The result shows that there is a trade-off between the optimization accuracy and privacy level. Finally, numerical simulations are conducted to validate the efficiency of the proposed algorithm.