Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

ZhenJin Huang

dblp:115/4636 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning theory · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory
neural network theory		 0.112012
The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks · Sci. China Inf. Sci. 2012
Computational complexity › counting complexity › modular counting
parity problems		 0.012012
The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks · Sci. China Inf. Sci. 2012

Methods — techniques the papers use, named apart from their topics

binary neural network analysis · 0.3
YearPublicationVenuePosition
2012 The upper bound of the minimal number of hidden neurons for the parity problem in binary neural networks
Yang Lu 0015, Juan Yang 0001, ZhenJin Huang
 Sci. China Inf. Sci.4