Projected Affinity Values for Nyström Spectral Clustering
In kernel methods, Nyström approximation is a popular way of calculating out-of-sample extensions and can be further applied to large-scale data clustering and classification tasks. Given a new data point, Nyström employs its empirical affinity vector, k, for calculation. This vect...
Main Authors: | Li He, Haifei Zhu, Tao Zhang, Honghong Yang, Yisheng Guan |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-07-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/7/519 |
Similar Items
-
Nyström-based spectral clustering using airborne LiDAR point cloud data for individual tree segmentation
by: Yong Pang, et al.
Published: (2021-10-01) -
A Nyström Method for 2D Linear Fredholm Integral Equations on Curvilinear Domains
by: Anna Lucia Laguardia, et al.
Published: (2023-12-01) -
A More Efficient and Practical Modified Nyström Method
by: Wei Zhang, et al.
Published: (2023-05-01) -
An improved Nyström spectral graph clustering using k-core decomposition as a sampling strategy for large networks
by: Jingzhi Tu, et al.
Published: (2022-06-01) -
A Zero-dissipative Runge-Kutta-Nyström Method with Minimal Phase-lag for Oscillatory Problems
by: Senu, Norazak, et al.
Published: (2009)