Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Somsack Inthasone

dblp:153/2643 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.912025
Deep Subspace Clustering Under Class Relation Constraint · IEEE Trans. Image Process. 2025
Data mining › clustering › high-dimensional clustering › subspace clustering
deep subspace clustering
0.912025
Deep Subspace Clustering Under Class Relation Constraint · IEEE Trans. Image Process. 2025
Data mining › clustering › high-dimensional clustering
subspace clustering
0.912025
Deep Subspace Clustering Under Class Relation Constraint · IEEE Trans. Image Process. 2025
Machine learning › Representation and self-supervised learning › representation learning › feature extraction
discriminative feature representation
0.312025
Deep Subspace Clustering Under Class Relation Constraint · IEEE Trans. Image Process. 2025
Machine learning › Representation and self-supervised learning
latent feature learning
0.312025
Deep Subspace Clustering Under Class Relation Constraint · IEEE Trans. Image Process. 2025

Methods — techniques the papers use, named apart from their topics

spectral clustering · 1.7self-expression coefficient matrix · 1.7contrastive loss · 1.7
YearPublicationVenuePosition
2025 Deep Subspace Clustering Under Class Relation Constraint
abstract
Deep subspace clustering uses latent features instead of raw images to construct the self-expression coefficient matrix. Existing methods primarily focus on optimizing the self-expression coefficient matrix, often neglecting the impact of latent features. However, better latent features are more in line with the self-representation assumption and results in a better self-expression coefficient matrix, which construct a chain relationship. Based on the chain relationship, this paper proposes a Class Relation Constraint (CRC) induced Deep Subspace Clustering (DSC) method to improve the representation ability of latent features. First, an intra- and inter-class weighted constraint is proposed to enhance latent data separability in subspaces. Then, to further remove negative samples inside a subspace, a contrastive loss function is introduced within the diagonal blocks of the self-expression coefficient matrix, i.e. the same subspace, under the guidance of spectral clustering results. Along with the enhanced representation ability on latent features and corresponding diagonal blocks, the self-expression coefficient matrix can provide more accurate data relationships for spectral clustering. Experimental results on multiple benchmark datasets have validated the effectiveness of the proposed DSCCRC method, particularly in handling small samples and complex datasets.
Yusong Xiong, Jun Wu 0017, Somsack Inthasone, Haijian Wang
IEEE Trans. Image Process.4
2014 The BioKET Biodiversity Data Warehouse: Data and Knowledge Integration and Extraction
Somsack Inthasone, Nicolas Pasquier, Andrea Tettamanzi, Célia da Costa Pereira
IDA1