ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Multi-Document Summarization×Textklassificering×
ÄmnesområdeTextutvinningTextutvinning
FamiljProcess / pipelineProcess / pipeline
Ursprungsår
Upphovsperson
TypNLP text-summarization taskSupervised NLP classification task
UrsprungskällaErkan, G. & Radev, D.R. (2004). LexRank: Graph-Based Lexical Centrality as Salience in Text Summarization. Journal of Artificial Intelligence Research, 22, 457-479. link ↗Joachims, T. (1998). Text Categorization with Support Vector Machines: Learning with Many Relevant Features. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer. DOI ↗
AliasMDS, Çok Belgeli Özetleme (Multi-Document Summarization), multi-source summarizationtext categorization, document classification, topic classification, metin sınıflandırma
Närliggande54
SammanfattningMulti-document summarization (MDS) is a natural-language-processing task that condenses a cluster of related documents into a single comprehensive, coherent, and non-redundant summary. Formally described by Erkan and Radev (2004) through the LexRank algorithm, MDS is used in news cluster analysis, systematic literature reviews, and research synthesis to give readers a unified view of information spread across multiple sources.Text classification, also called text categorization, is a supervised natural-language-processing task that automatically assigns documents to predefined categories. Building on the support-vector-machine approach to text categorization established by Joachims (1998) and consolidated in the text-mining literature by Aggarwal and Zhai (2012), it powers tasks such as spam detection and topic classification by learning from labelled examples.
ScholarGateDatamängd
  1. v1
  2. 2 Källor
  3. PUBLISHED
  1. v1
  2. 2 Källor
  3. PUBLISHED

Gå till sökningen Download slides

ScholarGateJämför metoder: Multi-Document Summarization · Text Classification. Hämtad 2026-06-15 från https://scholargate.app/sv/compare