Hongru Li

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Huiping Guo

> Home > Persons > Hongru Li

Publications

2023
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/kais/GuoL23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kais/GuoL23
Huiping Guo, Hongru Li:
A decomposition hybrid structure learning algorithm for Bayesian network using expert knowledge. Knowl. Inf. Syst. 65(7): 3023-3044 (2023)
[j29]
- view
  authority control:
- export record
  dblp key:
  - journals/soco/JiaLG23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/JiaLG23
Xiaolong Jia, Hongru Li, Huiping Guo:
A recursive local search method of separators for Bayesian network decomposition structure learning algorithm. Soft Comput. 27(7): 3673-3687 (2023)
2020
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/ida/GuoL20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ida/GuoL20
Huiping Guo, Hongru Li:
An efficient Bayesian network structure learning algorithm using the strategy of two-stage searches. Intell. Data Anal. 24(5): 1087-1106 (2020)
2018
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/entropy/LiG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/entropy/LiG18
Hongru Li, Huiping Guo:
A Hybrid Structure Learning Algorithm for Bayesian Network Using Experts' Knowledge. Entropy 20(8): 620 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.