Abstract A classification problem aims at constructing a best classifier with the smallest risk. When sample size approaches infinity, learning algorithms for are characterized by an asymptotical property, i.e., universal consistency. It plays crucial role in measuring construction of rules. consistent algorithm ensures that larger is, more accurately distribution samples could be reconstructed...