scholarly journals Limitations of Applying the Data Compression Method to the Classification of Abstracts of Publications Indexed in Scopus

2020 ◽  
Vol 18 (3) ◽  
pp. 57-68
Author(s):  
Irina V. Selivanova
Keyword(s):  
Data Compression ◽  
Automatic Generation ◽  
Subject Area ◽  
Theoretical Computer Science ◽  
Scientific Texts ◽  
Theoretical Computer ◽  
Subject Areas ◽  
Number Of Publications ◽  
Initial Classification

The paper describes the limitations of applying the method of classification of scientific texts based on data compression to all categories indicated in the ASJC classification used in the Scopus bibliographic database. It is shown that the automatic generation of learning samples for each category is a rather time-consuming process, and in some cases is impossible due to the restriction on data upload installed in Scopus and the lack of category names in the Scopus Search API. Another reason is that in many subject areas there are completely no journals and, accordingly, publications that have only one category. Application of the method to all 26 subject areas is impossible due to their vastness, as well as the initial classification of Scopus. Often in different subject areas there are terminologically close categories, which makes it difficult to classify a publication as a true area. These findings also indicate that the classification currently used in Scopus and SciVal may not be completely reliable. For example, according to SciVal in terms of the number of publications, the category “Theoretical computer science” is in second place among all publications in the subject area “Mathematics”. The study showed that this category is one of the smallest categories, both in terms of the presence of journals and publications with only this category. Thus, many studies based on the use of publications in ASJC may have some inaccuracies.

A Novel Sequence Graph-Based Approach to Find Academic Research Trends

2020 ◽  
Vol 12 (1) ◽  
pp. 45-56
Author(s):  
Soumya George ◽  
M. Sudheep Elayidom ◽  
T. Santhanakrishnan
Keyword(s):  
Computer Science ◽  
Efficient Method ◽  
Academic Research ◽  
Subject Area ◽  
Research Trends ◽  
Challenges And Opportunities ◽  
Sequence Graph ◽  
Academic Publications ◽  
Subject Areas

Research trends are dynamic, changing from time to time. It is an indicator of the latest innovations in each field of research, current areas of research, the latest technologies, and developments in each field of research. It also helps with future innovations and developments by providing current challenges and opportunities. This article proposes an efficient method to find research trends in each field of research of any subject area by using the graph-based subject classification of published papers. This methodology can be efficiently used to find research trends at any point of time, based on the published year of academic publications. A study of change in research trends in three subject areas - physics, mathematics, and computer science have been successfully conducted based on a total of 4500 publications since 2004.

scholarly journals Mapeamento de conhecimento na plataforma Scopus: um estudo sobre a indústria criativa

2015 ◽  
Vol 13 (2) ◽  
pp. 329
Author(s):  
Cristiano Max Pereira Pinheiro ◽  
Mauricio Barth ◽  
Serje Schmidt ◽  
Dusan Schreiber
Keyword(s):  
Social Sciences ◽  
Cultural Policy ◽  
Subject Area ◽  
Scientific Production ◽  
Creative Industries ◽  
Theoretical Development ◽  
Scientific Texts ◽  
Quantitative Results ◽  
Scopus Database ◽  
Number Of Publications

Buscando destacar o momento oportuno à compreensão do tema, este trabalho visa apresentar um mapeamento da produção científica no domínio da Indústria Criativa, através de uma proposta de mineração de textos científicos na base de dados Scopus, fundamentada em métodos bibliométricos. Para o desenvolvimento teórico da pesquisa, são utilizados autores como Howkins (2002), Deheinzelin (2011), Reis (2012), Prodanov e Freitas (2013), Hauenstein (2008), Vanti (2006), M. Hayashi, Faria e C. Hayashi (2013). Ao fim do estudo, destaca-se que, através dos critérios estabelecidos, o levantamento realizado apontou 933 publicações na área de Indústria Criativa. Ressalta-se, ainda, outros resultados quantitativos, analisados seguindo categorias com maior número de publicações, como: ano (2013), periódico (International Journal of Cultural Policy), autor (C. Gibson), instituição de ensino (Queensland University), país (Reino Unido) e área de assunto (Ciências Sociais).AbstractSeeking to highlight the appropriate time to understand the issue, this paper presents a mapping of scientific production in the field of Creative Industries, through a proposed mining of scientific texts in the Scopus database, based on bibliometric methods. For the theoretical development of research, authors like Howkins (2002), Deheinzelin (2011), Reis (2012), Prodanov and Freitas (2013), Hauenstein (2008), Vanti (2006), M. Hayashi, Faria and C. Hayashi (2013) are used. At the end of the study, it is emphasized that through the established criteria, the survey showed 933 publications in the area of Creative Industries. It is noteworthy also other quantitative results are as the following categories with the highest number of publications: year (2013), journal (International Journal of Cultural Policy), author (C. Gibson), School (Queensland University), country (UK) and subject area (Social Sciences).KeywordsCreative Industry. Bibliometrics. Scopus.

Trends of puffery in advertising – a bibliometric analysis

2019 ◽  
Vol 26 (8) ◽  
pp. 2468-2485 ◽  
Author(s):  
Krunal K. Punjani ◽  
V.V. Ravi Kumar ◽  
Sanjeev Kadam
Keyword(s):  
Bibliometric Analysis ◽  
Research Area ◽  
Subject Area ◽  
Graphical Analysis ◽  
Content Type ◽  
Research Areas ◽  
Research Collaborations ◽  
Subject Areas ◽  
The Subject ◽  
Number Of Publications

Purpose The purpose of this paper is to quantitatively assess the essential trends of existing research on “puffery in advertising” through bibliometric analysis. Design/methodology/approach This study uses citation data collected through Scopus and Google Scholar for the research area “puffery in advertising” to investigate the most productive journals, top countries of affiliation and prominent years with maximum citations. The study analyses the 87 articles related to “puffery in advertising,” published during 1840 to 2018. Moreover, this study also presents graphical analysis through network maps. Findings “Puffery in advertising” has remained an under-researched area. However, records of past ten years indicate marginal growth in the number of publications. USA dominates this research area with most numbers of articles published till date. Through clustering of subject areas, it is found that majority of articles have been published under the subject area of “Business, Management and Accounting.” Interestingly, the results of the network maps slightly differ from that of citation table. Practical implications This paper is useful for any reader or researcher who wants to understand the trends of “puffery in advertising” in terms of citation analysis, authors and affiliation countries, and prominent years with maximum citations, which would further enable them to discover emerging research areas, potential research collaborations and publications. Originality/value To the knowledge of the authors, this is the first ever bilbiometric study on “puffery in advertising” providing a bird’s-eye view of the essential trends.

scholarly journals A correspondence between maximal abelian sub-algebras and linear logic fragments

2016 ◽  
Vol 28 (1) ◽  
pp. 77-139 ◽  
Author(s):  
THOMAS SEILLER
Keyword(s):  
Computer Science ◽  
Essential Role ◽  
Linear Logic ◽  
Theoretical Computer Science ◽  
Theoretical Computer

We show a correspondence between a classification of maximal abelian sub-algebras (MASAs) proposed by Jacques Dixmier (Dixmier 1954. Annals of Mathematics59 (2) 279–286) and fragments of linear logic. We expose for this purpose a modified construction of Girard's hyperfinite geometry of interaction (Girard 2011. Theoretical Computer Science412 (20) 1860–1883). The expressivity of the logic soundly interpreted in this model is dependent on properties of a MASA which is a parameter of the interpretation. We also unveil the essential role played by MASAs in previous geometry of interaction constructions.

scholarly journals From the Quasi-Total Strong Differential to Quasi-Total Italian Domination in Graphs

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1036
Author(s):  
Abel Cabrera Martínez ◽  
Alejandro Estrada-Moreno ◽  
Juan Alberto Rodríguez-Velázquez
Keyword(s):  
Vertex Cover ◽  
Domination Number ◽  
Theoretical Computer Science ◽  
Discrete Mathematics ◽  
Special Issue ◽  
Total Domination Number ◽  
Theoretical Computer ◽  
Graph Parameters ◽  
Semitotal Domination ◽  
Domination In Graphs

This paper is devoted to the study of the quasi-total strong differential of a graph, and it is a contribution to the Special Issue “Theoretical computer science and discrete mathematics” of Symmetry. Given a vertex x∈V(G) of a graph G, the neighbourhood of x is denoted by N(x). The neighbourhood of a set X⊆V(G) is defined to be N(X)=⋃x∈XN(x), while the external neighbourhood of X is defined to be Ne(X)=N(X)∖X. Now, for every set X⊆V(G) and every vertex x∈X, the external private neighbourhood of x with respect to X is defined as the set Pe(x,X)={y∈V(G)∖X:N(y)∩X={x}}. Let Xw={x∈X:Pe(x,X)≠⌀}. The strong differential of X is defined to be ∂s(X)=|Ne(X)|−|Xw|, while the quasi-total strong differential of G is defined to be ∂s*(G)=max{∂s(X):X⊆V(G)andXw⊆N(X)}. We show that the quasi-total strong differential is closely related to several graph parameters, including the domination number, the total domination number, the 2-domination number, the vertex cover number, the semitotal domination number, the strong differential, and the quasi-total Italian domination number. As a consequence of the study, we show that the problem of finding the quasi-total strong differential of a graph is NP-hard.

Sign in / Sign up

Export Citation Format

Share Document