To address the large amount of calculation and low efficiency during each iteration in large-scale data scenarios when using active-set method to solve the problem of Support Vector Data Description (SVDD), an efficient Active-Set Method for SVDD problem with Gaussian kernel (ASM-SVDD) was designed. Firstly, due to the peculiarity of constraint conditions in SVDD dual model, a dimension-reduced subproblem with equality constraints was solved in each iteration. Then, the active-set was updated through matrix manipulations. Each update calculation was only related to the existing support vectors and a single sample point, which reduced the amount of computation dramatically. In addition, since ASM-SVDD algorithm can be seen as a variant of the traditional active-set method, the limited termination of this algorithm was obtained by applying the theory of active-set method. Finally, simulation and real datasets were used to verify the performance of ASM-SVDD algorithm. The results show that ASM-SVDD algorithm can improve the model performance effectively as the number of training rounds increases. Compared to the fast incremental algorithm to solve SVDD problem — FISVDD (Fast Incremental SVDD), ASM-SVDD algorithm has the objective value obtained by training reduced by 25.9% and the recognition ability of support vectors improved by 10.0% on the typical low-dimensional high-sample dataset shuttle. At the same time, ASM-SVDD algorithm obtains F1 scores on different datasets all higher than FISVDD algorithm with the maximum improvement of 0.07% on the super large-scale dataset criteo. It can be seen that ASM-SVDD algorithm can obtain more stable hypersphere through training, and obtain higher judgment accuracy of test samples while performing outlier detection. Therefore, ASM-SVDD algorithm is suitable for outlier detection in large-scale data scenarios.