| Challenge: | Existing approaches to SAS use unsupervised clustering and have teachers label some items after clustering. |
| Approach: | They propose to use semi-supervised clustering to provide structured groups of answers in addition to a score. |
| Outcome: | The proposed method improves clustering performance from 0.504 kappa for unsupervised clustering to 0.566 kppa. |
Similar Papers
Semi-Supervised Learning for Neural Keyphrase Generation (D18-1)
Copied to clipboard
| Challenge: | Existing models for keyphrase generation only use labeled data, which is limited to resource-rich domains. |
| Approach: | They propose semi-supervised keyphrase generation methods by leveraging labeled data and large-scale unlabeled samples for learning. |
| Outcome: | The proposed methods outperform state-of-the-art models trained with labeled data and large-scale unlabeled samples for learning. |
SAT: Improving Semi-Supervised Text Classification with Simple Instance-Adaptive Self-Training (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for semi-supervised text classification have shown great performance in few-shot scenarios, where both labeled and unlabeled data are utilized. |
| Approach: | They propose a simple instance-adaptive self-training method for semi-supervised text classification that generates two augmented views for each unlabeled data and trains a meta learner to identify relative strength of augmentations based on the similarity between the original view and the augmented view. |
| Outcome: | The proposed method consistently shows competitive performance with varying sizes of labeled training data compared to existing semi-supervised learning methods. |
STSPL-SSC: Semi-Supervised Few-Shot Short Text Clustering with Semantic text similarity Optimized Pseudo-Labels (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for obtaining task-specific labels require prior knowledge of clustering categories and uncontrollable clustering centers. |
| Approach: | They propose a framework for supervised clustering using a discrete process and a robust Contrastive Learning module. |
| Outcome: | The proposed framework outperforms state-of-the-art models on a real-world dataset with just one label per class . the proposed framework is based on k-means clustering and a robust Contrastive Learning module . |
Supervised Neural Clustering via Latent Structured Output Learning: Application to Question Intents (2021.naacl-main)
Copied to clipboard
| Challenge: | Recent work on structured prediction has produced very effective supervised clustering algorithms using linear classifiers. |
| Approach: | They propose to use latent structured prediction loss and Transformer models to approach supervised clustering. |
| Outcome: | The proposed approach outperforms the state-of-the-art in recreating intents from public question corpora. |
Progressive Class Semantic Matching for Semi-supervised Text Classification (2022.naacl-main)
Copied to clipboard
| Challenge: | Recent semi-supervised learning methods have achieved impressive performance . semi-controlled learning can be used to reduce the annotation cost of text classifiers . |
| Approach: | They propose a semi-supervised learning process that builds a standard K-way classifier and a matching network for the input text and the Class Semantic Representation (CSR). |
| Outcome: | The proposed method improves baselines and overall is more stable. |
Similarity-Based Content Scoring - A more Classroom-Suitable Alternative to Instance-Based Scoring? (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent work suggests that similarity-based content scoring methods can yield comparable results to instance-based supervised learning. |
| Approach: | They propose to use similarity-based scoring to achieve similar results . they compare different instance-based and similarity based methods on multiple data sets . |
| Outcome: | The proposed approach has a lower need for annotated training data and better zero-shot performance, but the results are not consistent with previous studies. |
MIST: Mutual Information Maximization for Short Text Clustering (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for clustering short texts are inadequate due to the limited amount of information provided by each text sample. |
| Approach: | They propose a Mutual Information Maximization Framework for Short Text Clustering which maximizes mutual information between representations on sequence and token levels. |
| Outcome: | The proposed framework outperforms the state-of-the-art method in terms of Accuracy or Normalized Mutual Information in most cases. |
Unsupervised Fine-tuning for Text Clustering (2020.coling-main)
Copied to clipboard
| Challenge: | Existing approaches to text clustering fine-tune pre-trained models have been limited. |
| Approach: | They propose a method to fine-tune pre-trained models unsupervisedly for text clustering by learning text representations and cluster assignments using a clustering oriented loss. |
| Outcome: | The proposed model outperforms baseline methods and achieves state-of-the-art results on three text clustering datasets. |
ASAP++: Enriching the ASAP Automated Essay Grading Dataset with Essay Attribute Scores (L18-1)
Copied to clipboard
| Challenge: | Automated essay grading (AEG) is one of the most challenging activities in natural language processing (NLP). |
| Approach: | They propose to annotate the ASAP AEG dataset and use it to score different attributes of the essays. |
| Outcome: | The proposed resource is based on the ASAP++ dataset, which contains scores for different attributes of the essays, such as content, word choice, organization, sentence fluency, etc. |
Proposition-Level Clustering for Multi-Document Summarization (2022.naacl-main)
Copied to clipboard
Ori Ernst, Avi Caciularu, Ori Shapira, Ramakanth Pasunuru, Mohit Bansal, Jacob Goldberger, Ido Dagan
| Challenge: | Existing methods focused on clustering sentences to indicate information saliency and avoid redundancy. |
| Approach: | They propose to group together sub-sentential propositions to generate a representative sentence for each cluster via text fusion. |
| Outcome: | The proposed method improves over the previous state-of-the-art method in the DUC 2004 and TAC 2011 datasets, both in automatic ROUGE scores and human preference. |