Indexed by:
Abstract:
Graph based semi-supervised learning (GSL) method runs slowly because of the need of much time to construct a neghbor graph. This paper presents a hash graph based semi-supervised learning (HGSL) method, which can search neighbors by locality sensitive hashing function and efficently reduce the time for GSL to construct a neighbor graph. Image segmentation experiments show that HGSL has an improvement of 0.47% in average segmenting accuracy, and can geatly reduce the segmenting time, e. g., it takes about 28.5% of the time for GSL to segent an image with size of 300 × 800. Copyright © 2010 Acta Automatica Sinica. All rights reserved.
Keyword:
Reprint Author's Address:
Email:
Source :
Acta Automatica Sinica
ISSN: 0254-4156
Year: 2010
Issue: 11
Volume: 36
Page: 1527-1533
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count: 3
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: