最近鄰近似法 的英文怎麼說

中文拼音 [zuìjìnlīnjìnsìfǎ]
最近鄰近似法 英文
nearest neighbor approximation
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 最近 : 1. （近來） recently; lately; of late 2. （距離最近的） nearest3. （最近的將來） in the near future; soon
  • 鄰近 : nearclose toadjacent to
  1. A variety of methods including the tabular comparison of data, the tabular comparison of similarity coefficient, the nearest neighbor method and the group - average method of hierarchical agglomerative classification were applied to investigate the forest communities in meizi lake area

    森林植被樣地中以喬木層樹種的重要值為指標，採用紙條排隊法、群落相似系數分類法、最近鄰體法、組平均法對梅子湖森林植被樣地進行數量分類。
  2. In this thesis, the method of similar estimation ( the nearest neighbor ) is applied to classify the feature character

    在特徵字的分類過程中，採用了相似形度量（最近鄰法）的方法。
  3. The tranditional cbr system always adopts the methods of nearest learning > induction indexing and knowledge inducting, thses three methods adapt to the case - searching of qualitative cases

    傳統的cbr系統的相似演算法主要採用最近相鄰檢索法、歸納索引法和知識導引法這3種實例檢索策略。
  4. The search space is divided into many small areas, and each area is given a certain pheromone value. according to the state transition rules, the artificial ants move to the next solution which is generated randomly or calculated by particle swarm optimization. local search strategy is also added into psaco so that the search speed and precision is enhanced

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  5. We using the triangulation constructed from the point ' s adjacent field, which is the nearest to the original local surface, to compute the point ' s normal. it can get a good result

    本文採用了與局部曲面片最接近的由點的鄰域所構造的三角片來近似求點的法向量的方法，得到了較好的實驗結果。
  6. Phylogenetic relationships among these haplotypes were inferred from a minimum spanning network, which was constructed by the computer software minispnet, and two phylogenetic reconstructions were determined by using maximum likelihood algorithm incorporated in the phylogenetic inference package ( phylip ) version 3. 5c and neighbour joining algorithm incorporated in the software molecular evolution genetic analysis ( mega ) version 2. 0. all these methods exclusively divided the haplotypes into three monophyletic clades corresponding to china mainland, northern japan, and southern japan populations respectively. in these populations, the china mainland population and the southern japan population have a relatively closer affinity than either of them with the northern japan population

    最小跨度網路圖（ minimumspanningnetwork ， msn ）和基於最大似然法（ maximumlikelihood ， ml ）和鄰接法（ neighborjoining ， nj ）的系統發生分析均把單元型聚類為對應于中國大陸、日本南部和日本北部的三個單系，其中中國大陸和日本南部梅花鹿有相對較近的親緣關系，支持日本梅花鹿的祖先通過至少兩個大陸橋從亞洲遷移到日本的觀點。
  7. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  8. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  9. 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 。
  10. This situation makes the quality of recommendation systems decreases dramatically. to address this issue, we proposed a collaborative filtering recommendation algoritm based on item rating prediction. this method predicted ratings of un - rated item by the similarity of items, and then the nearest neighbors of target user were calculated with a new similarity measure method

    針對用戶評分數據的極端稀疏性，本文提出了基於項評分預測的irprec協同過濾推薦演算法，通過計算項之間的相似性，初步預測用戶對未評分項的評分，然後採用一種新穎的相似性度量方法計算用戶的最近鄰居。
  11. Three different methods were proposed based on a k - vertex disjoint graph technique which was applied to the reassembly of image fragments : similar coefficient matching ( scm ), volatility gradient matching ( vgm ) and prediction pixel matching ( ppm ), to evaluate the candidate weights between any fragments

    針對目前最優重組演算法中的關鍵技術- -鄰近權重選派技術，提出三種計算方法：相似系數匹配（ scm ） 、波動梯度匹配（ vgm ）和預測像素匹配（ ppm ） 。
  12. The parallel search computing method based on the case has many kinds, the parallel fuzzy inference method is introduced in the paper. the nearest neighbor approach is studied in the third chapter. and as to similarity assessment of numerical features is difficult, an assessment method of similarity between numerical features is built on the basis of fuzzy dissertation

    在案例間相似度的計算方法中，本文介紹了最鄰近匹配函數演算法，針對最鄰近匹配中定量特徵的相似度評估難的問題，建立了一種基於模糊劃分的定量特徵相似度評估方式。
  13. But the cases of two or more foundations were not presented because the interactions between foundations were not considered in all present papers. this thesis eliminates two faults named above by using the assumption of the plane strain and of dynamic foundation - soil interaction factors. the calculating method of dynamic impedances presented by the paper proved to be accurate and practical

    過去許多學者通常將任意形狀基礎的外包規則幾何形狀代替原有的不規則基礎形狀，以達到確定動剛度和阻尼系數的目的，顯然計算結果是近似的；本文將任意剛性基礎劃分為規則的小型基礎，然後求小型基礎之間的動力相互作用因子，最後得到任意剛性基礎的動剛度和阻尼，而且這種方法也可考慮相鄰基礎產生的影響。
  14. Two interactive segmentation methods, snake ( active contour ) and live wire, which are very popular, have been introduced for the medical image segmentation. a snake is a spline curve, which is controlled by an energy equation. to minimize the snake ' s total energy, the finite difference and greedy algorithm have been implemented

    論文引入了snake和livewire兩種十分流行的醫學圖像交互分割方法，詳細推導snake的能量方程，實現了最小化能量方程的有限差分和greedy兩種演算法，並利用鄰近圖像的相似性，將其成功應用於圖像序列的分割； livewire是一種象素級的輪廓搜索演算法，它在方向圖中找到開始點和目標點之間的最小代價路徑。
分享友人
分享到 Line

分享到臉書