DocumentCode
693148
Title
Geodesic distance based semi-supervised locality dimensinality reduction
Author
Yan Wang ; Yu Ming ; Yu-Xin Zhai ; Ji-Chuan Chen
Author_Institution
Coll. of Inf. Sci. & Eng., Hebei Univ. of Technol., Tianjin, China
Volume
01
fYear
2013
fDate
14-17 July 2013
Firstpage
136
Lastpage
141
Abstract
Semi-supervised dimensionality reduction is becoming one of the most popular fields nowadays. But the existing algorithms can not fully utilize the information in dimensionality reduction as the side information is treated equally. A new semi-supervised dimensionality reduction algorithm called Geodesic distance based semi-supervised locality dimensionality reduction (GSLDR) is proposed for the handwriting data to overcome the shortcomings. Since Euclidean distance cannot really reflect the structure of data, we adopt geodesic distance as the measurement. Then the algorithm expands the pairwise constraints to strengthen the guiding role of the constraints in dimensionality reduction, and add the constraints to the nearest neighbor graph to make the graph reflect realistic manifold structure of the data. At last, the proposed method is applied to the writer identification. The experimental results on datasets show the effectiveness of the algorithm.
Keywords
graph theory; handwriting recognition; Euclidean distance; GSLDR; adjacency graph; data manifold structure; data structure; geodesic distance based semisupervised locality dimensionality reduction; handwriting data; nearest neighbor graph; pairwise constraints; side information; writer identification; Abstracts; Accuracy; Frequency locked loops; Principal component analysis; Geodesic distance; Local geometric structure; Semi-supervised dimensionality reduction; Weighted pairwise constraints;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Cybernetics (ICMLC), 2013 International Conference on
Conference_Location
Tianjin
Type
conf
DOI
10.1109/ICMLC.2013.6890458
Filename
6890458
Link To Document