Xinbo Liu
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
Xinbo Liu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Buhong Wang
Affiliation Information and Navigation college, Air Force Engineering University, Xi’an, Shaanxi, China
1 shared publicationCan Zhu
Institute of Materials and Systems for Sustainability (IMaSS) Nagoya University Furo‐cho Chikusa‐ku Nagoya 464‐8603 Japan
1 shared publication- Jiaheng Zhang
Harbin Institute of Technology (Shenzhen)
1 shared publication - Kentaro Kutsukake
Nagoya University
1 shared publication - Miho Tagawa
Nagoya University
1 shared publication Shota Seki
Graduate School of Engineering Nagoya University Furo‐cho Chikusa‐ku Nagoya 464‐8603 Japan
1 shared publication
Latest Publications
- 3 July 2022
- Published by Wiley in Advanced Theory and Simulations
- Vol. 5 (9)
A Transfer Learning‐Based Method for Facilitating the Prediction of Unsteady Crystal Growth
Real‐time prediction and dynamic control systems that can adapt to an unsteady environment are necessary for material fabrication processes, especially crystal growth. Recent studies have demonstrated the effectiveness of machine learning in predicting an unsteady crystal growth process, but its wider application is hindered by the large amount of training data required for sufficient accuracy. To address this problem, this study investigates the capability of transfer learning to predict geometric evolution in an unsteady silicon carbide (SiC) solution growth system based on a small amount of data. The performance of transferred models is discussed regarding the effect of the transfer learning method, training data amount, and time step length. The transfer learning strategy yields the same accuracy as that of training from scratch but requires only 20% of the training data. The accuracy is stably inherited through successive time steps, which demonstrates the effectiveness of transfer learning in reducing the required amount of training data for predicting evolution in an unsteady crystal growth process. Moreover, the transferred models trained with relatively more data (no more than 100%) further improve the accuracy inherited from the source model through multiple time steps, which broadens the application scope of transfer learning.
- 3 July 2022
- Published by Wiley in Advanced Theory and Simulations
- Vol. 5 (9)
A Transfer Learning‐Based Method for Facilitating the Prediction of Unsteady Crystal Growth
Real‐time prediction and dynamic control systems that can adapt to an unsteady environment are necessary for material fabrication processes, especially crystal growth. Recent studies have demonstrated the effectiveness of machine learning in predicting an unsteady crystal growth process, but its wider application is hindered by the large amount of training data required for sufficient accuracy. To address this problem, this study investigates the capability of transfer learning to predict geometric evolution in an unsteady silicon carbide (SiC) solution growth system based on a small amount of data. The performance of transferred models is discussed regarding the effect of the transfer learning method, training data amount, and time step length. The transfer learning strategy yields the same accuracy as that of training from scratch but requires only 20% of the training data. The accuracy is stably inherited through successive time steps, which demonstrates the effectiveness of transfer learning in reducing the required amount of training data for predicting evolution in an unsteady crystal growth process. Moreover, the transferred models trained with relatively more data (no more than 100%) further improve the accuracy inherited from the source model through multiple time steps, which broadens the application scope of transfer learning.
- 1 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 289-292
A Patent recommendation algorithm based on topic classification and semantic similarity
Patent recommendation algorithms, as an important means of information push, are an important means of solving the information overload of today's massive data. However, traditional recommendation algorithms have problems such as the inability to make full use of user information, system cold start, and sparse data matrix, so this paper proposes a patented recommendation algorithm based on topic classification and semantic similarity. By introducing the Bert neural network, this algorithm extracts keywords from patent titles and abstracts, and then transforms them into word vectors. By using them, the algorithm uses the DBSCAN clustering method to construct patent subject area categories. Combining with SimNet, a text similarity framework, it becomes a holistic analysis model. Inputting patent text to be predicted into trained analysis model, then it can do patent recommendation work. Comparing with the traditional recommendation algorithm, the experiment shows that the algorithm proposed in this paper can obtain a better recommendation effect on the patent recommendation.
- 1 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 289-292
A Patent recommendation algorithm based on topic classification and semantic similarity
Patent recommendation algorithms, as an important means of information push, are an important means of solving the information overload of today's massive data. However, traditional recommendation algorithms have problems such as the inability to make full use of user information, system cold start, and sparse data matrix, so this paper proposes a patented recommendation algorithm based on topic classification and semantic similarity. By introducing the Bert neural network, this algorithm extracts keywords from patent titles and abstracts, and then transforms them into word vectors. By using them, the algorithm uses the DBSCAN clustering method to construct patent subject area categories. Combining with SimNet, a text similarity framework, it becomes a holistic analysis model. Inputting patent text to be predicted into trained analysis model, then it can do patent recommendation work. Comparing with the traditional recommendation algorithm, the experiment shows that the algorithm proposed in this paper can obtain a better recommendation effect on the patent recommendation.
- Open Access
- 21 November 2018
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 13 (11) , e0207705
An algorithm for fragment-aware virtual network reconfiguration
In view of the fact that the current online virtual network embedding algorithms do not consider the fragment resources generated in the embedding process deeply enough, resulting in the problem that the acceptance ratio and the revenue to cost ratio are both low, a mathematical model for virtual network reconfiguration is constructed and a heuristic algorithm for fragment-aware virtual network reconfiguration (FA-VNR) is proposed. The FA-VNR algorithm selects the set of virtual nodes to be migrated according to the fragment degrees of the physical nodes, and selects the best virtual node migration scheme according to the reduction of the fragment degrees of the physical nodes as well as the reduction of the embedding cost of the embedded virtual networks. Extensive simulation results show that the proposed FA-VNR algorithm not only can obviously improve the acceptance ratio and the revenue to cost ratio of the current online virtual network embedding algorithm, but also has better optimization effect than the existing virtual network reconfiguration algorithm.
- 21 November 2018
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 13 (11) , e0207705
Open AccessAn algorithm for fragment-aware virtual network reconfiguration
In view of the fact that the current online virtual network embedding algorithms do not consider the fragment resources generated in the embedding process deeply enough, resulting in the problem that the acceptance ratio and the revenue to cost ratio are both low, a mathematical model for virtual network reconfiguration is constructed and a heuristic algorithm for fragment-aware virtual network reconfiguration (FA-VNR) is proposed. The FA-VNR algorithm selects the set of virtual nodes to be migrated according to the fragment degrees of the physical nodes, and selects the best virtual node migration scheme according to the reduction of the fragment degrees of the physical nodes as well as the reduction of the embedding cost of the embedded virtual networks. Extensive simulation results show that the proposed FA-VNR algorithm not only can obviously improve the acceptance ratio and the revenue to cost ratio of the current online virtual network embedding algorithm, but also has better optimization effect than the existing virtual network reconfiguration algorithm.