z-logo
Premium
Survival analysis of author keywords: An application to the library and information sciences area
Author(s) -
Peset F,
GarzónFarinós F,
González LM,
GarcíaMassó X,
FerrerSapena A,
TocaHerrera JL,
SánchezPérez EA
Publication year - 2020
Publication title -
journal of the association for information science and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.903
H-Index - 145
eISSN - 2330-1643
pISSN - 2330-1635
DOI - 10.1002/asi.24248
Subject(s) - quartile , computer science , field (mathematics) , ephemeral key , library science , function (biology) , information retrieval , period (music) , order (exchange) , data science , statistics , mathematics , philosophy , algorithm , confidence interval , finance , evolutionary biology , pure mathematics , economics , biology , aesthetics
Our purpose is to adapt a statistical method for the analysis of discrete numerical series to the keywords appearing in scientific articles of a given area. As an example, we apply our methodological approach to the study of the keywords in the Library and Information Sciences (LIS) area. Our objective is to detect the new author keywords that appear in a fixed knowledge area in the period of 1 year in order to quantify the probabilities of survival for 10 years as a function of the impact of the journals where they appeared. Many of the new keywords appearing in the LIS field are ephemeral. Actually, more than half are never used again. In general, the terms most commonly used in the LIS area come from other areas. The average survival time of these keywords is approximately 3 years, being slightly higher in the case of words that were published in journals classified in the second quartile of the area. We believe that measuring the appearance and disappearance of terms will allow understanding some relevant aspects of the evolution of a discipline, providing in this way a new bibliometric approach.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here