kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Granularity of algorithmically constructed publication-level classifications of research publications: Identification of specialties
Karolinska Inst, Univ Lib, Stockholm, Sweden.;Karolinska Inst, Dept Learning Informat Management & Eth, Hlth Informat Ctr, Stockholm, Sweden..ORCID iD: 0000-0003-4442-1360
KTH, School of Education and Communication in Engineering Science (ECE), Department for Library services, Language and ARC, Publication Infrastructure. Uppsala Univ, Dept Stat, Uppsala, Sweden.ORCID iD: 0000-0003-0229-3073
2020 (English)In: Quantitative Science Studies, ISSN 2641-3337, Vol. 1, no 1, p. 207-238Article in journal (Refereed) Published
Abstract [en]

In this work, we build on and use the outcome of an earlier study on topic identification in an algorithmically constructed publication-level classification (ACPLC), and address the issue of how to algorithmically obtain a classification of topics (containing articles), where the classes of the classification correspond to specialties. The methodology we propose, which is similar to that used in the earlier study, uses journals and their articles to construct a baseline classification. The underlying assumption of our approach is that journals of a particular size and focus have a scope that corresponds to specialties. By measuring the similarity between (1) the baseline classification and (2) multiple classifications obtained by topic clustering and using different values of a resolution parameter, we have identified a best performing ACPLC. In two case studies, we could identify the subject foci of the specialties involved, and the subject foci of specialties were relatively easy to distinguish. Further, the class size variation regarding the best performing ACPLC is moderate, and only a small proportion of the articles belong to very small classes. For these reasons, we conclude that the proposed methodology is suitable for determining the specialty granularity level of an ACPLC.

Place, publisher, year, edition, pages
MIT Press - Journals , 2020. Vol. 1, no 1, p. 207-238
Keywords [en]
algorithmic classification, article-level classification, classification system, granularity level, specialty
National Category
Information Studies
Identifiers
URN: urn:nbn:se:kth:diva-302020DOI: 10.1162/qss_a_00004ISI: 000691837400011Scopus ID: 2-s2.0-85117844261OAI: oai:DiVA.org:kth-302020DiVA, id: diva2:1594682
Note

QC 20210916

Available from: 2021-09-16 Created: 2021-09-16 Last updated: 2023-11-30Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Sjögårde, PeterAhlgren, Per

Search in DiVA

By author/editor
Sjögårde, PeterAhlgren, Per
By organisation
Publication Infrastructure
Information Studies

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 58 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf