default search action
Leyuan Zhang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c6]Mengqi Jiang, Shichao Zhang, Debo Cheng
, Leyuan Zhang, Guixian Zhang:
Multi-head Similarity Feature Representation and Filtration for Image-Text Matching. ADMA (2) 2023: 629-643 - 2021
- [j10]Rongyao Hu, Leyuan Zhang, Jian Wei:
Adaptive Laplacian Support Vector Machine for Semi-supervised Learning. Comput. J. 64(7): 1005-1015 (2021) - [c5]Gukai Li, Juanjuan Li, Lina Liu, Can Ge, Guoxing Yang, Hui Tang, Zhiheng Mu, Xuan Chen, Jiahao Tang, Leyuan Zhang:
Design of Intelligent Garbage Classification System in Shanghai. ICAIIS 2021: 245:1-245:7 - 2020
- [j9]Jiaye Li, Shichao Zhang, Leyuan Zhang, Cong Lei, Jilian Zhang:
Unsupervised nonlinear feature selection algorithm via kernel function. Neural Comput. Appl. 32(11): 6443-6454 (2020) - [j8]Mengmeng Zhan, Guangquan Lu
Using Locality Preserving Projections to Improve the Performance of Kernel Clustering. Neural Process. Lett. 52(3): 1827-1842 (2020) - [j7]Qimin Luo, Guoqiu Wen, Leyuan Zhang, Mengmeng Zhan:
An Efficient Algorithm Combining Spectral Clustering with Feature Selection. Neural Process. Lett. 52(3): 1913-1925 (2020)
2010 – 2019
- 2019
- [j6]Ronggang Zhou, Xiaorui Wang, Yuhan Shi, Renqian Zhang, Leyuan Zhang, Haiyan Guo:
Measuring e-service quality and its importance to customer satisfaction and loyalty: an empirical study in a telecom setting. Electron. Commer. Res. 19(3): 477-499 (2019) - [j5]Shanwen Zhang, Guoqiu Wen, Leyuan Zhang, Jiaye Li:
基于核函数的稀疏属性选择算法 (Sparse Feature Selection Algorithm Based on Kernel Function). 计算机科学 46(2): 62-67 (2019) - [j4]Pengqing Li, Xuelian Deng, Leyuan Zhang, Jiangzhang Gan, Jiaye Li, Yonggang Li:
Sparse learning based on clustering by fast search and find of density peaks. Multim. Tools Appl. 78(23): 33261-33277 (2019) - [j3]Leyuan Zhang, Yangding Li, Jilian Zhang, Pengqing Li, Jiaye Li:
Nonlinear sparse feature selection algorithm via low matrix rank constraint. Multim. Tools Appl. 78(23): 33319-33337 (2019) - [j2]Jiaye Li, Hao Yu, Leyuan Zhang, Guoqiu Wen:
Double weighted K-nearest voting for label aggregation in crowdsourcing learning. Multim. Tools Appl. 78(23): 33357-33374 (2019) - [c4]Mengmeng Zhan, Guangquan Lu
A Clustering Algorithm via Kernel Function and Locality Preserving Projections. SSCI 2019: 2620-2625 - [c3]Leyuan Zhang, Meiling Liu, Rifeng Wang, Tingting Du, Jiaye Li:
Multi-View Unsupervised Feature Selection with Dynamic Sample Space Structure. SSCI 2019: 2641-2648 - [c2]Shanwen Zhang, Meiling Liu, Jiaye Li, Leyuan Zhang:
An Efficient Feature Selection Algorithm Based on Kernel Function. SSCI 2019: 2649-2655 - 2017
- [j1]Ronggang Zhou, Xiaorui Wang, Leyuan Zhang, Haiyan Guo:
Who tends to answer open-ended questions in an e-service survey? The contribution of closed-ended answers. Behav. Inf. Technol. 36(12): 1274-1284 (2017) - 2016
- [c1]Hejin Gu, Wenjun Hou, Xiangang Qin, Leyuan Zhang, Ye Dai:
The Effects of Aesthetics in Usability Testing for B2C E-commerce Websites. CCHI 2016: 2:1-2:5
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-08-05 20:25 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 and maintained by:
the dblp computer science bibliography is funded and supported by: