Yuanlong 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 Chuan Fu

> Home > Persons > Yuanlong Li

Publications

2022
[i7]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-04693
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-04693
Yuanlong Li, Gaopan Huang, Min Zhou, Chuan Fu, Honglin Qiao, Yan He:
Deep Explainable Learning with Graph Based Data Assessing and Rule Reasoning. CoRR abs/2211.04693 (2022)
2021
[j16]
- view
  authority control:
- export record
  dblp key:
  - journals/tim/FengZLZQF21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tim/FengZLZQF21
Liangjun Feng, Chunhui Zhao, Yuanlong Li, Min Zhou, Honglin Qiao, Chuan Fu:
Multichannel Diffusion Graph Convolutional Network for the Prediction of Endpoint Composition in the Converter Steelmaking Process. IEEE Trans. Instrum. Meas. 70: 1-13 (2021)
2020
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/ijon/FengZCLZQF20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijon/FengZCLZQF20
Liangjun Feng, Chunhui Zhao, C. L. Philip Chen, Yuanlong Li, Min Zhou, Honglin Qiao, Chuan Fu:
BNGBS: An efficient network boosting system with triple incremental learning capabilities for more nodes, samples, and classes. Neurocomputing 412: 486-501 (2020)

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.