Improved Speed of InterCriteria Analysis

Abstract

We will show that the computation of the intercriteria counters can be done in O(n log n) time (quasi-linear complexity). Up to this point, all implementations have used O(n2) operations, which does not allow processing of data over hundreds of thousands.

Keywords

• intercriteria analysis
• quasi-linear complexity