Multi-query center: Aggregation
Publish or Perish tutorial
Note: This tutorial was originally written for Publish or Perish version 4 and all screenshots come from this version. Later versions of Publish or Perish show the multi-query center at the top of every screen for easier access. Its basic functions are similar to PoP4, however.
The Publish or Perish Multi-query center also makes it possible to aggregate queries at a higher level of aggregation in just two simple steps and less than 20 seconds. There might be a number of key scenarios in which you might want to aggregate queries
- Aggregate academic metrics across a research group or department. Calculating metrics at the level of a research group, department, or school after searching for individual academics in that entity. As Google Scholar does not have a reliable affiliation search, this is the only way to assess the collective performance of a group of researchers.
- Aggregate article metrics across a research group or department. Calculating metrics at the level of a research group, department, or school after searching for individual articles published by that entity.
- Metrics for a collection of articles. Calculating the metrics for any collection of articles of interest. For instance one might want to assess the collective impact of a specific set of articles in a particular field of research.
- Combine results of split-year searches for one journal. Combining the results of a number of identical journal queries split up by year to address the Google Scholar 1,000 results limit. This would allow you to get a comprehensive record of publications in most journals as few have more than 1,000 publications a year.
- Combine results of different journal searches. Combining the results of a number of different queries that could not be combined into a single query because of Google Scholar limitations in field size. For instance one might want to search for articles on a specific topic in a range of journals, but Google Scholar’s journal field only allows a certain number of characters.
Worked example: Institutional aggregation
Let’s assume we want to assess the performance of the Department of Management & Marketing at the University of Melbourne (my previous employer). The screenshot below show the query results for all 15 full professors in the department, sorted by h-index. We then select all queries and right-click to get the pop-up menu (see Using PoP). Select Save as CSV… and give the file a meaningful name.
Subsequently, simply re-import this file into PoP. The screenshot below shows the resulting data, sorted by hI,annual. Combined, the department’s professors have an h-index of 119, and more than 56,000 citations.
Find the Department's most cited articles
Having the complete list of the Department’s academic articles also allows one to assess which are the Department’s most highly cited articles, both overall and per year, which journals its academics publish in etc.
Worked example: Aggregation of collection of articles
This screenshot shows the results of an aggregation of 230 articles related to the role of language in international business. We used this for a review article on this topic.
Worked example: Journal aggregation
A journal like Scientometrics publishes a large number of articles per year. Hence a search without year limitations will always run into the Google Scholar limitation of 1,000 results. Thus low cited articles will not show up in your searches. If you wanted to have a complete record of articles published in Scientometrics for the last 10 years, you could run five searches for 2006-2007, 2008-2009, 2010-2011, 2012-2013 and 2014-2015 and then combine them into one file (see screenshot).
This allows you to compare the more than 2,300 papers published in the journal in the last decade, rather than focusing only on the 1,000 most cited ones. This is especially important for more recent articles, as these are likely to fall outside the top 1,000 if one conducts an aggregate search for 2006-2015.
Support Publish or Perish
The development of the Publish or Perish software is a volunteering effort that has been ongoing since 2006. Publish or Perish was designed to help individual academics to present their case for research impact and tenure and promotion to its best advantage, even if you have very few citations. You can also use it to decide which journals to submit to, to prepare for a job interview, to do a literature review, to do bibliometric research, to write laudatios or obituaries, or to do some homework before meeting your academic hero. Publish or Perish is a real Swiss army knife.
Download and use of Publish or Perish is and will remain free (gratis), but your support toward the costs of hosting, bandwidth, and software development is appreciated. Only about one user out of every ten thousand donates, so your support is very welcome. You can support Publish or Perish by donating, or by buying a PDF copy of the Publish or Perish Book or the Publish or Perish Tutorial.
If you find Publish or Perish useful, then this is your chance to say "thank you" to the developers.
|Product name||Unit price||Quantity|
|PoP donation (small)||GBP 1.00|
|PoP donation (medium)||GBP 10.00|
|PoP donation (large)||GBP 50.00|
|PoP donation (corporate)||GBP 500.00|
|Publish or Perish guide (2010)||GBP 14.95|
|Publish or Perish tutorial (2016)||GBP 9.95|
Note: all prices are in Pounds Sterling (GBP). VAT does not apply.
Copyright © 2022 Anne-Wil Harzing. All rights reserved. Page last modified on Thu 2 Jun 2022 10:49
Anne-Wil Harzing is Professor of International Management at Middlesex University, London and visiting professor of International Management at Tilburg University. She is a Fellow of the Academy of International Business, a select group of distinguished AIB members who are recognized for their outstanding contributions to the scholarly development of the field of international business. In addition to her academic duties, she also maintains the Journal Quality List and is the driving force behind the popular Publish or Perish software program.