Tag: Pairwise Comparisons

CI students’ research accepted at the KES2019 international conference in Budapest

KES 2019 conference in Budapest, Hungary

CI Computer Science students were successful in submitting three papers to KES 2019, the 23rd International Conference on Knowledge-Based and Intelligent Information & Engineering Systems, which this year is taking place in Budapest, Hungary, in September 2019. The papers are the following:

  • Approximating consistency in pairwise comparisons, co-authored by Chris Kuske, Konrad Kułakowski and Michael Soltys. Chris Kuske was a masters student in Computer Science at CI, and this paper is the result of his masters thesis [pdf], which was co-supervised by Prof. Konrad Kułakowski (AGH), who at the time was a Kościuszko Scholar in Computer Science at CI. Chris Kuske is a Software Lead at Teledyne Controls where he develops avionics software for commercial aircrafts. (This paper will be presented in the Invited Session IS18: Decision modeling with and without pairwise comparisons.)
  • SEAKER: A mobile digital forensics triage device, co-authored by Eric Gentry and Michael Soltys. Eric Gentry was a masters student in Computer Science at CI, and currently working at GBL Systems, and lecturing for Computer Science at CI. This paper is the result of a collaboration between Computer Science at CI and the SoCal High Technology Task Force. For more details on this collaboration please see here. (This paper will be presented in the Invited Session IS13: Cybercrime Investigation and Digital Forensics.)
  • Deploying Health Campaign Strategies to Defend Against Social Engineering Threats, co-authored by Noelle Abe and Michael Soltys. Noelle Abe is a senior student at CI, who just graduated this May with a degree in Computer Science. Noelle Abe was both a President’s Scholar at CI, and the vice-president of the Computer Science Girls Club. This paper was initiated by Noelle as part of her research as an exchange student in the UK in 2017. (This paper will be presented in the Invited Sessions IS24: Knowledge-based Learning and Education Support System: Design and Function.)

Complex Ranking Procedures

Complex Ranking Procedures is a paper co-authored by Barbara Sandrasagra and Michael Soltys, that appeared in a Special Issue of Fundamenta Informaticae dedicated to a method of ranking known as Pairwise Comparisons (Volume 144, Number 3-4, Pages 223-240, 2016). The full paper can be found here: http://doi.org/10.3233/FI-2016-1331.

This paper is a continuation of work that was first presented at the conference KES2014, tilted Fair ranking in competitive bidding procurement: A case analysis, and where it was given the best paper award; click tag kes2014 for more background.

In Complex Ranking Procedures we propose a research program for developing a formal framework for ranking procedures based on the Pairwise Comparisons method. We are interested in the case where relatively few items are to be ranked with a complex procedure and according to a large number of criteria. A typical example of this scenario is a competition where several companies bid for a contract, and where the selection of the winner is done with multiple criteria according to an intricate selection procedure. Several other applications are suggested.