The invention discloses a binary tree-based SVM (support vector machine) classification method. The binary tree-based SVM classification method comprises the following steps: 1, acquiring signals, namely detecting working state information of an object to be detected in N different working states through a state information detection unit, synchronously transmitting the detected signals to a data processor, and acquiring N groups of working state detection information which corresponds to the N different working states; 2, extracting characteristics; 3, acquiring training samples, namely randomly extracting m detections signals to form training sample sets respectively from the N groups of working state detection information which are subjected to the characteristic extraction; 4, determining classification priority; 5, establishing a plurality of classification models; 6 training a plurality of classification models; and 7, acquiring signals in real time and synchronously classifying. The binary tree-based SVM classification method is reasonable in design, easy to operate, convenient to implement, good in use effect and high in practical value; and optimal parameters of an SVM classifier can be chosen, influence on the classification due to noises and isolated points can be reduced, and classification speed and precision are improved.