方法对比

	局部异常因子 (LOF)	自编码器	DBSCAN	单类支持向量机
领域	机器学习	深度学习	机器学习	机器学习
方法族	Machine learning	Machine learning	Machine learning	Machine learning
起源年份	2000	2006	1996	1999–2001
提出者	Breunig, M. M.; Kriegel, H.-P.; Ng, R. T.; Sander, J.	Hinton, G.E. & Salakhutdinov, R.R.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C.
类型	Density-based anomaly detection (unsupervised)	Neural network (encoder-decoder)	Density-based clustering algorithm	Anomaly / novelty detection (unsupervised)
开创性文献	Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000). LOF: Identifying density-based local outliers. Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, 93–104.	Hinton, G.E. & Salakhutdinov, R.R. (2006). Reducing the Dimensionality of Data with Neural Networks. Science, 313(5786), 504–507.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.	Scholkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13(7), 1443–1471.
别名	LOF, local outlier factor, density-based outlier detection, local density deviation	Otokodlayıcı (Autoencoder), otokodlayıcı, auto-encoder, encoder-decoder network	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	OCSVM, one-class support vector machine, novelty SVM, unsupervised SVM
相关	4	4	3	3
摘要	Local Outlier Factor (LOF) is a density-based, unsupervised anomaly detection algorithm introduced by Breunig, Kriegel, Ng, and Sander in 2000. It assigns each data point a continuous outlier score that quantifies how isolated that point is relative to its local neighborhood, enabling detection of anomalies that global methods miss because they blend into dense clusters elsewhere in the space.	An autoencoder is an encoder-decoder neural network, popularised by Hinton and Salakhutdinov in 2006, that compresses data into a low-dimensional latent code and then reconstructs it, enabling dimensionality reduction and anomaly detection. By learning to rebuild its own input through a narrow bottleneck, it discovers a compact representation of the data.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.	One-class SVM is an unsupervised anomaly and novelty detection algorithm that learns a tight boundary around normal training data in a kernel-induced feature space, flagging new observations that fall outside that boundary as outliers. Introduced by Scholkopf et al. in 1999–2001, it extends the SVM framework to the single-class setting where no labelled anomalies are available.