Probabilistic spatial clustering based on the Self Discipline Learning (SDL) model of autonomous learning
Not on the map. Why?
Abstract (arXiv)
Unsupervised clustering algorithm can effectively reduce the dimension of high-dimensional unlabeled data, thus reducing the time and space complexity of data processing. However, the traditional clustering algorithm needs to set the upper bound of the number of categories in advance, and the deep learning clustering algorithm will fall into the problem of local optimum. In order to solve these problems, a probabilistic spatial clustering algorithm based on the Self Discipline Learning(SDL) model is proposed. The algorithm is based on the Gaussian probability distribution of the probability space distance between vectors, and uses the probability scale and maximum probability value of the probability space distance as the distance measurement judgment, and then determines the category of each sample according to the distribution characteristics of the data set itself. The algorithm is tested in Laboratory for Intelligent and Safe Automobiles(LISA) traffic light data set, the accuracy rate is 99.03%, the recall rate is 91%, and the effect is achieved.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 31 references that are in the map. First posted on arXiv 7 Jan 2022.
Builds on
8 of 31 references.
References · 8
- 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,591
- 2016Context Encoders: Feature Learning by Inpaintingcited by 1,428
- 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,382
- 2016Colorful Image Colorizationcited by 1,114
- 2017Representation Learning by Learning to Countcited by 120
- 2017Dimensionality Reduction using Similarity-induced Embeddingscited by 1
- 2018Distance formulas capable of unifying Euclidian space and probability spacecited by 1
- 2018The Modeling of SDL Aiming at Knowledge Acquisition in Automatic Drivingcited by 1
Built on by
Not cited yet.