default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCanyu Zhang 0001
Person information
- affiliation: Xi'an University of Posts & Telecommunications, Xi'an, China
Other persons with the same name
- Canyu Zhang — disambiguation page
- Canyu Zhang 0002
![[0009-0001-1657-3554]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0009-0001-1657-3554")
— University of South Carolina, Columbia, SC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j13]Shaojun Shi, Canyu Zhang, Jiahao Zhao, Feiping Nie:
Multi-graph clustering via multi-modal topological manifold learning. Neural Networks 193: 108035 (2026)- [j12]Shaojun Shi, Yibing Liu, Canyu Zhang, Sisi Wang, Feiping Nie:
Robust and flexible multi-view subspace clustering with nuclear norm. Pattern Recognit. 173: 112804 (2026) - [j11]Shenfei Pei, Yuanchen Sun, Zhongqi Lin, Feiping Nie, Jitao Lu, Xudong Jiang, Canyu Zhang, Zengwei Zheng:
Concave Cut: Analyzing the role of concave functions in clustering. Pattern Recognit. 174: 112950 (2026) - 2025
- [j10]Canyu Zhang, Feiping Nie, Rong Wang:
Anchor Guided Unsupervised Domain Adaptation. IEEE Trans. Knowl. Data Eng. 37(3): 1079-1090 (2025) - 2024
- [j9]Canyu Zhang, Shaojun Shi, Yanping Chen, Feiping Nie, Rong Wang:
Local sparse discriminative feature selection. Inf. Sci. 662: 120214 (2024) - [j8]Zheng Wang, Feiping Nie, Canyu Zhang, Rong Wang, Xuelong Li:
Worst-Case Discriminative Feature Learning via Max-Min Ratio Analysis. IEEE Trans. Pattern Anal. Mach. Intell. 46(1): 641-658 (2024) - [j7]Canyu Zhang, Feiping Nie, Rong Wang, Xuelong Li:
Supervised Feature Selection via Multi-Center and Local Structure Learning. IEEE Trans. Knowl. Data Eng. 36(9): 4930-4942 (2024) - 2023
- [j6]Rong Wang, Canyu Zhang, Jintang Bian, Zheng Wang, Feiping Nie, Xuelong Li:
Sparse and Flexible Projections for Unsupervised Feature Selection. IEEE Trans. Knowl. Data Eng. 35(6): 6362-6375 (2023) - [j5]Feiping Nie, Canyu Zhang, Zheng Wang, Rong Wang, Xuelong Li:
Local Embedding Learning via Landmark-Based Dynamic Connections. IEEE Trans. Neural Networks Learn. Syst. 34(11): 9481-9492 (2023) - 2022
- [j4]Canyu Zhang, Feiping Nie, Rong Wang, Xuelong Li:
Fast unsupervised embedding learning with anchor-based graph. Inf. Sci. 609: 949-962 (2022) - 2021
- [j3]Canyu Zhang, Feiping Nie, Zheng Wang, Rong Wang, Xuelong Li:
Fast local representation learning via adaptive anchor graph for image retrieval. Inf. Sci. 578: 870-886 (2021) - [j2]Zheng Wang, Feiping Nie, Canyu Zhang, Rong Wang, Xuelong Li:
Joint nonlinear feature selection and continuous values regression network. Pattern Recognit. Lett. 150: 197-206 (2021) - [c1]Canyu Zhang, Feiping Nie, Zheng Wang, Rong Wang, Xuelong Li:
Fast Local Representation Learning with Adaptive Anchor Graph. ICASSP 2021: 3170-3174 - 2020
- [j1]Zheng Wang, Feiping Nie, Canyu Zhang, Rong Wang, Xuelong Li:
Capped ℓp-Norm LDA for Outliers Robust Dimension Reduction. IEEE Signal Process. Lett. 27: 1315-1319 (2020)
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 2026-06-10 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
