approximate rule 中文意思是什麼

approximate rule 解釋
近似法則
  • approximate : vt 1 使接近。2 接近;走近。3 近似,約計。4 模擬。5 估計。vi 近於。 His income this year approxima...
  • rule : n 1 規則,規定;法則,定律;章程,規章;標準;(教會等的)教規,條例,教條;常例,慣例。2 統治,...
  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. This paper demonstrates ultimate stress increment of unbonded tendons can be composed of approximate elastic deformation along the elements and local plastic deformation by nonlinear analysis on the unbonded partially prestressed concrete continuous structures. referring to the rule of ultimate stress increment of unbonded tendons at every load case, a regression formula of ultimate stress increment of unbonded tendons based on elastic - perfectly plastic model has been presented for engineers to calculate ultimate stresses of unbonded tendons in prestressed concrete multi - span continuous structures

    考慮在各種荷載工況作用下無粘結筋極限應力增量的變化規律,並與理想的彈塑性模型相比較,最終得出以理想彈塑性模型計算各種荷載工況作用下無粘結筋極限應力增量的回歸公式,從而為預應力混凝土多跨連續結構的無粘結筋應力設計計算提供有益的參考。
  3. The approximate polynomial method was based on neuber ' s method, the cyclic stress - strain responses and neuber ' s rule were treated as probabilistic curves, and the statistic characteristic was obtained from the approximate polynomial. the method is fast and easy for engineering application

    近似的多項式擬合法在諾伯法的基礎上,將循環應力應變曲線和諾伯雙曲線視為概率曲線,通過建立近似多項式的方法,求得局部應力應變的統計特性,快速簡便,適合工程應用。
  4. A new flow rule was recommended, and it offered a new way for obtaining the approximate solution of the ultimate load with the theorem

    並建議了一種新的流動法則,對應用定理求極限荷載的近似解給出了新的解題思路。
  5. Their learning and training rules have been analyzed profoundly and their abilities to approximate arbitrary nonlinear function have been testified and compared by the simulation. a new rbf neural network has been presented which uses a raised - cosine function as activation transfer function. it provides a wider generalization in comparison with gaussian rbf neural networks by simulation as well as strong approximation ability, fast convergence, a rule to select the parameters of the networks

    本文詳細研究了兩種典型的前向神經網路( bp網路和rbf網路)的學習和訓練演算法,提出了一種新穎的基於緊支集餘弦函數的徑向基神經網路,其克服了常用的高斯型rbf神經網路雖具有緊支集但各基函數非正交的不足,其收斂速度快、網路參數選取有理論依據且相比于高斯型rbf神經網路具有更強的泛化能力,模擬驗證了其有效性。
  6. 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

    關聯規則挖掘作為數據挖掘的核心任務之一,由於其任務本身的復雜性通常需要多次整個掃描數據庫才能完成挖掘任務且頻繁模式可能產生組合爆炸,使得從原始的大規模數據集上抽取一部分樣本,在其上尋找用戶感興趣的近似規則成為目前提高演算法效率和可擴展性的一種簡單有效的現實可行方法之一。
  7. In the state - of - the - art method, there is approximate, and there are many unstable factors. so now we adopt the intelligence control, it needs many detailed jobs. we observe the positions and angles of the pendulum in order to decide the force. so that we can establish the rule sheet accurately

    所以我們採用智能控制的模糊規則,因本方法不需要精確的數學模型,因此精確度會更高,制定規則需要詳盡和完備的工作,我們通過觀察倒立擺系統位置和角度變化時,需要施加什麼樣的力,多大的力等來制定規則,這當中作了大量的工作。
  8. The water quality respond relation of input - output measurements are established by systematic theory in this paper. according to the peculiarity of hydrology and the necessity of water quality inverse problem the multi - parameter inverse problem model based on ordinary differential equation is developed. the existence and uniqueness of the solution of the ordinary differential equation about two parameters or multi - parameter are to be proved. the unstability depending on errors between monitoring data and interpolation approximate data are analyzed and demonstrated. cubic spline interpolation function, the least two multiply and positive rule method are conjoined for obtained solution of multi - parameter. the results from this algorithm indicats its efficient to the multi - parameter identification in water quality modeling

    本文應用系統理論,建立了水質多參數輸入輸出之間的響應關系;根據河流水文水質變化特點和參數反問題的需求,建立了水質常微分方程多參數反問題模型.根據常微分方程參數反問題的數學理論,作者給出了兩參數和多參數水質常微分方程反問題的解的存在性、唯一性的理論證明過程和結論;還針對水質現有監測資料的測驗誤差和插值近似計算誤差造成參數反問題的不穩定性,將三次樣條插值函數、超定方程最小二乘法和正則化演算法有機地結合使用,成功地給出了水質參數反問題的穩定化演算法.最後給出了應用計算結果
  9. 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 )分派規則,先將參加排序的工序合併成一個串列序列,然後按照同層內不存在偏序關系的原則,將其分解為若干個時間上相互銜接的層次,在每個層次內部,通過構造鄰域產生出多個可行序列,對每個可行序列進行設備配置,採用鄰域搜索演算法進行方案的尋優,保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境,通過層層遞進最終獲取全局的近似最優解。
  10. This paper explorates the method of nonlinear approximate equation root of " secant line rule " in theory, and disusses two vertexes of secant line rule and one vertex of secant line rule with two kinds of different thought methods and in order to clear some suspicions of learners, which is used as a reference

    現對「割線法」求解非線性方程近似根的方法,從理論上進行了探討,並用兩種不同的思維方式雙點割線法和單點割線法進行討論,來澄清學習者的一些疑惑,以供參考。
  11. Only small fuzzy rules ( “ if - then ” rule base ) are selected, the fnns may be applied to approximate the unknown chaotic system. using a lyapunov synthesis approach and the parameters projection algorithm, the free parameters of adaptive fnns controller can be tuned on - line

    該方法採用少量模糊規則( 「如果-則」語言規則) ,使模糊神經網路逼近系統中不確定函數;然後通過lyapunov函數法和參數投影演算法,即可在線調整模糊神經網路控制器參數。
  12. The pheromone - based parameterized probabilistic model for the aco algorithm is presented as the solution construction graph that the combinatorial optimization problem can be mapped on. based on the solution construction graph, the unified framework of the aco algorithm is presented. an iterative update procedure of the solutions distribution in the problem ' s probabilistic model is proposed, that will converge to the optimal solutions with probability one, then the minimum cross - entropy pheromone update rule is proposed to approximate the iterative update procedure by minimizing the cross - entropy distance and monte - carlo sampling

    基於解空間參數化概率分佈模型,首先提出了一個以概率1收斂于最優解的解空間概率分佈的迭代更新過程,然後提出了通過最小化不同分佈間的交互熵距離以及蒙特卡洛采樣來逼近此迭代過程的最小交互熵信息素更新規則,接著分別給出了弧模式以及結點模式信息素分佈模型下的最小交互熵等式。
分享友人