Probabilistic spatial clustering based on the Self Discipline Learning (SDL) model of autonomous learning

01/07/2022
by   Zecang Gu, et al.
0

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

READ FULL TEXT
research
06/10/2022

A new distance measurement and its application in K-Means Algorithm

K-Means clustering algorithm is one of the most commonly used clustering...
research
09/13/2017

An efficient clustering algorithm from the measure of local Gaussian distribution

In this paper, I will introduce a fast and novel clustering algorithm ba...
research
02/20/2022

Clustering by the Probability Distributions from Extreme Value Theory

Clustering is an essential task to unsupervised learning. It tries to au...
research
09/09/2021

On the use of Wasserstein metric in topological clustering of distributional data

This paper deals with a clustering algorithm for histogram data based on...
research
01/20/2019

A Submodularity-based Agglomerative Clustering Algorithm for the Privacy Funnel

For the privacy funnel (PF) problem, we propose an efficient iterative a...
research
09/27/2016

Analysis of Massive Heterogeneous Temporal-Spatial Data with 3D Self-Organizing Map and Time Vector

Self-organizing map(SOM) have been widely applied in clustering, this pa...
research
06/19/2015

Representation Learning for Clustering: A Statistical Framework

We address the problem of communicating domain knowledge from a user to ...

Please sign up or login with your details

Forgot password? Click here to reset