H-index manipulation by merging articles: models, theory, and experiments

DOI10.1016/J.ARTINT.2016.08.001MaRDI QIDQ329039zbMATH OpenOpenAlexFDO

Authors René van Bevern, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Toby Walsh

Publication date 21 October 2016

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.5498

zbMATH Keywords

citation indexexact algorithmsHirsch indexparameterized complexity

Mathematics Subject Classification ID

Bibliographic studies (01A90) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30)

Abstract: An author's profile on Google Scholar consists of indexed articles and associated data, such as the number of citations and the H-index. The author is allowed to merge articles; this may affect the H-index. We analyze the (parameterized) computational complexity of maximizing the H-index using article merges. Herein, to model realistic manipulation scenarios, we define a compatibility graph whose edges correspond to plausible merges. Moreover, we consider several different measures for computing the citation count of a merged article. For the measure used by Google Scholar, we give an algorithm that maximizes the H-index in linear time if the compatibility graph has constant-size connected components. In contrast, if we allow to merge arbitrary articles (that is, for compatibility graphs that are cliques), then already increasing the H-index by one is NP-hard. Experiments on Google Scholar profiles of AI researchers show that the H-index can be manipulated substantially only if one merges articles with highly dissimilar titles.

Recommendations

• h-Index Manipulation by Undoing Merges
• Hybrid indexing revisited
• Indexing for summary queries, theory and practice
• scientific article; zbMATH DE number 2013297
• Indexation Et Recherche D'Informations Dans Les Hypertextes

Cites work

• An axiomatic characterization of the Hirsch-index
• An index to quantify an individual's scientific research output
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• Critique of Hirsch's citation index: a combinatorial Fermi problem
• Fundamentals of parameterized complexity
• Google Scholar makes it hard -- the complexity of organizing one's publications
• h-Index Manipulation by Undoing Merges
• scientific article; zbMATH DE number 6931791 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• New races in parameterized algorithmics
• On a dual version of the one-dimensional bin packing problem
• On the parameterized complexity of multiple-interval graph problems
• Parameterized algorithms
• Parametrized complexity theory.
• Recent developments in kernelization: a survey
• Reflections on multivariate algorithmics and problem parameterization
• Strategic Candidacy and Voting Procedures
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• Using clausal graphs to determine the computational complexity of \(k\)-bounded positive one-in-three SAT

Cited in

(3)

• h-Index Manipulation by Undoing Merges
• Google Scholar makes it hard -- the complexity of organizing one's publications
• The clever shopper problem

This page was built for publication: \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329039)