default search action
Hong Zhao 0002
Person information
- affiliation: Minnan Normal University, School of Computer Science, Zhangzhou, China
Other persons with the same name
- Hong Zhao (aka: Zhao Hong) — disambiguation page
- H. Vicky Zhao (aka: Hong Vicky Zhao, Hong Zhao 0001) — University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j46]Wenwei He, Junyan Xu, Jie Shi, Hong Zhao:
ECS-SC: Long-tailed classification via data augmentation based on easily confused sample selection and combination. Expert Syst. Appl. 246: 123138 (2024) - [j45]Jie Jin, Yangqing Zhong, Hong Zhao:
HMRM: Hierarchy-aware Misclassification Risk Minimization for few-shot learning. Expert Syst. Appl. 251: 123885 (2024) - [j44]Yang Zhang, Jie Shi, Hong Zhao:
DMTFS-FO: Dynamic multi-task feature selection based on flexible loss and orthogonal constraint. Expert Syst. Appl. 255: 124588 (2024) - [j43]Wei Zhao, Hong Zhao:
Hierarchical long-tailed classification based on multi-granularity knowledge transfer driven by multi-scale feature fusion. Pattern Recognit. 145: 109842 (2024) - [j42]Yuling Su, Hong Zhao, Yifeng Zheng, Yu Wang:
Few-Shot Learning With Multi-Granularity Knowledge Fusion and Decision-Making. IEEE Trans. Big Data 10(4): 486-497 (2024) - [j41]Hong Zhao, Zhengyu Li, Wenwei He, Yan Zhao:
Hierarchical Convolutional Neural Network with Knowledge Complementation for Long-Tailed Classification. ACM Trans. Knowl. Discov. Data 18(6): 154:1-154:22 (2024) - [j40]Jielong Lu, Zhihao Wu, Luying Zhong, Zhaoliang Chen, Hong Zhao, Shiping Wang:
Generative Essential Graph Convolutional Network for Multi-View Semi-Supervised Classification. IEEE Trans. Multim. 26: 7987-7999 (2024) - 2023
- [j39]Zhiping Wu, Hong Zhao:
Hierarchical few-shot learning based on coarse- and fine-grained relation network. Artif. Intell. Rev. 56(3): 2011-2030 (2023) - [j38]Xiao Jia, Yuling Su, Hong Zhao:
Few-shot learning via relation network based on coarse-grained granulation. Appl. Intell. 53(1): 996-1008 (2023) - [j37]Jie Shi, Zhengyu Li, Hong Zhao:
Feature selection via maximizing inter-class independence and minimizing intra-class redundancy for hierarchical classification. Inf. Sci. 626: 1-18 (2023) - [j36]Zhiping Wu, Hong Zhao:
Hierarchical few-shot learning with feature fusion driven by data and knowledge. Inf. Sci. 639: 119012 (2023) - [j35]Jie Shi, Hong Zhao:
FS-MGKC: Feature selection based on structural manifold learning with multi-granularity knowledge coordination. Inf. Sci. 648: 119555 (2023) - [j34]Zhong Zhang, Zhiping Wu, Hong Zhao, Minjie Hu:
Knowledge transfer based hierarchical few-shot learning via tree-structured knowledge graph. Int. J. Mach. Learn. Cybern. 14(1): 281-294 (2023) - [j33]Junyan Xu, Wei Zhao, Hong Zhao:
Coarse-to-fine knowledge transfer based long-tailed classification via bilateral-sampling network. Int. J. Mach. Learn. Cybern. 14(10): 3323-3336 (2023) - [j32]Yaojin Lin, Haoyang Liu, Hong Zhao, Qinghua Hu, Xingquan Zhu, Xindong Wu:
Hierarchical Feature Selection Based on Label Distribution Learning. IEEE Trans. Knowl. Data Eng. 35(6): 5964-5976 (2023) - 2022
- [j31]Gangyi Tian, Jianran Liu, Hong Zhao, Wenyuan Yang:
Small object detection via dual inspection mechanism for UAV visual images. Appl. Intell. 52(4): 4244-4257 (2022) - [j30]Zeyu Qiu, Hong Zhao:
A fuzzy rough set approach to hierarchical feature selection based on Hausdorff distance. Appl. Intell. 52(10): 11089-11102 (2022) - [j29]Yuling Su, Hong Zhao, Yaojin Lin:
Few-shot learning based on hierarchical classification via multi-granularity relation networks. Int. J. Approx. Reason. 142: 417-429 (2022) - [j28]Zeyu Qiu, Minjie Hu, Hong Zhao:
Hierarchical classification based on coarse- to fine-grained knowledge transfer. Int. J. Approx. Reason. 149: 61-69 (2022) - [j27]Wei Zhao, Yuling Su, Minjie Hu, Hong Zhao:
Hybrid ResNet based on joint basic and attention modules for long-tailed classification. Int. J. Approx. Reason. 150: 83-97 (2022) - [j26]Zhengyu Li, Hong Zhao, Yaojin Lin:
Multi-task convolutional neural network with coarse-to-fine knowledge transfer for long-tailed classification. Inf. Sci. 608: 900-916 (2022) - 2021
- [j25]Shunxin Guo, Hong Zhao:
Hierarchical classification with multi-path selection based on granular computing. Artif. Intell. Rev. 54(3): 2067-2089 (2021) - [j24]Weijie Zheng, Hong Zhao:
Cost-sensitive hierarchical classification via multi-scale information entropy for data with an imbalanced distribution. Appl. Intell. 51(8): 5940-5952 (2021) - [j23]Longzhu Li, Yaojin Lin, Hong Zhao, Jinkun Chen, Shaozi Li:
Causality-based online streaming feature selection. Concurr. Comput. Pract. Exp. 33(20) (2021) - [j22]Xinxin Liu, Hong Zhao:
Robust hierarchical feature selection with a capped ℓ2-norm. Neurocomputing 443: 131-146 (2021) - [j21]Xinxin Liu, Yucan Zhou, Hong Zhao:
Robust hierarchical feature selection driven by data and knowledge. Inf. Sci. 551: 341-357 (2021) - [j20]Shunxin Guo, Hong Zhao, Wenyuan Yang:
Hierarchical feature selection with multi-granularity clustering structure. Inf. Sci. 568: 448-462 (2021) - [j19]Hong Zhao, Shunxin Guo, Yaojin Lin:
Hierarchical classification of data with long-tailed distributions via global and local granulation. Inf. Sci. 581: 536-552 (2021) - [j18]Hong Zhao, Qinghua Hu, Pengfei Zhu, Yu Wang, Ping Wang:
A Recursive Regularization Based Feature Selection Framework for Hierarchical Classification. IEEE Trans. Knowl. Data Eng. 33(7): 2833-2846 (2021) - 2020
- [j17]Weijie Zheng, Hong Zhao:
Cost-sensitive hierarchical classification for imbalance classes. Appl. Intell. 50(8): 2328-2338 (2020)
2010 – 2019
- 2019
- [j16]Xinxin Liu, Hong Zhao:
Hierarchical feature extraction based on discriminant analysis. Appl. Intell. 49(7): 2780-2792 (2019) - [j15]Hong Zhao, Shenglong Yu:
Cost-sensitive feature selection via the ℓ2, 1-norm. Int. J. Approx. Reason. 104: 25-37 (2019) - [j14]Qianjuan Tuo, Hong Zhao, Qinghua Hu:
Hierarchical feature selection with subtree based graph regularization. Knowl. Based Syst. 163: 996-1008 (2019) - [j13]Hong Zhao, Ping Wang, Qinghua Hu, Pengfei Zhu:
Fuzzy Rough Set Based Feature Selection for Large-Scale Hierarchical Classification. IEEE Trans. Fuzzy Syst. 27(10): 1891-1903 (2019) - 2018
- [j12]Pengfei Zhu, Qian Xu, Qinghua Hu, Changqing Zhang, Hong Zhao:
Multi-label feature selection with missing labels. Pattern Recognit. 74: 488-502 (2018) - 2017
- [j11]Hong Zhao, Xiangju Li:
A cost sensitive decision tree algorithm based on weighted class distribution with batch deleting attribute mechanism. Inf. Sci. 378: 303-316 (2017) - [c7]Yu Wang, Qinghua Hu, Yucan Zhou, Hong Zhao, Yuhua Qian, Jiye Liang:
Local Bayes Risk Minimization Based Stopping Strategy for Hierarchical Classification. ICDM 2017: 515-524 - [c6]Hong Zhao, Pengfei Zhu, Ping Wang, Qinghua Hu:
Hierarchical Feature Selection with Recursive Regularization. IJCAI 2017: 3483-3489 - 2016
- [j10]Hong Zhao, Ping Wang, Qinghua Hu:
Cost-sensitive feature selection based on adaptive neighborhood granularity with multi-level confidence. Inf. Sci. 366: 134-149 (2016) - [j9]Xiangju Li, Hong Zhao, William Zhu:
An exponent weighted algorithm for minimal cost feature selection. Int. J. Mach. Learn. Cybern. 7(5): 689-698 (2016) - [j8]Anjing Fan, Hong Zhao, William Zhu:
Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model. Soft Comput. 20(12): 4813-4824 (2016) - 2015
- [j7]Yanfang Liu, Hong Zhao, William Zhu:
Parametric Matroid of Rough Set. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 23(6): 893-908 (2015) - [j6]Xiangju Li, Hong Zhao, William Zhu:
A cost sensitive decision tree algorithm with two adaptive mechanisms. Knowl. Based Syst. 88: 24-33 (2015) - [j5]Jingkuan Li, Hong Zhao, William Zhu:
Fast randomized algorithm with restart strategy for minimal test cost feature selection. Int. J. Mach. Learn. Cybern. 6(3): 435-442 (2015) - [c5]Junxia Niu, Hong Zhao, William Zhu:
Optimal feature subset with positive region constraints. ICMLC 2015: 75-80 - [c4]Hong Zhao, Xiangju Li, Zilong Xu, William Zhu:
Cost-sensitive decision tree with probabilistic pruning mechanism. ICMLC 2015: 81-87 - 2014
- [j4]Aiping Huang, Hong Zhao, William Zhu:
Nullity-based matroid of rough sets and its application to attribute reduction. Inf. Sci. 263: 153-165 (2014) - [j3]Hong Zhao, William Zhu:
Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl. Based Syst. 65: 72-82 (2014) - [j2]Jiabin Liu, Fan Min, Hong Zhao, William Zhu:
Feature Selection with Positive Region Constraint for Test-Cost-Sensitive Data. Trans. Rough Sets 18: 23-33 (2014) - [c3]Anjing Fan, Hong Zhao, William Zhu:
Global Best Artificial Bee Colony for Minimal Test Cost Attribute Reduction. RSKT 2014: 101-110 - [c2]Junxia Niu, Hong Zhao, William Zhu:
A Logarithmic Weighted Algorithm for Minimal Test Cost Attribute Reduction. RSKT 2014: 129-138 - 2013
- [j1]Hong Zhao, Fan Min, William Zhu:
Cost-Sensitive Feature Selection of Numeric Data with Measurement Errors. J. Appl. Math. 2013: 754698:1-754698:13 (2013) - [i1]Bin Yang, Hong Zhao, William Zhu:
Rough matroids based on coverings. CoRR abs/1311.0351 (2013) - 2011
- [c1]Hong Zhao, Fan Min, William Zhu:
Test-cost-sensitive attribute reduction based on neighborhood rough set. GrC 2011: 802-806
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint