William Zhu

Affiliations:
  • University of Electronic Science and Technology of China, Institute of Fundamental and Frontier Sciences, Chengdu, China
  • Minnan Normal University, Laboratory of Granular Computing, Zhangzhou, China
  • Zhangzhou Normal University, Lab of Granular Computing, China (former)
  • Chinese Academy and Sciences, Institute of Automation, Beijing, China (former)
  • University of Auckland, New Zealand (PhD 2006)
  • University of Arizona, AZ, USA (PhD 2003)
  • Northwestern Polytechnical University, Xi'an, China (PhD 2001)


According to our database1, William Zhu authored at least 194 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Layered feature representation for differentiable architecture search.
Soft Comput., 2022

Saliency: a new selection criterion of important architectures in neural architecture search.
Neural Comput. Appl., 2022

MDMD options discovery for accelerating exploration in sparse-reward domains.
Knowl. Based Syst., 2022

Multi-view fuzzy clustering of deep random walk and sparse low-rank embedding.
Inf. Sci., 2022

A CNN-based policy for optimizing continuous action control by learning state sequences.
Neurocomputing, 2022

WDIBS: Wasserstein deterministic information bottleneck for state abstraction to balance state-compression and performance.
Appl. Intell., 2022

2021
A Survey of Social Image Colocalization.
IEEE Trans. Comput. Soc. Syst., 2021

GDPC: generalized density peaks clustering algorithm based on order similarity.
Int. J. Mach. Learn. Cybern., 2021

Adaptive exploration policy for exploration-exploitation tradeoff in continuous action control optimization.
Int. J. Mach. Learn. Cybern., 2021

Anchor: The achieved goal to replace the subgoal for hierarchical reinforcement learning.
Knowl. Based Syst., 2021

Deep random walk of unitary invariance for large-scale data representation.
Inf. Sci., 2021

Combating Fake News in "Low-Resource" Languages: Amharic Fake News Detection Accompanied by Resource Crafting.
Inf., 2021

An efficient hybrid sine-cosine Harris hawks optimization for low and high-dimensional feature selection.
Expert Syst. Appl., 2021

Accelerating Lifelong Reinforcement Learning via Reshaping Rewards.
Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

2020
An adaptive kernelized rank-order distance for clustering non-spherical data with high noise.
Int. J. Mach. Learn. Cybern., 2020

A new similarity combining reconstruction coefficient with pairwise distance for agglomerative clustering.
Inf. Sci., 2020

Hybrid channel based pedestrian detection.
Neurocomputing, 2020

Optimal Sink Node Placement in Large Scale Wireless Sensor Networks Based on Harris' Hawk Optimization Algorithm.
IEEE Access, 2020

Enhanced Bat Algorithm for Solving Non-Convex Economic Dispatch Problem.
Proceedings of the Recent Advances on Soft Computing and Data Mining, 2020

Fighting Fake News Using Deep Learning: Pre-trained Word Embeddings and the Embedding Layer Investigated.
Proceedings of the CIIS 2020: The 3rd International Conference on Computational Intelligence and Intelligent Systems, 2020

2019
Characteristic matrices of compound operations of coverings and their relationships with rough sets.
Int. J. Mach. Learn. Cybern., 2019

Local gap density for clustering high-dimensional data with varying densities.
Knowl. Based Syst., 2019

Long-Term Memory Harris' Hawk Optimization for High Dimensional and Optimal Power Flow Problems.
IEEE Access, 2019

2018
Sparse Graph Embedding Unsupervised Feature Selection.
IEEE Trans. Syst. Man Cybern. Syst., 2018

Dependence space of topology and its application to attribute reduction.
Int. J. Mach. Learn. Cybern., 2018

Multi-label feature selection via feature manifold learning and sparsity regularization.
Int. J. Mach. Learn. Cybern., 2018

Feature selection for multi-label classification using neighborhood preservation.
IEEE CAA J. Autom. Sinica, 2018

A New Local Density for Density Peak Clustering.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

Human Segmentation with Deep Contour-Aware Network.
Proceedings of the 2018 International Conference on Computing and Artificial Intelligence, 2018

2017
Rough set methods in feature selection via submodular function.
Soft Comput., 2017

Another approach to rough soft hemirings and corresponding decision making.
Soft Comput., 2017

Generative classification model for categorical data based on latent Gaussian process.
Pattern Recognit. Lett., 2017

Closed-set lattice and modular matroid induced by covering-based rough sets.
Int. J. Mach. Learn. Cybern., 2017

Unsupervised feature selection with the largest angle coding.
Int. J. Comput. Math. Comput. Syst. Theory, 2017

Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets.
Fundam. Informaticae, 2017

2016
Connectedness of graphs and its application to connected matroids through covering-based rough sets.
Soft Comput., 2016

Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model.
Soft Comput., 2016

Applications of repeat degree to coverings of neighborhoods.
Int. J. Mach. Learn. Cybern., 2016

On the matroidal structure of generalized rough set based on relation via definable sets.
Int. J. Mach. Learn. Cybern., 2016

An exponent weighted algorithm for minimal cost feature selection.
Int. J. Mach. Learn. Cybern., 2016

2015
A Self-Adaptive Parameter Selection Trajectory Prediction Approach via Hidden Markov Models.
IEEE Trans. Intell. Transp. Syst., 2015

TraPlan: An Effective Three-in-One Trajectory-Prediction Model in Transportation Networks.
IEEE Trans. Intell. Transp. Syst., 2015

Subspace learning for unsupervised feature selection via matrix factorization.
Pattern Recognit., 2015

Fast randomized algorithm with restart strategy for minimal test cost feature selection.
Int. J. Mach. Learn. Cybern., 2015

Unsupervised feature selection via maximum projection and minimum redundancy.
Knowl. Based Syst., 2015

A cost sensitive decision tree algorithm with two adaptive mechanisms.
Knowl. Based Syst., 2015

Parametric Matroid of Rough Set.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2015

The Connectivity of the Covering Approximation Space.
Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

The Matroidal Structures of the Second Type of Covering-Based Rough Set.
Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

The Lower Approximation Number in Covering-Based Rough Set.
Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

Sparse Matrix Feature Selection in Multi-label Learning.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

A Comparison of Two Types of Covering-Based Rough Sets Through the Complement of Coverings.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Connectedness of Graph and Matroid by Covering-Based Rough Sets.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Cost-sensitive decision tree with probabilistic pruning mechanism.
Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

Optimal feature subset with positive region constraints.
Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

A matroidal structure for formal context and its applications on epidemiological study.
Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

2014
Feature Selection with Positive Region Constraint for Test-Cost-Sensitive Data.
Trans. Rough Sets, 2014

Secondary basis unique augmentation matroids and union minimal matroids.
Int. J. Mach. Learn. Cybern., 2014

Conditions for coverings to induce matroids.
Int. J. Mach. Learn. Cybern., 2014

Closed-set lattice of regular sets based on a serial and transitive relation through matroids.
Int. J. Mach. Learn. Cybern., 2014

An improved artificial bee colony algorithm for minimal time cost reduction.
Int. J. Mach. Learn. Cybern., 2014

Optimal cost-sensitive granularization based on rough sets for variable costs.
Knowl. Based Syst., 2014

Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids.
J. Appl. Math., 2014

Graph and matrix approaches to rough sets through matroids.
Inf. Sci., 2014

Characteristic matrix of covering and its application to Boolean matrix decomposition.
Inf. Sci., 2014

Nullity-based matroid of rough sets and its application to attribute reduction.
Inf. Sci., 2014

Condition for neighbourhoods induced by a covering to be equal to the covering itself.
Int. J. Granul. Comput. Rough Sets Intell. Syst., 2014

Matrix approaches to rough sets through vector matroids over fields.
Int. J. Granul. Comput. Rough Sets Intell. Syst., 2014

Feature selection with test cost constraint.
Int. J. Approx. Reason., 2014

Rough Set Characterization for 2-circuit Matroid.
Fundam. Informaticae, 2014

Covering Approximations in Set-Valued Information Systems.
Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

A New Type of Covering-Based Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

A Logarithmic Weighted Algorithm for Minimal Test Cost Attribute Reduction.
Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Top-N Recommendation Based on Granular Association Rules.
Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Global Best Artificial Bee Colony for Minimal Test Cost Attribute Reduction.
Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Mining Significant Granular Association Rules for Diverse Recommendation.
Proceedings of the Rough Sets and Current Trends in Computing, 2014

An approach to covering-based rough sets through bipartite graphs.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2014

On three types of covering-based rough sets via definable sets.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2014

Covering-based rough sets on covering-circuit matroids.
Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

2013
A matroidal approach to rough set theory.
Theor. Comput. Sci., 2013

Cost-Sensitive Feature Selection of Numeric Data with Measurement Errors.
J. Appl. Math., 2013

Covering-Based Rough Sets on Eulerian Matroids.
J. Appl. Math., 2013

Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets.
J. Appl. Math., 2013

Applications of Matrices to a Matroidal Structure of Rough Sets.
J. Appl. Math., 2013

Rough matroids based on relations.
Inf. Sci., 2013

Quantitative analysis for covering-based rough sets through the upper approximation number.
Inf. Sci., 2013

Condition for covering-based upper approximation operators to be closure operators of matroids.
Int. J. Granul. Comput. Rough Sets Intell. Syst., 2013

Four matroidal structures of covering and their relationships with rough sets.
Int. J. Approx. Reason., 2013

Cold-start recommendation through granular association rules
CoRR, 2013

A necessary and sufficient condition for two relations to induce the same definable set family.
CoRR, 2013

Unique expansion matroids and union minimal matroids.
CoRR, 2013

Applications of repeat degree on coverings of neighborhoods.
CoRR, 2013

Rough matroids based on coverings.
CoRR, 2013

Connectivity for matroids based on rough sets.
CoRR, 2013

Dependence space of matroids and its application to attribute reduction.
CoRR, 2013

Contraction to Matroidal Structure of Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology - 8th International Conference, 2013

Comparative Study between Extension of Covering Approximation Space and Its Induction through Transversal Matroid.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

Topological Characterizations for Three Covering Approximation Operators.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

Multi-objective cost-sensitive attribute reduction.
Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

Mining top-k granular association rules for recommendation.
Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

Matroidal structure of generalized rough sets based on symmetric and transitive relations.
Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

Granular association rules for multi-valued data.
Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

A comparative study of discretization approaches for granular association rule mining.
Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

2012
Matroidal structure of rough sets and its characterization to attribute reduction.
Knowl. Based Syst., 2012

Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory.
J. Appl. Math., 2012

Matroidal Structure of Rough Sets Based on Serial and Transitive Relations.
J. Appl. Math., 2012

Geometric Lattice Structure of Covering-Based Rough Sets through Matroids.
J. Appl. Math., 2012

The fourth type of covering-based rough sets.
Inf. Sci., 2012

Attribute reduction of data with error ranges and test costs.
Inf. Sci., 2012

Cost-sensitive C4.5 with post-pruning and competition
CoRR, 2012

Matrix approach to rough sets through representable matroids over a field
CoRR, 2012

Relationship between the second type of covering-based rough set and matroid via closure operator
CoRR, 2012

Topological characterizations to three types of covering approximation operators
CoRR, 2012

Granular association rules on two universes with four measures
CoRR, 2012

Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets
CoRR, 2012

Matroidal structure of regular set based on serial and transitive relation
CoRR, 2012

Condition for neighborhoods induced by a covering to be equal to the covering itself
CoRR, 2012

Rough sets and matroidal contraction
CoRR, 2012

Condition for neighborhoods in covering based rough sets to form a partition
CoRR, 2012

Some characteristics of matroids through rough sets
CoRR, 2012

Matroidal Structure of Generalized Rough Sets based on Symmetric and Transitive Relation
CoRR, 2012

Relation matroid and its relationship with generalized rough set based on relation
CoRR, 2012

The role of covering matroid in covering-based rough set and matroid
CoRR, 2012

Matroidal structure based on serial and transitive relation
CoRR, 2012

Parametric matroid of rough set
CoRR, 2012

Boolean matrix decomposition through covering-based rough sets
CoRR, 2012

A Competition Strategy to Cost-Sensitive Decision Trees.
Proceedings of the Rough Sets and Knowledge Technology - 7th International Conference, 2012

Minimal Test Cost Feature Selection with Positive Region Constraint.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

Ant colony optimization to minimal test cost reduction.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Granular and rough computing on covering.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characteristics of 2-circuit matroids through rough sets.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characterization of attribute reduction of decision system through matroid theory.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Attribute reduction algorithms based on the matroidal structure of rough set.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Granular association rules with four subtypes.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characteristic of partition-circuit matroid through approximation number.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

An improved genetic algorithm to minimal test cost reduction.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Covering-based approximation operators by boolean matrix.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Matroidal structure of covering rough sets based on multigranulation.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

On matrix representation of three types of covering-based rough sets.
Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Rough sets and partition matroids.
Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

Granular Association Rule Mining through Parametric Rough Sets.
Proceedings of the Brain Informatics - International Conference, 2012

2011
Matroidal approaches to generalized rough sets based on relations.
Int. J. Mach. Learn. Cybern., 2011

Test-cost-sensitive attribute reduction.
Inf. Sci., 2011

Special issue: Rough and Fuzzy Methods for Data Mining.
Int. J. Hybrid Intell. Syst., 2011

Matroidal structure of covering-based rough sets through the upper approximation number.
Int. J. Granul. Comput. Rough Sets Intell. Syst., 2011

Bipartite Graphs and Coverings.
Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Transversal and Function Matroidal Structures of Covering-Based Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Optimal Sub-Reducts with Test Cost Constraint.
Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Covering Numbers in Covering-Based Rough Sets.
Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Rough matroid.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Test-cost-sensitive attribute reduction based on neighborhood rough set.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Reducible matroid and its relationship with covering-based rough sets.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

The vectorially matroidal structure of generalized rough sets based on relations.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

The refinement in covering-based rough sets.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

A genetic algorithm to the minimal test cost reduct problem.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Optimal sub-reducts in the dynamic environment.
Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Test Cost Constraint Reduction with Common Cost.
Proceedings of the Future Generation Information Technology, 2011

Minimal Cost Attribute Reduction through Backtracking.
Proceedings of the Database Theory and Application, Bio-Science and Bio-Technology, 2011

2010
Approximations in Rough Sets vs Granular Computing for Coverings.
Int. J. Cogn. Informatics Nat. Intell., 2010

Poset Approaches to Covering-Based Rough Sets.
Proceedings of the Rough Set and Knowledge Technology - 5th International Conference, 2010

Application of Covering Rough Sets to Linguistic Dynamic Systems.
Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

The Covering Upper Approximation by Subcovering.
Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

Rough Sets in Partially Ordered Sets.
Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

2009
Relationship among basic concepts in covering-based rough sets.
Inf. Sci., 2009

Relationship between generalized rough sets based on binary relation and covering.
Inf. Sci., 2009

Using Wavelets and Independent Component Analysis for Quantization Index Modulation Watermarking.
Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

A Web Text Filter Based on Rough Set Weighted Bayesian.
Proceedings of the Eighth IEEE International Conference on Dependable, 2009

2008
The algebraic structures of generalized rough set theory.
Inf. Sci., 2008

An intelligent design system for military situation assessment.
Proceedings of the 3rd International Conference on Intelligent System and Knowledge Engineering, 2008

Optimal and adaptive pairwise DNA sequence correlation analysis in natural gradient.
Proceedings of the 3rd International Conference on Intelligent System and Knowledge Engineering, 2008

Covering-based Granular Computing.
Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008

Adaptive Lagrange Constraints Neural Network under Multisensing.
Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008

2007
On Three Types of Covering-Based Rough Sets.
IEEE Trans. Knowl. Data Eng., 2007

Generalized rough sets based on relations.
Inf. Sci., 2007

Topological approaches to covering rough sets.
Inf. Sci., 2007

Informed Recognition in Software Watermarking.
Proceedings of the Intelligence and Security Informatics, Pacific Asia Workshop, 2007

Basic Concepts in Covering-Based Rough Sets.
Proceedings of the Third International Conference on Natural Computation, 2007

Topological Properties in Covering-Based Rough Sets.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

A Class of Covering-Based Fuzzy Rough Sets.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

Mining Privilege Escalation Paths for Network Vulnerability Analysis.
Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

2006
Applications of Homomorphic Functions to Software Obfuscation.
Proceedings of the Intelligence and Security Informatics, International Workshop, 2006

Axiomatic Systems of Generalized Rough Sets.
Proceedings of the Rough Sets and Knowledge Technology, First International Conference, 2006

Extraction in software watermarking.
Proceedings of the 8th workshop on Multimedia & Security, 2006

Covering Based Granular Computing for Conflict Analysis.
Proceedings of the Intelligence and Security Informatics, 2006

Properties of the First Type of Covering-Based Rough Sets.
Proceedings of the Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

Properties of the Second Type of Covering-Based Rough Sets.
Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006

Properties of the Fourth Type of Covering-Based Rough Sets.
Proceedings of the 6th International Conference on Hybrid Intelligent Systems (HIS 2006), 2006

Relationships among three types of covering rough sets.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Obfuscate arrays by homomorphic functions.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Binary Relation Based Rough Sets.
Proceedings of the Fuzzy Systems and Knowledge Discovery, Third International Conference, 2006

2005
A Survey of Software Watermarking.
Proceedings of the Intelligence and Security Informatics, 2005

On the QP Algorithm in Software Watermarking.
Proceedings of the Intelligence and Security Informatics, 2005

Algorithms to Watermark Software Through Register Allocation.
Proceedings of the Digital Rights Management: Technologies, 2005

2003
Reduction and axiomization of covering generalized rough sets.
Inf. Sci., 2003


  Loading...