( en | de | ru )

 

Disambiguation of "Lv, Yali"

Author of the publication

copydeleteadd this publication to your clipboard
A naive learning algorithm for class-bridge-decomposable multidimensional Bayesian network classifiers.

, , , , and . Concurr. Comput. Pract. Exp., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yali Gao

Yali Lu

Ivan Lvov

Zhiyi Lv

Zuopeng LV

 

Other publications of authors with the same name

Structure connectivity and substructure connectivity of k-ary n-cube networks., , , and . Inf. Sci., (2018)Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1, 2-Structure Faults., , and . Trustcom/BigDataSE/ISPA, page 1226-1232. IEEE, (2016)An Ensemble Classifier Based on Attribute Selection and Diversity Measure., and . FSKD (2), page 106-110. IEEE Computer Society, (2008)978-0-7695-3305-6.Sign fusion of multiple QPNs based on qualitative mutual information., , , , and . Int. J. Comput. Sci. Eng., 19 (1): 36-45 (2019)A survey on modeling for behaviors of complex intelligent systems based on generative adversarial networks., , and . Comput. Sci. Rev., (2024)A naive learning algorithm for class-bridge-decomposable multidimensional Bayesian network classifiers., , , , and . Concurr. Comput. Pract. Exp., (2020)Scalable bootstrap attribute reduction for massive data., , , and . Int. J. High Perform. Comput. Netw., 12 (4): 410-417 (2018)Hamiltonian Cycle and Path Embeddings in k-Ary n-Cubes Based on Structure Faults., , and . Comput. J., 60 (2): 159-179 (2017)Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1, 3-structure faults., , , and . J. Parallel Distributed Comput., (2018)Based on Fuzzy Non-dominant and Sparse Individuals to Improve Many-Objective Differential Evolutionary., , , , and . BIC-TA (1), volume 1159 of Communications in Computer and Information Science, page 689-702. Springer, (2019)