Online Arbitrary Shaped Clustering through Correlated Gaussian Functions
There is no convincing evidence that backpropagation is a biologically plausible mechanism, and further studies of alternative learning methods are needed. A novel online clustering algorithm is presented that can produce arbitrary shaped clusters from inputs in an unsupervised manner, and requires no prior knowledge of the number of clusters in the input data. This is achieved by finding correlated outputs from functions that capture commonly occurring input patterns. The algorithm can be deemed more biologically plausible than model optimization through backpropagation, although practical applicability may require additional research. However, the method yields satisfactory results on several toy datasets on a noteworthy range of hyperparameters.
Code (1)
Tasks
ClusteringModel OptimizationOnline ClusteringSimilar Papers 제목 키워드 기반
Fast Online Clustering with Randomized Skeleton Sets
We present a new fast online clustering algorithm that reliably recovers arbitrary-shaped data clusters in high throughout data streams. Unlike the existing state-of-the-art online clustering methods based on k-means or …
ClusteringNonparametric ClusteringOnline ClusteringDISCO: Internal Evaluation of Density-Based Clustering
In density-based clustering, clusters are areas of high object density separated by lower object density areas. This notion supports arbitrarily shaped clusters and automatic detection of noise points that do not belong …
ClusteringSpherical Wards clustering and generalized Voronoi diagrams
Gaussian mixture model is very useful in many practical problems. Nevertheless, it cannot be directly generalized to non Euclidean spaces. To overcome this problem we present a spherical Gaussian-based clustering approac…
ClusteringGraph-based Clustering under Differential Privacy
In this paper, we present the first differentially private clustering method for arbitrary-shaped node clusters in a graph. This algorithm takes as input only an approximate Minimum Spanning Tree (MST) $\mathcal{T}$ rele…
ClusteringIPD:An Incremental Prototype based DBSCAN for large-scale data with cluster representatives
DBSCAN is a fundamental density-based clustering technique that identifies any arbitrary shape of the clusters. However, it becomes infeasible while handling big data. On the other hand, centroid-based clustering is impo…
Clustering