摘要:
,1.One nearest neighbor Input: Query article: Xq Corpus of documents (N docs): (X1, X2, X3,... ,XN) output : XNN = min disance(Xq, Xi) 2. K-NN Algorit 阅读全文
posted @ 2017-05-24 21:03
ClimberClimb
阅读(179)
评论(0)
推荐(0)
浙公网安备 33010602011771号