Hongbin Dong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hongbin Dong has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yiwen Liang
School of Computer Science, Wuhan University, Wuhan, China
2 shared publications Chengyu Tan
Computer SchoolWuhan UniversityWuhan430072China
1 shared publication- Chengyu Tan
School of Computer Science, Wuhan University, Wuhan, China
1 shared publication - Dongmei Wang
School of Computer Science, Wuhan University, Wuhan, China
1 shared publication Jie Ke
Computer SchoolWuhan UniversityWuhan430072China
1 shared publication- Sai Liu
Collage of Computer Science, South-Central University for Nationalities, Wuhan, China
1 shared publication
Latest Publications
- 16 February 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (9) , 11680-11701
Innate immune memory and its application to artificial immune systems
The study of innate immune-based algorithms is an important research domain in Artificial Immune System (AIS), such as Dendritic Cell Algorithm (DCA), Toll-Like Receptor algorithm (TLRA). The parameters in these algorithms usually require either manually pre-defined usually provided by the immunologists, or empirically derived from the training dataset, and result in poor self-adaptation and self-learning. The fundamental reason is that the original innate immune mechanisms lack adaptive biological theory. To solve this problem, a theory called ‘Trained Immunity™ or Innate Immune Memory (IIM)™ that thinks innate immunity can also build immunological memory to enhance the immune system™s learning and adaptive reactions to the second stimulus is introduced into AIS to improve the innate immune algorithms™ adaptability. In this study, we present an overview of IIM with particular emphasis on analogies in the AIS world, and a modified DCA with an effective automated tuning mechanism based on IIM (IIM-DCA) to optimize migration threshold of DCA. The migration threshold of Dendritic Cells (DCs) determines the lifespan of the antigen collected by DCs, and directly affect the detection speed and accuracy of DCA. Experiments on real datasets show that our proposed IIM-DCA which integrates Innate Immune Memory mechanism delivers more accurate results.
- 16 February 2022
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 78 (9) , 11680-11701
Innate immune memory and its application to artificial immune systems
The study of innate immune-based algorithms is an important research domain in Artificial Immune System (AIS), such as Dendritic Cell Algorithm (DCA), Toll-Like Receptor algorithm (TLRA). The parameters in these algorithms usually require either manually pre-defined usually provided by the immunologists, or empirically derived from the training dataset, and result in poor self-adaptation and self-learning. The fundamental reason is that the original innate immune mechanisms lack adaptive biological theory. To solve this problem, a theory called ‘Trained Immunity™ or Innate Immune Memory (IIM)™ that thinks innate immunity can also build immunological memory to enhance the immune system™s learning and adaptive reactions to the second stimulus is introduced into AIS to improve the innate immune algorithms™ adaptability. In this study, we present an overview of IIM with particular emphasis on analogies in the AIS world, and a modified DCA with an effective automated tuning mechanism based on IIM (IIM-DCA) to optimize migration threshold of DCA. The migration threshold of Dendritic Cells (DCs) determines the lifespan of the antigen collected by DCs, and directly affect the detection speed and accuracy of DCA. Experiments on real datasets show that our proposed IIM-DCA which integrates Innate Immune Memory mechanism delivers more accurate results.
- 22 February 2020
- Published by Springer Nature in Earth Science Informatics
- Vol. 13 (2) , 447-457
The deterministic dendritic cell algorithm with Haskell in earthquake magnitude prediction
- 22 February 2020
- Published by Springer Nature in Earth Science Informatics
- Vol. 13 (2) , 447-457
The deterministic dendritic cell algorithm with Haskell in earthquake magnitude prediction
- Open Access
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 26 (5) , 986-992
PBWA: A Provenance‐Based What‐If Analysis Approach for Data Mining Processes
This paper presents a Provenance-based what-if analysis approach (PBWA) for data mining processes, so decision makers can examine the latest mining result under hypothetical business contexts. It fills the gap that data mining only reveals past status of enterprises with historical data. Provenance information is a kind of metadata of data mining processes. PBWA uses it to identify relevant operation path and intermediate results that is affected by hypothetical business contexts. It refreshes the mining result by partially rerunning the affected portions. Different from previous studies only for relational operations, PBWA can take more general operations into account. Besides, it focuses on the whole mining processes. Experiments demonstrate that when the affected ratio is less than 74% and 87% in different contexts, PBWA can achieve better time performance.
- 1 September 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 26 (5) , 986-992
Open AccessPBWA: A Provenance‐Based What‐If Analysis Approach for Data Mining Processes
This paper presents a Provenance-based what-if analysis approach (PBWA) for data mining processes, so decision makers can examine the latest mining result under hypothetical business contexts. It fills the gap that data mining only reveals past status of enterprises with historical data. Provenance information is a kind of metadata of data mining processes. PBWA uses it to identify relevant operation path and intermediate results that is affected by hypothetical business contexts. It refreshes the mining result by partially rerunning the affected portions. Different from previous studies only for relational operations, PBWA can take more general operations into account. Besides, it focuses on the whole mining processes. Experiments demonstrate that when the affected ratio is less than 74% and 87% in different contexts, PBWA can achieve better time performance.