Pareto Principle in Datamining: an Above-Average Fencing Algorithm

K. Macek
2008 Acta Polytechnica  
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.
doaj:3eff4bc7e5a84d11bfce20b1f0f63781 fatcat:hobkjdoihjg6xc5ds5mfxs7unm