Abstract: Locally linear embedding(LLE)is one of nonlinear dimensionality reduction technique.When large database is performed,the algorithm is time-consuming and huge memory space is occupied.In order to improve the efficiency of the LLE algorithm,a LLE algorithm based on RSOM tree clustering is proposed.Through clustering of RSOM tree,the computation complexity of the LLE algorithm is reduced and the probability of the database is retained.Experiments show that,compared to the original LLE algorithm,the efficiency of the RSOM tree clustering based LLE algorithm is improved remarkably and the memory space is reduced.The manifold structure of the database is also learned correctly.