鄰近映射 的英文怎麼說

中文拼音 [līnjìnyìngshè]
鄰近映射 英文
proximity mapping
  • : Ⅰ形容詞1 (空間或時間距離短) near; close 2 (接近) approaching; approximately; close to 3 (親...
  • : 動詞1. (因光線照射而顯出物體的形象) reflect; mirror; shine 2. (放映) project a movie
  • : Ⅰ動詞1 (用推力或彈力送出) shoot; fire 2 (液體受到壓力迅速擠出) discharge in a jet 3 (放出) ...
  • 鄰近 : nearclose toadjacent to
  1. A real rough set space and the concepts of real lower and upper approximation corresponding to real - valued attributes is studied. a rhombus neighborhood for som is proposed, and the combination of som and rough sets theory is explored in the dissertation. according to the distance between the weight of winner node and the input vector in the real rough sets space, some new weights learning rules are defined

    本文提出採用菱形域代替一般的方形域,可以減少待修正權重的數目;並利用實數粗糙空間的下、上似集的精確概念劃分自組織的輸出結果,使得改進后的結果中各類樣本點之間有明顯的間隔,易於進行分類識別。
  2. 15 jingdan zhang, kun zhou, luiz velho et al. synthesis of progressively - variant textures on arbitrary surfaces. acm trans

    在crps結構中,我們導出了函數,以在排斥計算時正確地面片。
  3. In section 4. 2 we analyze its main idea and algorithm in detail, two relevant theorems included ; section 4. 3 provides plenty instances so to explain its nonlinear dimension reduction ability, section 4. 4 propose a combined method that integrates the advantage of various methods. in section 4. 5 we analyze some significant problems in lle, including the locality of manifold representation, the choice of the neighborhood, the intrinsic dimension estimation and the parametric representation of mapping. in section 4. 6 we design an algorithm for estimating the intrinsic dimension in the base of locally linear approximation and discuss the choice of its parameters

    第四章是本文的重點內容,研究一種全新的非線性降維方法? ?局部線性嵌入方法,對它的思想和演算法進行了詳細的分析,給出演算法兩個相關定理的證明;第三節對比主成分分析,通過實例說明局部線性嵌入方法的非線性降維特徵;第四節在此基礎上提出了旨在結合兩者優勢的組合降維方法;第五節提出了局部線性嵌入方法中存在的若干關鍵性問題,包括流形的局部性、點的選擇、本徵維數的估計和降維的表示,第六節基於局部線性似的思想提出了一種本徵維數的估計方法,設計了實用演算法,結合實例對演算法中參數的選取進行了討論;最後一節提出了一種基於局部線性重構的圖形分類和識別方法,將其應用於手寫體數字的圖像分類識別實驗,實驗得到的分類準確率達96 . 67 。
  4. To accelerate the learning process of self - organizing mapping in the situation of large mount of data or high dimension, two learning algorithms were proposed in this paper, by using partial distortion search and extended partial distortion search respectively to solve the problem of nearest neighbor search during learning process, which could reduce the multiplications greatly

    摘要針對傳統的自組織網路在大數據量或高維情形下訓練過程較慢的問題,提出了分別使用部分失真搜索和擴展的部分失真搜索來完成傳統演算法中最耗時的最搜索過程,減少了完成訓練所需乘法次數。
  5. Open address maps instead assume that there is likely to be a nearby free index in the table

    開放選址則假設表中的位置存在沒有使用的索引。
分享友人