LeQua@CLEF2022: Learning to Quantify

• URL: http://arxiv.org/abs/2111.11249v1
• Date: Mon, 22 Nov 2021 14:54:20 GMT
• Title: LeQua@CLEF2022: Learning to Quantify
• Authors: Andrea Esuli, Alejandro Moreo, Fabrizio Sebastiani
• Abstract summary: LeQua 2022 is a new lab for the evaluation of methods for learning to quantify'' in textual datasets. The goal of this lab is to provide a setting for the comparative evaluation of methods for learning to quantify, both in the binary setting and in the single-label multiclass setting.
• Score: 76.22817970624875
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: LeQua 2022 is a new lab for the evaluation of methods for ``learning to quantify'' in textual datasets, i.e., for training predictors of the relative frequencies of the classes of interest in sets of unlabelled textual documents. While these predictions could be easily achieved by first classifying all documents via a text classifier and then counting the numbers of documents assigned to the classes, a growing body of literature has shown this approach to be suboptimal, and has proposed better methods. The goal of this lab is to provide a setting for the comparative evaluation of methods for learning to quantify, both in the binary setting and in the single-label multiclass setting. For each such setting we provide data either in ready-made vector form or in raw document form.

Related papers

• Contextual Document Embeddings [77.22328616983417]
  We propose two complementary methods for contextualized document embeddings. First, an alternative contrastive learning objective that explicitly incorporates the document neighbors into the intra-batch contextual loss. Second, a new contextual architecture that explicitly encodes neighbor document information into the encoded representation.
  arXiv  Detail & Related papers  (2024-10-03T14:33:34Z)
• Classification Tree-based Active Learning: A Wrapper Approach [4.706932040794696]
  This paper proposes a wrapper active learning method for classification, organizing the sampling process into a tree structure. A classification tree constructed on an initial set of labeled samples is considered to decompose the space into low-entropy regions. This adaptation proves to be a significant enhancement over existing active learning methods.
  arXiv  Detail & Related papers  (2024-04-15T17:27:00Z)
• A Fixed-Point Approach to Unified Prompt-Based Counting [51.20608895374113]
  This paper aims to establish a comprehensive prompt-based counting framework capable of generating density maps for objects indicated by various prompt types, such as box, point, and text. Our model excels in prominent class-agnostic datasets and exhibits superior performance in cross-dataset adaptation tasks.
  arXiv  Detail & Related papers  (2024-03-15T12:05:44Z)
• A Novel Dataset for Non-Destructive Inspection of Handwritten Documents [0.0]
  Forensic handwriting examination aims to examine handwritten documents in order to properly define or hypothesize the manuscript's author. We propose a new and challenging dataset consisting of two subsets: the first consists of 21 documents written either by the classic pen and paper" approach (and later digitized) and directly acquired on common devices such as tablets. Preliminary results on the proposed datasets show that 90% classification accuracy can be achieved on the first subset.
  arXiv  Detail & Related papers  (2024-01-09T09:25:58Z)
• Retrieval-based Text Selection for Addressing Class-Imbalanced Data in Classification [0.6650227510403052]
  This paper addresses the problem of selecting a set of texts for annotation in text classification using retrieval methods. An additional challenge is dealing with binary categories that have a small number of positive instances, reflecting severe class imbalance. We introduce an effective method for selecting a small set of texts for annotation and building high-quality classifiers.
  arXiv  Detail & Related papers  (2023-07-27T14:42:16Z)
• Task-Specific Embeddings for Ante-Hoc Explainable Text Classification [6.671252951387647]
  We propose an alternative training objective in which we learn task-specific embeddings of text. Our proposed objective learns embeddings such that all texts that share the same target class label should be close together. We present extensive experiments which show that the benefits of ante-hoc explainability and incremental learning come at no cost in overall classification accuracy.
  arXiv  Detail & Related papers  (2022-11-30T19:56:25Z)
• DocSCAN: Unsupervised Text Classification via Learning from Neighbors [2.2082422928825145]
  We introduce DocSCAN, a completely unsupervised text classification approach using Semantic Clustering by Adopting Nearest-Neighbors (SCAN) For each document, we obtain semantically informative vectors from a large pre-trained language model. Similar documents have proximate vectors, so neighbors in the representation space tend to share topic labels. Our learnable clustering approach uses pairs of neighboring datapoints as a weak learning signal. The proposed approach learns to assign classes to the whole dataset without provided ground-truth labels.
  arXiv  Detail & Related papers  (2021-05-09T21:20:31Z)
• Minimally-Supervised Structure-Rich Text Categorization via Learning on Text-Rich Networks [61.23408995934415]
  We propose a novel framework for minimally supervised categorization by learning from the text-rich network. Specifically, we jointly train two modules with different inductive biases -- a text analysis module for text understanding and a network learning module for class-discriminative, scalable network learning. Our experiments show that given only three seed documents per category, our framework can achieve an accuracy of about 92%.
  arXiv  Detail & Related papers  (2021-02-23T04:14:34Z)
• Hierarchical Bi-Directional Self-Attention Networks for Paper Review Rating Recommendation [81.55533657694016]
  We propose a Hierarchical bi-directional self-attention Network framework (HabNet) for paper review rating prediction and recommendation. Specifically, we leverage the hierarchical structure of the paper reviews with three levels of encoders: sentence encoder (level one), intra-review encoder (level two) and inter-review encoder (level three) We are able to identify useful predictors to make the final acceptance decision, as well as to help discover the inconsistency between numerical review ratings and text sentiment conveyed by reviewers.
  arXiv  Detail & Related papers  (2020-11-02T08:07:50Z)
• SPECTER: Document-level Representation Learning using Citation-informed Transformers [51.048515757909215]
  SPECTER generates document-level embedding of scientific documents based on pretraining a Transformer language model. We introduce SciDocs, a new evaluation benchmark consisting of seven document-level tasks ranging from citation prediction to document classification and recommendation.
  arXiv  Detail & Related papers  (2020-04-15T16:05:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.