Xingfeng Li
Biographic Data
| ID | 10056150 |
|---|---|
| NAME | Xingfeng Li |
| GIVEN NAMES | Xingfeng |
| FAMILY NAME | Li |
| SIGNATURE | LI X |
| AFFILIATIONS | Nanjing University of Science and Technology |
| ORCID | 0000-0001-6455-5337 |
| VERIFIED | Yes |
| TOTAL WORKS | 1 |
| TOTAL CITATIONS | 0 |
| AUTHOR COUNT | 1 |
| EDITOR COUNT | 0 |
| FIRST PUBLICATION YEAR | 2024 |
| LATEST PUBLICATION YEAR | 2024 |
| H-INDEX | 0 |
Enforced Block Diagonal Graph Learning for Multikernel Clustering
The existing multikernel graph clustering (MKGC) methods have emerged with notable success on nonlinear clustering tasks since the graph learning can effectively capture graph structure similarity between sample pair. Ideally, a high-quality graph should enjoy the good block diagonal property, i.e. the intercluster similarities correspond to zeros, while intracluster similarities represent nonzeros. Meanwhile, the number of diagonal blocks for a …
No prominent works on this page.
Enforced Block Diagonal Graph Learning for Multikernel Clustering
The existing multikernel graph clustering (MKGC) methods have emerged with notable success on nonlinear clustering tasks since the graph learning can effectively capture graph structure similarity between sample pair. Ideally, a high-quality graph should enjoy the good block diagonal property, i.e. the intercluster similarities correspond to zeros, while intracluster similarities represent nonzeros. Meanwhile, the number of diagonal blocks for a …
Advanced Graph Neural Networks (1 work) · Artificial Intelligence (1 work) · Cluster analysis (1 work) · Combinatorics (1 work) · Complex Network Analysis Techniques (1 work) · Computer Science (1 work) · Diagonal (1 work) · Graph (1 work) · Graph partition (1 work) · Mathematics (1 work)