Proceedings of the Institute for System Programming of the RAS
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Proceedings of ISP RAS:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Proceedings of the Institute for System Programming of the RAS, 2020, Volume 32, Issue 6, Pages 127–136
DOI: https://doi.org/10.15514/ISPRAS-2020-32(6)-10
(Mi tisp563)
 

This article is cited in 2 scientific papers (total in 2 papers)

Hierarchical rubrication of text documents

D. I. Sorokin, A. S. Nuzhny, E. A. Saveleva

Nuclear safety institute of the Russian Academy of Sciences
Full-text PDF (494 kB) Citations (2)
References:
Abstract: Topic modeling is an important and widely used method in the analysis of a large collection of documents. It allows us to digest the content of documents by examination of the selected topics. It has drawbacks such as a need to specify the number of topics. The topics can become too local or too global, depending on that number. Also, it does not provide a relation between local and global topics. Here we present an algorithm and a computer program for the hierarchical rubrication of text documents. The program solves these problems by creating a hierarchy of automatically selected topics in which local topics are connected of the global topics. The program processes PDF documents split them into text segments, builds vector representations using word2vec model and stores them in a database. The vector embeddings are structured in the form of a hierarchy of automatically constructed categories. Each category is identified by automatically selected keywords. The result is visualized in an interactive map. Traversing the hierarchy of topics is done by zooming the map. An analysis of the constructed hierarchy of categories allows us to evaluate the minimum and maximum depth of the hierarchy corresponding to a minimum and a maximum number of different topics contained in the collection of documents. The program was tested on documents on deep nuclear waste disposal. The results show good quality of the constructed hierarchy of topics and the program can be used for familiarization with the collection of documents and for thematic search.
Keywords: rubrication, hierarchical clustering, natural language processing, machine learning.
Document Type: Article
Language: Russian
Citation: D. I. Sorokin, A. S. Nuzhny, E. A. Saveleva, “Hierarchical rubrication of text documents”, Proceedings of ISP RAS, 32:6 (2020), 127–136
Citation in format AMSBIB
\Bibitem{SorNuzSav20}
\by D.~I.~Sorokin, A.~S.~Nuzhny, E.~A.~Saveleva
\paper Hierarchical rubrication of text documents
\jour Proceedings of ISP RAS
\yr 2020
\vol 32
\issue 6
\pages 127--136
\mathnet{http://mi.mathnet.ru/tisp563}
\crossref{https://doi.org/10.15514/ISPRAS-2020-32(6)-10}
Linking options:
  • https://www.mathnet.ru/eng/tisp563
  • https://www.mathnet.ru/eng/tisp/v32/i6/p127
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Proceedings of the Institute for System Programming of the RAS
    Statistics & downloads:
    Abstract page:56
    Full-text PDF :37
    References:8
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024