Results 41 to 50 of about 541,400 (289)
The widely used K-means clustering deals with ball-shaped (spherical Gaussian) clusters. In this paper, we extend the K-means clustering to accommodate extended clusters in subspaces, such as line-shaped clusters, plane-shaped clusters, and ball-shaped clusters. The algorithm retains much of the K-means clustering flavors: easy to implement and fast to
Dingding Wang 0001 +2 more
openaire +2 more sources
A survey on soft subspace clustering [PDF]
This paper has been published in Information Sciences Journal in ...
Zhaohong Deng +4 more
openaire +4 more sources
Subspace-based I-nice Clustering Algorithm [PDF]
Subspace clustering of high-dimensional data is a hot issue in the field of unsupervised learning.The difficulty of subspace clustering lies in finding the appropriate subspaces and corresponding clusters.At present,the most existing subspace clustering ...
HE Yifan, HE Yulin, CUI Laizhong, HUANG Zhexue
doaj +1 more source
Cluster Evaluation of Density Based Subspace Clustering
Clustering real world data often faced with curse of dimensionality, where real world data often consist of many dimensions. Multidimensional data clustering evaluation can be done through a density-based approach.
Jasni, Mohamad Zain +1 more
core +2 more sources
Hypergraph Convolutional Subspace Clustering With Multihop Aggregation for Hyperspectral Image
Subspace clustering methods have become a powerful tool to cluster hyperspectral imaging (HSI) data as they ensure theoretical guarantees and empirical success.
Zijia Zhang +5 more
doaj +1 more source
Latent Distribution Preserving Deep Subspace Clustering [PDF]
Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is smaller than the ambient dimension. Traditional subspace clustering methods often rely on the self-expressiveness
Liu, X +17 more
core +1 more source
Coping With New Challengens for Density-Based Clustering [PDF]
Knowledge Discovery in Databases (KDD) is the non-trivial process of identifying valid, novel, potentially useful, and ultimately understandable patterns in data.
Kröger, Peer
core +1 more source
We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses the sets to estimate the subspaces.
Dohyung Park +2 more
openaire +3 more sources
Discriminative Semantic Subspace Analysis for Relevance Feedback [PDF]
Content-based image retrieval (CBIR) has attracted much attention during the past decades for its potential practical applications to image database management. A variety of relevance feedback (RF) schemes have been designed to bridge the gap between low-
Zhang, Lining +6 more
core +1 more source
With the increasing demand for unsupervised learning for fault diagnosis, the subspace clustering has been considered as a promising technique enabling unsupervised fault diagnosis. Although various subspace clustering methods have been developed to deal
Jie Gao +4 more
doaj +1 more source

