Graph-Based Clustering: High-Order Bipartite Graph for Proximity Learning
IEEE Transactions on Knowledge and Data Engineering · 2025-08 · 37 (8) · 4649-4663
DOI: 10.1109/tkde.2025.3569681 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2025-08. Verfasst von Zihua Zhao und 5 weiteren Autor:innen. Die Arbeit wurde bisher 17-mal zitiert (Crossref) und nennt 57 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities, Key Laboratory of the Ministry of Education on Application of Artificial Intelligence in Equipment.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
- Key Laboratory of the Ministry of Education on Application of Artificial Intelligence in Equipment
- Rocket Force University of Engineering
- Natural Science Basic Research Plan in Shaanxi Province of China
Zitieren
APA
Zhao, Z., Wu, D., Wang, R., Wang, Z., Nie, F., & Li, X. (2025). Graph-Based Clustering: High-Order Bipartite Graph for Proximity Learning. IEEE Transactions on Knowledge and Data Engineering, 37(8), 4649-4663. https://doi.org/10.1109/tkde.2025.3569681
Vancouver
Zhao Z, Wu D, Wang R, Wang Z, Nie F, Li X. Graph-Based Clustering: High-Order Bipartite Graph for Proximity Learning. IEEE Transactions on Knowledge and Data Engineering. 2025;37(8):4649-4663. doi:10.1109/tkde.2025.3569681
BibTeX
@article{Zhao2025,
author = {Zhao, Zihua and Wu, Danyang and Wang, Rong and Wang, Zheng and Nie, Feiping and Li, Xuelong},
title = {Graph-Based Clustering: High-Order Bipartite Graph for Proximity Learning},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2025},
volume = {37},
number = {8},
pages = {4649--4663},
doi = {10.1109/tkde.2025.3569681}
}
EUVIMED