Results 21 to 30 of about 656,770 (269)
Orderly Subspace Clustering [PDF]
Semi-supervised representation-based subspace clustering is to partition data into their underlying subspaces by finding effective data representations with partial supervisions. Essentially, an effective and accurate representation should be able to uncover and preserve the true data structure.
Jing Wang 0023 +5 more
openaire +3 more sources
Subspace discovery for video anomaly detection [PDF]
PhDIn automated video surveillance anomaly detection is a challenging task. We address this task as a novelty detection problem where pattern description is limited and labelling information is available only for a small sample of normal instances.
Tziakos, Ioannis
core +4 more sources
Attributed Subspace Clustering [PDF]
Existing methods on representation-based subspace clustering mainly treat all features of data as a whole to learn a single self-representation and get one clustering solution. Real data however are often complex and consist of multiple attributes or sub-features, such as a face image has expressions or genders.
Jing Wang 0023 +5 more
openaire +2 more sources
Cluster Evaluation of Density Based Subspace Clustering [PDF]
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
Clustering of multi-source geospatial big data provides opportunities to comprehensively describe urban structures. Most existing studies focus only on the clustering of a single type of geospatial big data, which leads to biased results.
Qiliang Liu, Weihua Huan, Min Deng
doaj +1 more source
High Density Subspace Clustering Algorithm for High Dimensional Data
Highdimensional data have the characteristics of sparsity and vulnerability to dimension disaster, which makes it is difficult to ensure the precision and efficiency of high dimensional data clustering Therefore the method of subspace clustering is ...
WAN Jing +3 more
doaj +1 more source
Multiple Kernel Subspace Clustering Based on Consensus Hilbert Space and Second-Order Neighbors
How to deal with data sets in high-dimensional space is the focus of image processing. At present, subspace clustering method is one of the most commonly used methods for processing high-dimensional data sets. Traditional subspace clustering assumes that
Zhongyuan Wang, Jinglei Liu
doaj +1 more source
Deeply transformed subspace clustering [PDF]
Subspace clustering assumes that the data is separable into separate subspaces; this assumption may not always hold. For such cases, we assume that, even if the raw data is not separable into subspaces, one can learn a deep representation such that the learnt representation is separable into subspaces.
Jyoti Maggu +3 more
openaire +2 more sources
Sparse Subspace Learning Based on Learnable Constraints for Image Clustering
Sparse subspace clustering is a widely used method for clustering high dimensional data, but the traditional method is complex and requires prior information that can be difficult to obtain in unsupervised scenarios.
Siyuan Zhao
doaj +1 more source
Fast Subspace Clustering Based on the Kronecker Product [PDF]
Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension.
Hancock, Edwin +14 more
core +1 more source

