We propose an approach to embed time series data in a vector space based on the distances obtained from Dynamic Time Warping (DTW), and to classify them in the embedded space. Under the problem setting in which both labeled data and unlabeled data are given beforehand, we consider three embeddings, embedding in a Euclidean space by MDS, embedding in a Pseudo-Euclidean space, and embedding in a Euclidean space by the Laplacian eigenmap technique. We have found through analysis and experiment that the embedding by the Laplacian eigenmap method leads to the best classification result. Furthermore, the proposed approach with Laplacian eigenmap embedding shows better performance than k-nearest neighbor method.