Results 41 to 50 of about 656,770 (269)

Subspace-based I-nice Clustering Algorithm [PDF]

open access: yesJisuanji kexue
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

Unsupervised radar signal recognition based on multi‐block – Multi‐view Low‐Rank Sparse Subspace Clustering

open access: yesIET Radar, Sonar & Navigation, 2022
In the field of radar reconnaissance, unsupervised recognition of radar signals is a particularly important method for classifying different signals and estimating signal parameters.
Lutao Liu, Shuai Xu
doaj   +1 more source

Linearity-Aware Subspace Clustering

open access: yes, 2022
Obtaining a good similarity matrix is extremely important in subspace clustering. Current state-of-the-art methods learn the similarity matrix through self-expressive strategy.
Li, Jun   +7 more
core   +1 more source

Low-rank sparse subspace clustering with a clean dictionary

open access: yesJournal of Algorithms & Computational Technology, 2021
Low-Rank Representation (LRR) and Sparse Subspace Clustering (SSC) are considered as the hot topics of subspace clustering algorithms. SSC induces the sparsity through minimizing the l 1 -norm of the data matrix while LRR promotes a low-rank structure ...
Cong-Zhe You, Zhen-Qiu Shu, Hong-Hui Fan
doaj   +1 more source

Deep Subspace Clustering Fused with Auto-Weight Learning [PDF]

open access: yesJisuanji gongcheng, 2022
Subspace clustering is a clustering method for high-dimensional data.This method offers a unique way of data self-representation and high clustering accuracy.The limitation of traditional subspace clustering is its focus on constructing the optimal ...
JIANG Yuyan, SHAO Jin, LI Ping
doaj   +1 more source

K-Subspace Clustering [PDF]

open access: yes, 2009
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

Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan   +3 more
wiley   +1 more source

Coping With New Challengens for Density-Based Clustering [PDF]

open access: yes, 2004
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

Multi-Partitions Subspace Clustering

open access: yesMathematics, 2020
In model based clustering, it is often supposed that only one clustering latent variable explains the heterogeneity of the whole dataset. However, in many cases several latent variables could explain the heterogeneity of the data at hand.
Vincent Vandewalle
doaj   +1 more source

Greedy Subspace Clustering

open access: yesCoRR, 2014
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

Home - About - Disclaimer - Privacy