Thematic information search is used in various fields of activity. The use of thematic analysis tools to search for conferences allows you to increase the completeness of the search and coverage of conferences, helps to expand the circle of scientific communication of young scientists and the formation of closer scientific connections. The search algorithms developed by the authors use the co-authorship graph and the reference set of authors. The set can be obtained using methods of thematic search of experts or based on given samples. The developed algorithms are language insensitive and take into account the authority of conferences in the scientific community. Approbation was carried out on the data of the scientometric system IAS ISTINA.

The use of modern methods of thematic analysis for the analytical processing of information is currently used in almost all areas of human activity, including scientometrics. Many scientometric and citation systems, including the world famous WoS, Scopus, Google Shcolar, develop thematic categories for searching and processing information. Most important tasks that can be solved using thematic classification methods are: assessment of the dynamics of the development of thematic areas in the organization, country and in world science; search for articles on a given topic; search and assessment of the authority of experts; search for journal for publication and other relevant tasks. The Lomonosov Moscow State University is currently developing and using the system ISTINA. In this project, algorithms have been created that solve some of the problems listed. Scientific research is underway to create new effective mathematical models and algorithms in this area.

Modern scientometric systems and citation systems use various mechanisms of thematic search and thematic filtering of information. In most cases, a full-text approach is used for thematic analysis of articles and journals, which has a number of limitations. The use of algorithms based on graph analysis, both independently and in conjunction with full-text algorithms, eliminates these limitations and improves the completeness and accuracy of subject search. The algorithm developed by the authors and presented in this work uses the co-authorship graph to analyze the thematic proximity of journals. The algorithm is insensitive to the language of the journal and selects similar journals in different languages, which is difficult to implement for algorithms based on the analysis of full-text information. The algorithm was tested in the scientometric system IAS ISTINA. In the interface developed for these purposes, the user can select one journal that is close to him on the subject, and the system will automatically generate a selection of journals that may be of interest to the user both in terms of studying the materials available in them and in terms of publishing his own articles. In the future, the developed algorithm can be adapted to search for similar conferences, collections of publications and scientific projects. The presence of such a tool will increase the publication activity of young employees, increase the citation rate of articles and the citation rate between journals. The results of the algorithm for determining thematic proximity between journals, collections, conferences and scientific projects can also be used to build rules in models of differentiating access to data based on domain ontologies.

One way to evaluate the scientific activity of a scientist is to calculate various indicators based on the number of his publications and their citation. In this case, each co-author of the publication receives the same number of points for it. A similar ranking method leads to an artificial increase in the number of co-authors in our publications. This leads to a distortion of ratings, and to a significant decrease in the quality of thematic search. The method presented in the paper allows us to evaluate the contribution of the author to his published works. Approbation of the method was done on the data of the scientometric system IAS ISTINA.