Text Classification and Clustering with Annealing Soft Nearest Neighbor Loss
원문 초록
We define disentanglement as how far class-different data points from each other are, relative to the distances among class-similar data points. When maximizing disentanglement during representation learning, we obtain a transformed feature representation where the class memberships of the data points are preserved. If the class memberships of the data points are preserved, we would have a feature representation space in which a nearest neighbour classifier or a clustering algorithm would perform well. We take advantage of this method to learn better natural language representation, and employ it on text classification and text clustering tasks. Through disentanglement, we obtain text representations with better-defined clusters and improve text classification performance. Our approach had a test classification accuracy of as high as 90.11% and test clustering accuracy of 88% on the AG News dataset, outperforming our baseline models -- without any other training tricks or regularization.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Large-Scale Few-Shot Classification with Semi-supervised Hierarchical k-Probabilistic PCAs
Graph Regularized and Feature Aware Matrix Factorization for Robust Incomplete Multi-view Clustering
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering
DOMFN: A Divergence-Orientated Multi-Modal Fusion Network for Resume Assessment
Semantic Structure Enhanced Contrastive Adversarial Hash Network for Cross-media Representation Learning
Robust Diversified Graph Contrastive Network for Incomplete Multi-view Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.