论文部分内容阅读
In this paper,a fast classification algorithm which uses a table-look-up method is proposed.Boththeoretical and experimental results are shown:(1)in two dimensional case the computation time canbe reduced to the same order of time needed for the data I/O;(2)in the case of mere than twodimensions more than half a computation time can be saved,The classification accuracy is not affectedby the use of the table-look-up method.The algorithm is most suitable fof computers without afloating-point processor.
In this paper, a fast classification algorithm which uses a table-look-up method is proposed.Boththeoretical and experimental results are shown. (1) in two dimensional case the computation time canbe reduced to the same order of time needed for the data I / O; (2) in the case of mere than twodimensions more than half a computation time can be saved, The classification accuracy is not affected by the use of the table-look-up method. Algorithm is most suitable fof computers without afloating- point processor.