William Zhu

ORCID: 0000-0001-8898-9244
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Rough Sets and Fuzzy Logic
  • Data Mining Algorithms and Applications
  • Natural Language Processing Techniques
  • Data Management and Algorithms
  • Image Processing and 3D Reconstruction
  • Face and Expression Recognition
  • Imbalanced Data Classification Techniques
  • Reinforcement Learning in Robotics
  • Image Retrieval and Classification Techniques
  • Advanced Numerical Analysis Techniques
  • Machine Learning and Data Classification
  • Advanced Clustering Algorithms Research
  • Advanced Malware Detection Techniques
  • Complex Network Analysis Techniques
  • Text and Document Classification Technologies
  • Adaptive Dynamic Programming Control
  • Recommender Systems and Techniques
  • Advanced Image and Video Retrieval Techniques
  • Domain Adaptation and Few-Shot Learning
  • Transportation Planning and Optimization
  • Advanced Algebra and Logic
  • Advanced Neural Network Applications
  • Neural Networks and Applications
  • Video Surveillance and Tracking Methods
  • Advanced Computational Techniques and Applications

Cornell University
2025

University of Electronic Science and Technology of China
2012-2024

Stanford Medicine
2022-2024

Medical Architecture (United Kingdom)
2023

Palo Alto University
2023

Stanford University
2023

University of Iowa
2022

Zhangzhou Normal University
2011-2017

Hohai University
2013-2014

Academy of Mathematics and Systems Science
2010

10.1016/j.ins.2006.06.009 article EN Information Sciences 2006-07-18

Rough set theory is a useful tool for data mining. It based on equivalence relations and has been extended to covering-based generalized rough set. This paper studies three kinds of covering sets dealing with the vagueness granularity in information systems. First, we examine properties approximation operations generated by comparison those Pawlak's sets. Then, propose concepts conditions two coverings generate an identical lower operation upper operation. After discussion interdependency...

10.1109/tkde.2007.1044 article EN IEEE Transactions on Knowledge and Data Engineering 2007-06-28

10.1016/j.ins.2007.05.037 article EN Information Sciences 2007-06-03

10.1016/j.ins.2009.02.013 article EN Information Sciences 2009-03-06

10.1016/j.ins.2011.07.010 article EN Information Sciences 2011-07-22

Trajectory prediction of objects in moving databases (MODs) has garnered wide support a variety applications and is gradually becoming an active research area. The existing trajectory algorithms focus on discovering frequent patterns or simulating the mobility via mathematical models. While these models are useful certain applications, they fall short describing position behavior network-constraint environment. Aiming to solve this problem, hidden Markov model (HMM)-based algorithm proposed,...

10.1109/tits.2014.2331758 article EN IEEE Transactions on Intelligent Transportation Systems 2014-10-08

10.1016/j.ins.2008.06.021 article EN Information Sciences 2008-07-10

10.1016/j.ijar.2013.04.003 article EN publisher-specific-oa International Journal of Approximate Reasoning 2013-04-17

10.1016/j.ins.2012.04.031 article EN Information Sciences 2012-05-05

Large-scale wireless sensor network (LSWSN) is composed of a huge number nodes that are distributed in some region interest (ROI), to sense and measure the environmental conditions like pressure, temperature, pollution levels, humidity, wind, so on. The objective collect data for real-time monitoring appropriate actions can be taken promptly. One used an LSWSN called sink node, which responsible processing analyzing collected information. It works as station between administrator. Also, it...

10.1109/access.2020.2968981 article EN cc-by IEEE Access 2020-01-01

10.1016/j.ins.2012.01.026 article EN Information Sciences 2012-02-01

10.1007/s13042-017-0647-y article EN International Journal of Machine Learning and Cybernetics 2017-03-01

High dimensionality is quite commonly encountered in data mining problems, and hence reduction becomes an important task order to improve the efficiency of learning algorithms. As a widely used technique reduction, feature selection about selecting subset being guided by certain criterion. In this paper, three unsupervised algorithms are proposed addressed from viewpoint sparse graph embedding learning. First, using self-characterization given data, we view themselves as dictionary, conduct...

10.1109/tsmc.2016.2605132 article EN IEEE Transactions on Systems Man and Cybernetics Systems 2016-10-19

10.1007/s13042-011-0027-y article EN International Journal of Machine Learning and Cybernetics 2011-06-27

Harris' hawk optimization (HHO) is a recent addition to population-based metaheuristic paradigm, inspired from hunting behavior of hawks. It has demonstrated promising search while employed on various problems, however the diversity agents can be further enhanced. This paper represents novel modified variant with long-term memory concept, hence called HHO (LMHHO), which provides information about multiple regions in problem landscape, for improvised results. With this information, LMHHO...

10.1109/access.2019.2946664 article EN cc-by IEEE Access 2019-01-01

The need to fight the progressive negative impact of fake news is escalating, which evident in strive do research and develop tools that could this job. However, a lack adequate datasets good word embeddings have posed challenges make detection methods sufficiently accurate. These resources are even totally missing for “low-resource” African languages, such as Amharic. Alleviating these critical problems should not be left tomorrow. Deep learning contributed lot devising automatic...

10.3390/info12010020 article EN cc-by Information 2021-01-07

Graph data have become increasingly important, and graph node clustering has emerged as a fundamental task in analysis. In recent years, gradually moved from traditional shallow methods to deep neural networks due the powerful representation capabilities of learning. this article, we review some representatives latest methods, which are classified into three categories depending on their principles. Extensive experiments conducted real-world datasets evaluate performance these methods. Four...

10.1109/tcss.2023.3242145 article EN IEEE Transactions on Computational Social Systems 2023-02-22

Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies type of covering generalized rough sets. After presenting their basic properties, this explores inter dependency between lower upper approximation operations, conditions under which two coverings generate same operation, axiomatic systems these operations. In end, establishes relationships sets other literature

10.1109/is.2006.348460 article EN 2006 3rd International IEEE Conference Intelligent Systems 2006-09-01
Coming Soon ...