%0 Journal Article
%T High-Dimensional Unsupervised Active Learning Method
%J Journal of AI and Data Mining
%I Shahrood University of Technology
%Z 2322-5211
%A Ghasemi, V.
%A Javadian, M.
%A Bagheri Shouraki, S.
%D 2020
%\ 07/01/2020
%V 8
%N 3
%P 391-407
%! High-Dimensional Unsupervised Active Learning Method
%K Ensemble Clustering
%K High Dimensional Clustering
%K Hierarchical Clustering
%K Unsupervised Active Learning Method
%R 10.22044/jadm.2020.7826.1941
%X In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the data points as one-dimensional ink drop patterns, in order to summarize the effects of all data points, and then applies a threshold on the resulting vectors. It is based on an ensemble clustering method which performs one-dimensional density partitioning to produce ensemble of clustering solutions. Then, it assigns a unique prime number to the data points that exist in each partition as their labels. Consequently, a combination is performed by multiplying the labels of every data point in order to produce the absolute labels. The data points with identical absolute labels are fallen into the same cluster. The hierarchical property of the algorithm is intended to cluster complex data by zooming in each already formed cluster to find further sub-clusters. The algorithm is verified using several synthetic and real-world datasets. The results show that the proposed method has a promising performance, compared to some well-known high-dimensional data clustering algorithms.
%U http://jad.shahroodut.ac.ir/article_1826_39827e6bc4a282f0784fb60b1391806f.pdf