方法证据记录
Mean Shift
Mean Shift is a non-parametric, iterative mode-seeking algorithm that identifies clusters as the peaks of an underlying probability density function. Originally introduced by Fukunaga and Hostetler (1975) for gradient estimation in pattern recognition, it was substantially extended and popularized by Comaniciu and Meer (2002) for robust feature-space analysis and image segmentation. Unlike k-means, Mean Shift requires no prior specification of the number of clusters, deriving cluster structure entirely from the data density.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Mean Shift Clustering and Mode-Seeking Algorithm
分类方法记录 · ml-model / machine-learning
- Fukunaga, K. & Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory, 21(1), 32–40. · DOI 10.1109/TIT.1975.1055330
- Comaniciu, D. & Meer, P. (2002). Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(5), 603–619. · DOI 10.1109/34.1000236
- Hastie, T., Tibshirani, R. & Friedman, J. (2009). The Elements of Statistical Learning (2nd ed., Ch. 14). Springer. · ISBN 978-0-387-84858-7
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。