近似規則 的英文怎麼說

中文拼音 [jìnsìguīzé]
近似規則 英文
approximate rule
  • 近 : Ⅰ形容詞1 （空間或時間距離短） near; close 2 （接近） approaching; approximately; close to 3 （親...
  • 規 : Ⅰ名詞1 （畫圓形的工具） instrument for drawing circles 2 （規則; 成例） rule; regulation 3 [機械...
  • 則 : Ⅰ名詞1 （規范） standard; norm; criterion 2 （規則） regulation; rule; law 3 （姓氏） a surname Ⅱ...
  • 近似 : approximate; similar; approach; approximation; roughness; propinquity
  • 規則 : 1. （規定的制度或章程） rule; regulation; ordination; prescribed procedure; rope 2. （整齊） regular
  1. Optimized association rules are permitted to contain uninstantiated attributes. the optimization procedure is to determine the instantiations such that some measures of the roles are maximized. this paper tries to maximize interest to find more interesting rules. on the other hand, the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence. a naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute. unfortunately, that results in a poor performance. a heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance. the experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes. the experiments with real data set show the approximate linear scalability and good accuracy of the algorithm

    優化關聯規則允許在規則中包含未初始化的屬性.優化過程就是確定對這些屬性進行初始化，使得某些度量最大化.最大化興趣度因子用來發現更加有趣的規則;另一方面，允許優化規則在前提和結果中各包含一個未初始化的數值屬性.對那些處理一個數值屬性的演算法進行直接的擴展，可以得到一個發現這種優化規則的簡單演算法.然而這種方法的性能很差，因此，為了改善性能，提出一種啟發式方法，它發現的是近似最優的規則.在人造數據集上的實驗結果表明，當優化規則包含兩個數值屬性時，優化興趣度因子得到的規則比優化可信度得到的規則更有趣.在真實數據集上的實驗結果表明，該演算法具有近似線性的可擴展性和較好的精度
  2. The main results as follows results from sinoatrial node in vivo 1 、 under bilateral vagi intact condition the value of hf ( high frequency power ) component, lf ( low frequency power ) component and apen value of ibis was the highest, but the lf / hf ratio was the lowest ; unilateral vagotomy decreased apen value of ibis, right vagotomy increased lf / hf ratio but left vagotomy did not

    05 ） 。在離體竇房結還記錄到自發輕度不規則放電，自發不規則放電使竇房結放電間期近似嫡從對照時的0二8土0 09 （ n 6 ）升高到不規則放電時的0
  3. Based on many references, a evaluating function is proposed with performance index of hall call waiting time ( hwt ), people number in a car, energy consuming. the statistic approximation algorithm for hwt is introduced, based on the analysis of elevator traffic state, the calculation of traveling distance and stop number is explained in detail in the thesis. according to the characteristics of the elevator, a group of elevator teaching signals are constructed, by which the weight coefficients are trained according to the widrow - hoff rule

    本文在借鑒了大量的文獻基礎上，提出以平均等候時間、轎廂人數、能源消耗為性能指標的評價函數；詳細介紹了乘客待梯時間hwt的統計近似演算法；基於對電梯交通狀況的分析，對停層次數和運行距離這兩個重要參數的計算進行了詳盡的介紹；依據電梯運行特性參數，構造一組電梯運行教師信號，並採用神經網路的widrow - hoff學習規則訓練權系數。
  4. The main design procedure involves the use of a feasible approximation method to establish a finite - dimensional and interconnected nonlinear dynamics, and then utilize the cascaded nonlinear feedback design for achieving uniform output regulation

    主要設計方式擬先採用可行近似方法建立一有限次元及內都串聯的非線性動態，接著利用串級非線性回饋控制設計使得均一輸出能規則化。
  5. Based on the research and model test, the head loss of flap valves is analyzed by both mathematical physics method and the equation of criterion, and the impulsive force and open angle of flap valve are researched. the flap valve approximate - calculation method is the emphases in this paper. the design methods and using effect of air - filled floating flap valve are studied in the paper by combining with engineering example

    在總結前人研究的基礎上，對照試驗結果，通過數理解析和準則方程分析了拍門水頭損失，研究了拍門水流沖力的求解和拍門開啟角度的求解，著重研究分析了拍門近似計算方法，分析拍門在水中的運動規律，並結合工程實例，研究探討充氣浮箱式拍門的配重方法及其使用效果，為今後開拓充氣浮箱式拍門的運用領域作些探討研究。
  6. 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

    該演算法首先將連續對象定義域平均分成許多邊緣相互重疊的小區域，區域的稠密程度決定了演算法解的精度，每個區域賦予一定的信息素值;螞蟻根據狀態轉移規則在隨機生成的可行解與利用微粒群演算法得出的可行解之間選擇下一步要去的位置;引入局部尋優策略，加強近似最優解鄰域內的局部搜索，提高搜索速度和精度。
  7. The analysis result on prestressed concrete slab - column structure in regular column layout is closed to that of actual situation. for slab - column structure of variable slab width, approximation is needed or is replaced by fem

    等代框架法對規則板柱結構的分析比較接近真實情況，對板帶寬度變化的板柱結構則需作近似或改用有限元法來計算。
  8. While putting rough set theory into practice, this thesis pays attention to setting - up the proper data structure. in order to improve the data utilization ratio and promote rule quality, this thesis puts forward the method of " divide equally and examine each other this thesis bring forward the method of dynamic reduce to overcome data noise and confirm the best reduction finally with the help of rosetta tool software we apply the above concept and method to reality, and succeeded in obtaining the optimum rule for the expert system of production scheduling in daye iron ore mine, wuhan iron and steel company

    由於標準粗糙集模型對數據噪音高度敏感以及工程應用中數據噪音引入的不可避免性，標準粗糙集模型在實際應用中存在一系列問題，為克服數據噪音以及規則泛化的需要，本文採用變精度模型，由此模型引入近似約簡方法。本文在將粗糙集理論及變精度粗糙集模型應用於實際的同時，注重研究了適當數據結構的建立。為提高數據利用率，提升規則生成的質量，提出了平分互測規則集泛化能力考核方法。
  9. A popular solution toimprove the speed and scalability of the association rule mining is todo the algorithm on a random sample instead of the entire database. buthow to effectively define and efficiently estimate the degree of errorwith respect to the outcome of the algorithm, and how to determine the samplesize needed are entangling researches until now. in this paper, an effective and efficient algorithm is given based on the pac probably approximate correct learning theory to measure and estimatesample error

    關聯規則挖掘作為數據挖掘的核心任務之一，由於其任務本身的復雜性通常需要多次整個掃描數據庫才能完成挖掘任務且頻繁模式可能產生組合爆炸，使得從原始的大規模數據集上抽取一部分樣本，在其上尋找用戶感興趣的近似規則成為目前提高演算法效率和可擴展性的一種簡單有效的現實可行方法之一。
  10. Gladiators may have fought and died to entertain others in the brutality of the roman arena but they appear to have abided by a strict code of conduct which avoided savage violence, forensic scientists say

    在殘暴的古羅馬競技場上，角鬥士們通過廝殺或犧牲來愉悅他人，然而奧地利法醫學家最近發現，這些古代角鬥士們似乎必須遵守一些相當嚴格的比賽規則，以避免出現野蠻的暴力混戰。
  11. In this paper, the approximate polygon for irregular shapes, the protruding and concave point of polygon, the direction of polygon, the area of polygon, the single, face to face, frock, combinable packing are talked

    對不規則件的多邊形近似表示、多邊形凸、凹點、多邊形方向、多邊形面積和多邊形單排、對排、雙排以及聯排的預先處理進行了探討。
  12. Thirdly, it utilizes line tracking and douglas - peucker line - simplification algorithm to realize the raster - to - vector conversion. a triangulated irregular network ( tin ) is constructed based on vector data, and dem point - array data is computed by interpolating grid on tin

    第三，使用輪廓線跟蹤演算法和dpl多邊形近似方法實現等高線數據的矢量轉換;並基於等高線矢量數據建立不規則三角網，再內插格網生成dem點陣數據。
  13. In connection with the researches carried out in our laboratory, the description is concentrated on the high accurate four - component relativistic density functional methods with relativistic effects taken into account strictly, and the two - component or scalar relativistic density functional methods with relativistic effects considered approximately, involving the zero - order regular approximation ( zora ) method and its improved variants, the singularity excluded approximate expansion ( seax ) method, and the jointed two component - scalar relativistic ( or non - relativistic ) approach applicable to the calculations of large systems locally containing heavy elements

    結合本實驗室的研究工作，重點介紹嚴格處理相對論效應的四分量相對論密度泛函計算方法和近似處理相對論效應的兩分量和標量相對論密度泛函計算方法，包括零級規則展開近似（ zora ）方法及其改進和排除奇點的近似展開（ seax ）方法，以及適合處理局部包含重元素大體系的接合兩分量標量相對論（或非相對論）計算方法。
  14. Such limit is not due to the method itself, but is due to the limits of the speed and memory of computers. at present, we mainly use the high - frequency approximate method to analyze the electrical - large size target whose shape is relatively regular

    矩量法不適于分析電大尺寸的物體，這種限制不是由於方法本身，而是碩士學位論文凡1入ster 』 5th卜515由於計算機速度與存儲能力的限制。目前主要採用高頻近似方法來研究電尺寸較大而形狀相對規則的目標。
  15. 2 a contracting state which has the same or closely related legal rules on matters governed by this convention as one or more non - contracting states may at any time declare that the convention is not to apply to contracts of sale or to their formation where the parties have their places of business in those states

    對屬于本公約范圍的事項具有與一個或一個以上非締約國相同或非常近似的法律規則的締約國，可隨時聲明本公約不適用於營業地在這些非締約國內的當事人之間的銷售合同，也不適用於這些合同的訂立。
  16. In this paper, three correlative results are given : 1 ) the average crossing number of graph with n vertices and q edges can be signified approximately by quadratic equation of q. 2 ) the average crossing number of graphs with bigger girth is greater than that with smaller girth within given vertices and edges. 3 ) the average crossing number of r - regular graphs greater than that of non - regular graphs within given vertices and edges where n is odd or r < n / 2

    並得出相關的規律： 1 ） n個頂點q條邊的單二連通分支圖的平均交叉數aac （ n ， q ）可近似地表示為q的二次多項式， 2 ）在給定頂點數n與邊數q的單二連通分支圖中圍長較大的圖的平均交叉數大於圍長較小的圖的平均交叉數， 3 ）在給定頂點數n與邊數q的單二連通分支圖中當n為奇數或r n / 2時， r正則圖的平均交叉數大於非r正則圖的平均交叉數。
  17. 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 ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  18. On the one hand, the program provided by this paper can be used to get the accurate solution, on the other hand, some approximate answer can be gotten by simplify some regular structures

    這種計算一方面可以採用本文的電算方法求出其精確解，另一方面可以對一些較規則的結構進行某些簡化，求出其近似解。
  19. 16 zaki m j, hsiao c j. charm : an efficient algorithm for closedassociation rule mining. technical report 99 - 10, computerscience dept., rensselaer polytechnic institute, oct., 1999. 17 burdick d, calimlim m, gehrke j. mafia : a maximalfrequent itemset algorithm for transactional databases

    接著，我們在多分辨分析和shannon取樣定理的啟發下，設計出了一種高效的自適應在線獲取近似關聯規則的取樣演算法：多尺度取樣演算法multi - scaling sampling ， ms 。
  20. Conf. knowledge discovery and data mining, san diego, ca, usa, aug. 1999, pp. 23 - 32. 22 vitter j s. an efficient algorithm for sequentialrandom sampling

    可以說， ms在一定程度上較好地解決了基於取樣策略的關聯規則挖掘近似演算法「取樣復雜性」難于確定的問題。
分享友人
分享到 Line

分享到臉書