<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Patent-Based Import Substitution Analysis with Additively Regularized Topic Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Milkov</string-name>
          <email>m.a.milkova@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Central Economics and Mathematics Institute of Russian Academy of Science</institution>
          ,
          <addr-line>47 Nakhimovsky Prospect, Moscow, 117418</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The rapid accumulation of textual data forces the use of various methods to present the structure of available information. One of these methods is topic modeling. We apply Additively Regularized Topic Models (ARTM) for analyzing an import substitution program based on patent data. The program includes plans for 22 industries and contains more than 1500 products and technologies for the proposed import substitution. The use of patent search based on ARTM allows to search immediately by the blocks of a priori information terms of industrial plans for import substitution, and at the output get a selection of relevant documents for each of the industries. This approach allows not only to provide a comprehensive picture of the effectiveness of the program as a whole, but also to obtain more detailed information about which groups of products and technologies have been patented. It is important that topic modeling also solves the problem of synonymy and homonymy of words.</p>
      </abstract>
      <kwd-group>
        <kwd>Topic search</kwd>
        <kwd>Topic modeling</kwd>
        <kwd>Import substitution</kwd>
        <kwd>Patent search</kwd>
        <kwd>Patent analysis</kwd>
        <kwd>Additively Regularized Topic Models</kwd>
        <kwd>ARTM</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Currently, in the Digital Age the information accumulation process is rapid and the
desire to develop effective ways to perceive the essence and to screen out unnecessary
information is natural. The disordered nature of working with information, the lack of
necessary skills and tools is a key factor preventing the recognition of future
innovations and the prediction of their consequences [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Thus, it is necessary to use an
approach to the perception of information that would allow us to present a road map, the
structure of the direction being studied.
      </p>
      <p>
        Considering in this work information in text form, we note that its overabundance
is presented not only on the Internet, but also in the scientific community [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], the legal
field [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], literature [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        Various clustering methods have been well studied to obtain information about the
structure of large amounts of text data: bibliometric analysis [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], clustering social
networks users [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], analysis of discourse and sentiment of messages [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ], analysis of
legal documents [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], etc. However, the changing digital reality requires from us a
revision of approaches to semantic compression of information. Firstly, with regard to
textual data, it is necessary to take into account the problem of synonymy and
homonymy of words. Secondly, when searching, it is necessary to take into account
information that we already have.
      </p>
      <p>
        These requirements are satisfied by topic modeling - a modern tool that determines
the structure of the collection of text documents by identifying hidden topics in the
documents, as well as terms (words or phrases) that characterize each of the topics. In
probabilistic topic modeling a document can with certain probabilities relate to
several topics at once, just as a term can define a particular topic with different
probabilities. Each document is described by a discrete distribution on topics, and each topic is
described by a discrete distribution on terms. Presenting the results in this form allows
to get a roadmap of the direction you are interested in and significantly increases the
accuracy and fullness of the search [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Over the past decade, the concept of topic
search has been developing [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ]. This type of search helps to identify the topics of
real interest, observing the most informative terms in the estimated topics.
      </p>
      <p>This article demonstrates an example of applying topic search in patent analysis
an integral part of both Foresight research, individual research on the prospects of
innovative development, technological trends in various fields, etc. Our research
contributes to this field by providing semi-supervised topic search based on different a
priori information.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Literature Review</title>
      <p>
        Topic modeling has been intensively developing since the late 90s. An important
milestone in the development of probabilistic text modeling is the Probabilistic Latent
Semantic Analysis (PLSA) model described in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. PLSA was based on the principle
of maximum likelihood and was developed as an alternative to classical text
clustering methods based on calculating distance functions.
      </p>
      <p>
        However, PLSA had a number of significant limitations [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], which were
eliminated in the Latent Dirichlet Allocation model (LDA) proposed in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. LDA is a
generative probabilistic model, in which documents are presented as a probabilistic mixture
of hidden topics (each word in a document is generated by some latent topic), while
the distribution of words in each topic is explicitly modeled, as well as the prior
distribution of topics in the document.
      </p>
      <p>
        Literature review shows that LDA is the leader among probabilistic topic models
due to numerous generalizations, extensions and applications to the analysis of
collections of text documents [
        <xref ref-type="bibr" rid="ref16">16-20</xref>
        ].
      </p>
      <p>However, in the works [21, 22], in which the view of PLSA and LDA is critically
revised, it is noted that the widespread use of LDA is explained rather by its purely
mathematical convenience for Bayesian learning. It was emphasized that the prior
Dirichlet distributions and their generalizations have no convincing linguistic
justification. Moreover, the transition from a generating model to an algorithm for adjusting
its parameters requires rather cumbersome calculations, which become much more
complicated when more complex prior distributions are introduced or when several
linguistic phenomena are jointly simulated.</p>
      <p>For these reasons, the development of the so-called Additive Regularization of
Topic Models (ARTM) approach developed in [21] received a powerful impulse.
ARTM is a multicriteria approach based on the presentation of the topic modeling
problem as an ill-posed optimization problem requiring the introduction of a
regularizer - an additional criterion that takes into account the specific features of the
applied problem or knowledge of the subject area [21].</p>
      <p>Currently, two directions of development of topic models are outlined - based on
Bayesian learning (LDA model) and on the basis of Additive regularization. [21]
revise topic models previously developed in the Bayesian approach, for each of which
a corresponding regularizer is found, which leads to the same or very similar model
learning algorithm. Compared to the Bayesian approach, ARTM radically simplifies
the inference of the algorithm and allows to combine regularizers in arbitrary
combinations. Also, recent studies have shown the superiority of ARTM over LDA in terms
of the quality of highlighted topics (see, for example, [23], where ARTM and LDA
are compared using the example of monitoring ethnically determined discourse in
social networks).</p>
      <p>The use of topic modeling for the analysis of patent data has been gaining
popularity in recent years. Research publications in the field of patent analysis show the
effectiveness of both the use of text mining methods in general [24] and the validity of
applying topic modeling [25, 26]. The construction of topic models is used to get an
idea of patenting in the industry [27], to identify technological trends [28], to develop
individual specialized software products for conducting topic patent analysis [26].
3</p>
    </sec>
    <sec id="sec-3">
      <title>Materials and methods</title>
      <p>From 2015 to 2018 Minpromtorg of Russia has been approving the import
substitution programs [29] in the range of economic industries. The programs govern action
plans for import substitution in 22 economic sectors (hereinafter - the Plans). In each
of the industries, a list of goods and technologies has been compiled for which its own
indicator of the share of imports by 2020 has been established. Simple statistics on the
characteristics of the Plans are shown in Table 1.</p>
      <p>Today it is important to present some results of import substitution based on the
analysis of patent data. During the implementation of the Program, a number of
publications appeared in the scientific community evaluating the possibilities of import
substitution for certain goods [30-32]. Despite the crucial importance of conducting a
detailed analysis in each of the development areas, it is useful to have a general
structure of the results. The approach, covering all sectors at once, will allow both to
demonstrate the results of the program as a whole and give a general idea of the state
of various sectors of the economy (based on patent data).</p>
      <p>To analyze the implementation of the import substitution plan, it is necessary to
obtain information on all 1553 points of the Plan, which requires a fundamentally
different approach to the patent search.</p>
      <p>
        Currently, there are various approaches for building topic models [33, 34], [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. In
our work we focus on Additive Regularization of Topic Models as it provides a
convenient way for semi-supervised learning and greater flexibility in constructing topic
models with given properties [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In this article we give only the basics of
multimodal ARTM, as it was done in [35].
      </p>
      <p>Let us denote a finite collection of documents by D, a finite set of topics by T, and
a finite set of modalities by M. In our work we use two modalities: words (unigrams)
and most common bigrams. Each modality has a dictionary of tokens .
Each document is a sequence of tokens from . According to
the bag-of-words hypothesis we take into account how many times the token
appears in the document ( ).</p>
      <p>In ARTM topic modeling is considered as a special case of approximate stochastic
matrix factorization. To learn a factorized representation of a text collection is an
illposed problem, which has an infinite set of solutions. A typical regularization
approach in this case is to impose problem-specific constraints in a form of additive
terms in the optimization criterion [36].</p>
      <p>Given the matrix and find its approximate matrix factorization by
matrix of token probabilities for the topics and
matrix of topic probabilities for the documents:
where is a number of topics in the model (in our case =22).</p>
      <p>Additive regularization narrows the set of solutions of (1) by maximizing the
weighted sum of modality log-likelihoods and regularizers :
under non-negativity and normalization constraints for all columns of and
matrixes. Regularization coefficients are used to balance the importance of
different modalities.</p>
      <p>This optimization problem can be solved using the EM-algorithm. At first, the
initial approximation for , is selected. At the E-step, auxiliary variables
are calculated:
where operator transforms a real vector to a vector representing a discrete
distribution (by zeroing out the negative elements and normalizing). At the M-step,
, are specified:
,
,
(3)
(4)
(5)
where is the modality of the term , .</p>
      <p>Calculating (3)-(5) continue in a loop until convergence.</p>
      <p>Regularizers are aimed at taking into account the linguistic features of the text and
increasing the interpretability of topics. The most common regularizers are sparsing,
smoothing, and decorrelation regularizers of topics [21].</p>
      <p>For our task regularizers need to be constructed for grouping the terms of each of
the Plans in its own topic. Thus, we use 22 smoothing regularizers for matrix (both
for words and bigrams) that encourages terms from each Plan to appear in
related topic , .
(6)</p>
      <p>The convenience of ARTM is that regularization term yields a simple additive
modification of the M-step. For our task, this modification led to the fact that the
parameter was added to the frequencies of terms related to the terms from the “white
list” (Plan terms) at each iteration of the EM algorithm. The value of is selected
experimentally.</p>
      <p>The main task in constructing the model is to select the regularization strategy
function of the regularization coefficient on the iteration number and model quality
criteria. Following [36] we use such quality criteria as perplexity (the degree of
convergence of the model with a given dictionary W, ), the
degree of sparseness of the matrices Φ, Θ (the proportion of zero elements in the
matrix), the size of the kernel (many words with a high conditional probability,
), the purity of the topic (how much the terms inside
the topic are determining - the total probability of the terms of the kernel of the topic
), the contrast of the topic (how well the topic kernel
distinThe reported study was funded by RFBR according to the research project No. 20-07-22059
guishes it from the rest in that, i.e., the probability of meeting the terms of the kernel
in this particular topic ).
4</p>
    </sec>
    <sec id="sec-4">
      <title>Model construction and Results</title>
      <p>It was collected patents for inventions and utility models issued over a 3.5-year period
(January 2016-June 2019) - a total of 152718 documents: 120768 inventions and
31950 utility models. For building the ARTM the Python and the open source library
BigARTM were used [37].</p>
      <p>The model was built on the basis of Titles and Abstracts of patents presented in the
form of unigrams (i.e. single words) and most frequency bigrams (two-word phrases
with a frequency of occurrence in the Title and Abstract of more than or equal to 2).
The experimentally chosen modality weight was: 1.0 for words and 5.0 for
bigrams. The coefficient of 22 smoothing regularizers was .</p>
      <p>The final model had the following quality metrics: Perplexity is 630.7, the
proportion of sparse elements in unigram matrix , in bigrams ,
. The kernel size is , the average purity is 0.992, and the average
contrast is 0.976. Total number of iterations: 40.</p>
      <p>
        Based on the ranged probabilities of columns, we selected patent documents for
each of 22 industries (threshold=0.6) in accordance with a topic characterized by a set
of words and phrases from the corresponding Plan. In addition to standard
automatically calculated metrics, the quality of the model was also evaluated using assessors,
which determine how relevant the selected document is. The value q = 1 was set in
accordance with the patent document if the patent exactly corresponded to one of the
import substitution items declared in the Plan; q = 0.5 was assigned if the patent is
associated with one of the points of the Plan; q = 0 - if it did not correspond to any of
the items in the Plan. This technique has been successfully used in [
        <xref ref-type="bibr" rid="ref10 ref8">8, 10</xref>
        ].
      </p>
      <p>For documents with values q = 1, q = 0.5, a key phrase was selected that
characterizes document belonging to the item of the Plan (Table 2). Thus, each industry was
characterized by import substitution categories (key phrases), total number of
categories (k), average and total mark ( ), and total score
total points of the Plan. Industry ranking results are presented in Fig. 1.
, where N
internal combustion engine</p>
      <p>furniture for children; games and toys; sport
complexes; baby clothes; children's creativity
non-woven materials; protective clothing; wool
processing
Road
nique
Machine tool industry
Builds. materials
builds. construction</p>
      <p>construction</p>
      <sec id="sec-4-1">
        <title>Shipbuilding industry</title>
      </sec>
      <sec id="sec-4-2">
        <title>Transport machine building</title>
      </sec>
      <sec id="sec-4-3">
        <title>Heavy engineering</title>
      </sec>
      <sec id="sec-4-4">
        <title>Pharmaceutical industry</title>
      </sec>
      <sec id="sec-4-5">
        <title>Chemical industry</title>
      </sec>
      <sec id="sec-4-6">
        <title>Non-ferrous metallurgy</title>
      </sec>
      <sec id="sec-4-7">
        <title>Ferrous metallurgy</title>
      </sec>
      <sec id="sec-4-8">
        <title>Power engineering</title>
        <p>Timber industry
Machinery for food
processing industry
Medical industry
Oil and gas engineering</p>
        <p>cellulose treatment; paper, cardboard
and
grain processing
sterilization and disinfection; endoscopic devices;
injection needles; implantable pumps
hydrotreating catalysts; drilling of the wells;
hydrocracking catalysts; hydrocarbon processing;
hydraulic fracturing; catalytic cracking catalysts
tCryonventional Arms Indus- cartridges; sports weapon
Electronic industry
Agricultural and forestry
engineering
bearings; combine harvester; baler
milling machine; lathe; boring machine; spindles;
finish grinding; waterjet cutting; cnc machines
and ceramic mass for tiles; thermal insulation materials;</p>
        <p>crushed stone and mastic asphalt concrete
tech- rdooazderssu;rffarcoen;thylodaraduelri;c eeqxuciapvmateonrt;;
ftrroanilterloaadnedrs;sbemulil-trailer; crane chassis; municipal engineering
mover; flange screw
cistern wagon; brake system; wagon trolleys; covered
wagon
support mountain; refrigeration units
inosine + nicotinamide + riboflavin + succinic acid;
bismuth potassium ammonium citrate; drotaverine;
yohexol; lopinavir + ritonavir; ethyl methyl
hydroxypyridine succinate; rocuronium bromide;
digoxin; 1 carbamoylmethyl 4 phenyl 2 pyrrolidone;
fenspiride; isoniazid; lappaconitine hydrobromide;
standard immunoglobulin;
bromodihydrochlorophenylbenzodiazepine;
desmopressin; fingolimod; anastrozole
paints and varnishes; sealing materials; epoxy
composite; adhesive materials; polyethylene terephthalate;
ultra high molecular weight polyethylene; polymer
composites
aluminum alloy; aluminum, electrolysis; aluminum
ligature; aluminum hydroxide; aluminum powder;
aluminium foil; aluminum rods; anode mass
refractories; tubing; threaded connections; drill pipes;
pipes based on chromium-nickel alloys; casing
current transformers</p>
        <p>Thus, in the context of granted patents for inventions and utility models, industries
that are demonstrated the best indicators of import substitution: Ferrous metallurgy,
Baby goods, Road construction technique, Building materials and building
constructions, Conventional Arms Industry, etc.</p>
        <p>Industries that are currently unable to comply with the import substitution plan
(based on patent documents): Civil aircraft industry, Electronic industry, Power
engineering, Shipbuilding industry, etc.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion</title>
      <p>Intellectual property in the form of patents plays a vital role in today's economy.
However, the constantly growing volume of information, including patent
information, significantly complicates its effective monitoring and analysis. Currently,
many search and analytical systems (for example, Yandex.Patents, Google Patents,
Patseer) use the advanced achievements of computational linguistics, including the
methods of text semantic analysis. Modern search engines are able to find similar
patents, related patents (which mention one or another document of interest to the
user, or other documents to which he refers). The search for similar patents is carried
out not only by keywords, but also by meaning. It should be noted that modern patent
search and analytics systems are designed to obtain information about objects one at a
time. If there are many objects of interest, the search requires significant time
investment. To analyze the implementation of the import substitution plan, it is necessary to
obtain information on all 1553 items of the Plan, which obviously requires a
fundamentally different approach to the implementation of patent search.</p>
      <p>The purpose of topic modeling of patent documents is to simplify access to
documents of interest from the perspective of import substitution. The constructed model
allows you to get a general picture of the implementation of import substitution as a
whole, within the considered time window.</p>
      <p>It is important that the resulting structure allows, if necessary, to detail the results.
For example, to identify the share of individual patent holders who will not be able to
become the main agents for capturing market niches and will not be able to compete
with large foreign companies; share of non-valid patents, etc. This approach is a kind
of “close-up” of patent search, which can serve both the final goal or a starting point
for a more detailed analysis.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusions</title>
      <p>The results demonstrate the effectiveness of the new patent search method based
on topic modeling. The approach allows to search by blocks of a priori information
(in our case, points from all twenty-two industrial import substitution plans at once)
and, at the output, receive a selection of relevant documents for each of the industries.
Applying the topic modeling also solves the problem of synonymy and homonymy of
words.</p>
      <p>In today's constantly changing digital reality, the rate of information accumulation
is so rapid that it requires to revise our approaches to semantic compression of
information. In order to comprehensively cover and analyze the entire spectrum of ongoing
changes, it is necessary to make increased demands on the methods of information
retrieval. An innovative search approach must flexibly take into account the large
amount of already accumulated knowledge and a priori requirements for results. The
results, in turn, should immediately represent a roadmap of the studied direction with
the possibility of as much detail as necessary. The topic modeling approach allows us
to take into account all these requirements and thereby streamline the nature of
working with information, increase the efficiency of knowledge extraction, and avoid
cognitive biases in the perception of information, which is important both at the micro
and macro levels.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The reported study was funded by RFBR according to the research project No.
19010-00293.
17. Mimno, D., Wallach, H.M., Naradowsky, J., Smith, D.A., McCallum, A. Polylingual
Topic Models. Proceedings of the 2009 Conference on Empirical Methods in Natural
Language Processing, Singapore, 880–889 (2009).
18. Ramage, D. Hall D., Nallapati R., and Manning, C.D. (2009) Labeled LDA. A supervised
topic model for credit attribution in multi-labeled corpora. Proceedings of the 2009
Conference on Empirical Methods in Natural Language Processing, 248–256 (2009).
19. Blei, D. M. and Lafferty, J. Dynamic topic models. In: Proceedings of 23rd International
Conference on Machine Learning (ICML), Pittsburgh, Pennsylvania, USA (2006) doi:
10.1145/1143844.1143859.
20. Wang, C., Blei, M. D. and Heckerman, D. Continuous time dynamic topic models. In:
Proceedings of Uncertainty in Artificial Intelligence (UAI), Helsinki, Finland (2008)
arXiv:1206.3298.
21. Vorontsov, K.V., Potapenko A. A. Additive Regularization of Topic Models. Machine
Learning Journal, Special Issue "Data Analysis and Intelligent Optimization", 1-21 (2014)
doi: 10.1007/s10994-014-5476-6 .
22. Potapenko, A. A., Vorontsov, K. V. Robust PLSA Performs Better Than LDA. 35th
European Conference on Information Retrieval, ECIR-2013, Moscow, Russia, 24-27 March
2013. —Lecture Notes in Computer Science (LNCS), Springer Verlag-Germany, 784–787
(2013) doi: 10.1007/978-3-642-36973-5_84.
23. Apishev,M., Koltsov S., Koltsova, O., Nikolenko, S., and Vorontsov, K. Additive
Regularization for Topic Modeling in Sociological Studies of User-Generated Texts. Conference
Paper in Lecture Notes in Computer Science (2017) doi: 10.1007/978-3-319-62434-1_14 .
24. Tseng, Y-H., Lin, C-J. Text mining techniques for patent analysis. Information Processing
&amp; Management 43, 1216-1247 (2007) doi: 10.1016/j.ipm.2006.11.011.
25. Chen., L., Shang, W., Yang, G., Zhang, J., Lei, X. A topic model integrating patent
classification information for patent analysis. Geomatics and Information Science of Wuhan
University 41, 123-126 (2016).
26. Tang, J., Wang, B., Yang, Y., Hu, P., Zhao, Y., Yan, X., Gao, B., Huang, M., Xu, P., Li,
W., Usadi, A.k.: PatentMiner: Topic-driven Patent Analysis and Mining. In: Proceedings
of KDD’12, pp. 1366-1374. Beijing, China (2012) doi: 10.1145/2339530.2339741 .
27. Suominen, A., Toivanen, H., Seppänen, M. Firms' knowledge profiles: Mapping patent
data with unsupervised learning. Technological Forecasting and Social Change 115, 131-142
(2017) doi: 10.1016/j.techfore.2016.09.028 .
28. Choi, D., Song, B. Exploring Technological Trends in Logistics: Topic Modeling-Based</p>
      <p>Patent Analysis. Sustainability 10(8), 1-26 (2018) doi: 10.3390/su10082810.
29. Ministry of Industry and Trade of Russia, Sectoral plans for import substitution in
twentytwo industries, https://gisp.gov.ru/plan-import-change/, last accessed 2020/10/10.
30. Jerivanceva T. N. The use of patent analysis to assess the prospects of import substitution
on the example of domestic retractors and crosslinking products [In Russian]. Jekonomika
nauki 4, 261-275 (2016) doi: 10.22394/2410-132X-2016-2-4-261-275.
31. Jerivanceva, T.N. Assessment of the competitiveness of Russian scientific and
technological backlogs in the field of creating medical instruments [In Russian]. Jekonomika nauki 1,
53-69 (2017) doi: 10.22394/2410-132X-2017-3-1-52-68.
32. Andrejchikov, A.V., Teveleva, O.V., Nevolin, I.V., Milkova M.A., Kravchuk, I.S.
Methodology for conducting search research to identify opportunities for import substitution of
high-tech products based on world patent and financial information resources [In Russian].</p>
      <p>Jekonomika i predprinimatel'stvo 4, 157-167 (2019).
33. Milkova, M.A. Topic models as a tool for distance reading [In Russian]. Cifrovaja
jekonomika 1(5), 57-69 (2019) doi: 10.34706/DE-2019-01-06 .
34. Boyd-Graber, J., Hu, Y., Mimmo, D. Applications of Topic Models. Foundations and</p>
      <p>Trends in Information Retrieval 11(2-3), 143-296 (2017) doi: 10.1561/1500000030.
35. Ianina, A., Golytsyn, L., Vorontsov, K.: Multi-objective topic modeling for exploratory
search in tech news. In: Filchenkov, A., Pivovarova, L., Žižka, J. (eds) Artificial
Intelligence and Natural Language. AINL 2017. Communications in Computer and Information
Science, vol 789, pp.181-193. Springer, Cham (2017) doi:
10.1007/978-3-319-717463_16.
36. Vorontsov, K., Frei, O. Apishev, M., Romov, P., Suvorova, M., Yanina. A.: Non-Bayesian
Additive Regularization for Multimodal Topic Modeling of Large Collections. In:
Proceedings of the 2015 Workshop on Topic Models: Post-Processing and Applications (TM
’15), pp. 29–37. Association for Computing Machinery, New York, USA (2015) doi:
10.1145/2809936.2809943.
37. Frei, O., Apishev, M.: Parallel non-blocking deterministic algorithm for online topic
modeling. In: Ignatov, D. et al. (eds) Analysis of Images, Social Networks and Texts. AIST
2016, Communications in Computer and Information Science, vol 661, pp. 132-144.
Springer, Cham (2016) doi: 10.1007/978-3-319-52920-2_13.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Milovidov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <article-title>Hearing the sound of the wave: what makes it difficult to anticipate innovation?</article-title>
          [In Russian].
          <source>Forsajt</source>
          <volume>12</volume>
          (
          <issue>1</issue>
          ),
          <fpage>88</fpage>
          -
          <lpage>97</lpage>
          (
          <year>2019</year>
          ) doi:10.17323/
          <fpage>2500</fpage>
          -
          <lpage>2597</lpage>
          .
          <year>2018</year>
          .
          <volume>1</volume>
          .88.97
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Nedumov</surname>
            ,
            <given-names>YA.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuznecov</surname>
            ,
            <given-names>S.D.</given-names>
          </string-name>
          <article-title>Issledovatel'skij poisk nauchnyh statej</article-title>
          [In Russian].
          <source>Trudy ISP RAN</source>
          ,
          <volume>30</volume>
          (
          <issue>6</issue>
          ),
          <fpage>171</fpage>
          -
          <lpage>198</lpage>
          (
          <year>2018</year>
          ) doi: 10.15514/ISPRAS-2018-
          <volume>30</volume>
          (
          <issue>6</issue>
          )-
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Pagallo</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Palmirani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Casanovas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sartor</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villata</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <article-title>Introduction: Legal and Ethical Dimensions of AI, NorMAS, and the Web of Data</article-title>
          . In: Pagallo,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Palmirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Casanovas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Sartor</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          ,
          <source>Villata (Eds). Lecture Notes in Artificial Intelligence Springer</source>
          (
          <year>2018</year>
          ) doi: 10.1007/978-3-
          <fpage>030</fpage>
          -00178-
          <issue>0</issue>
          _
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Moretti</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <article-title>Distant reading</article-title>
          . London: Verso (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gibson</surname>
          </string-name>
          , Je.,
          <string-name>
            <surname>Dajm</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garses</surname>
          </string-name>
          , Je.,
          <string-name>
            <surname>Dabich</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Bibliometric analysis as a tool for identifying common and emerging methods of technological Foresight</article-title>
          .
          <source>Forsajt</source>
          <volume>12</volume>
          (
          <issue>1</issue>
          ),
          <fpage>6</fpage>
          -
          <lpage>24</lpage>
          (
          <year>2018</year>
          ) doi: 10.17323/
          <fpage>2500</fpage>
          -
          <lpage>2597</lpage>
          .
          <year>2018</year>
          .
          <volume>1</volume>
          .6.
          <fpage>24</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Halibas</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shaffi</surname>
            ,
            <given-names>A.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mohamed</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>A. Application of text classification and clustering of Twitter data for business analytics</article-title>
          .
          <source>Majan International Conference (MIC)</source>
          ,
          <year>Muscat</year>
          ,
          <fpage>1</fpage>
          -
          <lpage>7</lpage>
          (
          <year>2018</year>
          ) doi: 10.1109/MINTC.
          <year>2018</year>
          .8363162
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Krishna</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aich</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Akhilesh</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hegde</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>Analysis of Customer Opinion Using Machine Learning and</article-title>
          NLP Techniques.
          <source>International Journal of Advanced Studies of Scientific Research</source>
          <volume>3</volume>
          (
          <issue>9</issue>
          ),
          <fpage>128</fpage>
          -
          <lpage>132</lpage>
          (
          <year>2018</year>
          ) https://ssrn.com/abstract=3315430
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Apishev</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koltcov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koltsova</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nikolenko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vorontsov</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Mining Ethnic Content Online with Additively Regularized Topic Models</article-title>
          .
          <source>Computación y Sistemas</source>
          <volume>20</volume>
          (
          <issue>3</issue>
          ),
          <fpage>387</fpage>
          -
          <lpage>403</lpage>
          (
          <year>2016</year>
          ) doi: 10.13053/CyS-20-3-2473.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Sulea</surname>
            ,
            <given-names>O-M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zampieri</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malmasi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vela</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dinu</surname>
            ,
            <given-names>L.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Genabith</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Exploring the Use of Text Classification in the Legal Domain</article-title>
          .
          <source>In: Proceedings of the 2nd Workshop on Automated Semantic Analysis of Information in Legal Texts (ASAIL)</source>
          , London, United
          <string-name>
            <surname>Kingdom</surname>
          </string-name>
          (
          <year>2017</year>
          ) arXiv:
          <fpage>1710</fpage>
          .
          <year>09306v1</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Janina</surname>
            ,
            <given-names>A.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vorontsov</surname>
            ,
            <given-names>K.V.</given-names>
          </string-name>
          <article-title>Multimodal topic models for exploratory search in a collective blog</article-title>
          [In Russian].
          <source>Mashinnoe obuchenie i analiz dannyh 2</source>
          (
          <issue>2</issue>
          ),
          <fpage>173</fpage>
          -
          <lpage>186</lpage>
          (
          <year>2016</year>
          ) doi: 10.21469/22233792.2.2.04.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Grant</surname>
            ,
            <given-names>C.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Clint</surname>
            <given-names>P. G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Virupaksha</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nirkhiwale</surname>
            <given-names>S.</given-names>
          </string-name>
          , Wilson,
          <string-name>
            <given-names>J.N.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.Z.: A</given-names>
            <surname>Topic-Based</surname>
          </string-name>
          <string-name>
            <surname>Search</surname>
          </string-name>
          , Visualization, and
          <string-name>
            <given-names>Exploration</given-names>
            <surname>System</surname>
          </string-name>
          .
          <source>In: FLAIRS Conference</source>
          , pp.
          <fpage>43</fpage>
          -
          <lpage>48</lpage>
          . AAAI Press, Massachusetts (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Eisenstein</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chau</surname>
            ,
            <given-names>D.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kittur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xing</surname>
            ,
            <given-names>E.P.:</given-names>
          </string-name>
          <article-title>TopicViz: interactive topic exploration in document collections</article-title>
          .
          <source>In: Proceeding of CHI EA'12</source>
          , pp.
          <fpage>2177</fpage>
          -
          <lpage>2182</lpage>
          . Association for Computing Machinery, New York, NY, USA (
          <year>2012</year>
          ) doi: 10.1145/2212776.2223772.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <article-title>Probabilistic Latent Semantic Analysis</article-title>
          .
          <source>Uncertainty in Artificial Intelligence</source>
          , UAI'
          <fpage>99</fpage>
          ,
          <string-name>
            <surname>Stockholm</surname>
          </string-name>
          (
          <year>1999</year>
          ) doi: 10.1145/312624.312649.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Daud</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muhammad</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A generalized topic modeling approach for maven search</article-title>
          . In: Li,
          <string-name>
            <given-names>Q.</given-names>
            ,
            <surname>Feng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Pei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.X.</given-names>
            ,
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Zhu</surname>
          </string-name>
          , QM. (eds)
          <article-title>Advances in Data and Web Management</article-title>
          .
          <source>APWeb/WAIM 2009. LNCS</source>
          , vol
          <volume>5446</volume>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>149</lpage>
          . Springer, Heidelberg (
          <year>2009</year>
          ) doi: 10.1007/978-3-
          <fpage>642</fpage>
          -00672-2_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Blei</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Jordan</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Latent Dirichlet allocation</article-title>
          .
          <source>Journal of Machine Learning Research</source>
          ,
          <volume>3</volume>
          (
          <year>2003</year>
          ) doi: 10.1162/jmlr.
          <year>2003</year>
          .
          <volume>3</volume>
          .4-
          <fpage>5</fpage>
          .
          <fpage>993</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Chemudugunta</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smyth</surname>
            <given-names>P.</given-names>
          </string-name>
          , and Steyvers M.
          <article-title>Modeling general and specific aspects of documents with a probabilistic topic model</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          . - MIT Press, Vol.
          <volume>19</volume>
          ,
          <fpage>241</fpage>
          -
          <lpage>248</lpage>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>