Pareto Principle in Datamining: an Above-Average Fencing Algorithm

Abstract

This paper formulates a new datamining problem: which subset of input space has the relatively highest output where the minimal size of this subset is given. This can be useful where usual datamining methods fail because of error distribution asymmetry. The paper provides a novel algorithm for this datamining problem, and compares it with clustering of above-average individuals.

Keywords

• ART
• Pareto principle
• insurance risk