Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Discriminatively boosted image clustering with fully convolutional auto-encoders
Traditional image clustering methods take a two-step approach, feature learning and
clustering, sequentially. However, recent research results demonstrated that combining the …
clustering, sequentially. However, recent research results demonstrated that combining the …
A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method
KM Kumar, ARM Reddy - Pattern Recognition, 2016 - Elsevier
Density based clustering methods are proposed for clustering spatial databases with noise.
Density Based Spatial Clustering of Applications with Noise (DBSCAN) can discover …
Density Based Spatial Clustering of Applications with Noise (DBSCAN) can discover …
Density peaks clustering based on density backbone and fuzzy neighborhood
Density peaks clustering (DPC) is as an efficient clustering algorithm due for using a non-
iterative process. However, DPC and most of its improvements suffer from the following …
iterative process. However, DPC and most of its improvements suffer from the following …
Scene classification using local and global features with collaborative representation fusion
This paper presents an effective scene classification approach based on collaborative
representation fusion of local and global spatial features. First, a visual word codebook is …
representation fusion of local and global spatial features. First, a visual word codebook is …
Dual-graph regularized concept factorization for multi-view clustering
Matrix factorization is an important technology that obtains the latent representation of data
by mining the potential structure of data. As two popular matrix factorization techniques …
by mining the potential structure of data. As two popular matrix factorization techniques …
Learning to rank for blind image quality assessment
Blind image quality assessment (BIQA) aims to predict perceptual image quality scores
without access to reference images. State-of-the-art BIQA methods typically require subjects …
without access to reference images. State-of-the-art BIQA methods typically require subjects …
ANN-DPC: Density peak clustering by finding the adaptive nearest neighbors
H Yan, M Wang, J **e - Knowledge-Based Systems, 2024 - Elsevier
DPC (clustering by fast search and find of density peaks) is an efficient clustering algorithm.
However, DPC and its variations usually cannot detect the appropriate cluster centers for a …
However, DPC and its variations usually cannot detect the appropriate cluster centers for a …
REDPC: A residual error-based density peak clustering algorithm
The density peak clustering (DPC) algorithm was designed to identify arbitrary-shaped
clusters by finding density peaks in the underlying dataset. Due to its aptitudes of relatively …
clusters by finding density peaks in the underlying dataset. Due to its aptitudes of relatively …
Self-weighted clustering with adaptive neighbors
Many modern clustering models can be divided into two separated steps, ie, constructing a
similarity graph (SG) upon samples and partitioning each sample into the corresponding …
similarity graph (SG) upon samples and partitioning each sample into the corresponding …
Grid-based DBSCAN: Indexing and inference
DBSCAN is one of clustering algorithms which can report arbitrarily-shaped clusters and
noises without requiring the number of clusters as a parameter (unlike the other clustering …
noises without requiring the number of clusters as a parameter (unlike the other clustering …