algorithm attribute 中文意思是什麼

algorithm attribute 解釋
算術屬性
  • algorithm : n. 【數學】演算法；規則系統；演段。
  • attribute : vt. 1. 把（某事）歸因於…。2. 認為…系某人所為。n. 1. 屬性，特質。2. （人物、官職等的）標志，表徵。3. 【語法】屬性形容詞。
  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. Because the factorization attribute of logic program possess the property of uncertainty, exploring the fargoing factorizing algorithm need further study

    由於邏輯程序的可分解屬性具有不確定性，因此尋找適用范圍更廣的分解演算法有待于進一步研究。
  3. According to the research mentioned above, this paper analyzes the bbk trust model whose critical attribute is binary, and indicates its disadvantages : trust failure punishment equals to that of success, which deviates reality ; malicious recommendation and unfair phenomenon is serious ; trust value fluctuates due to simple arithmetical average algorithm and computation lasts long

    基於以上工作，分析了關鍵屬性為二元屬性的bbk信任計算模型，指出其存在的問題：信任理解與現實存在偏差?信任失敗的懲罰尺度等於成功信任尺度；存在嚴重的惡意推薦現象和不公平現象；採用簡單的算術平均計算信任值可能導致波動很大；計算時延較大。
  4. At last an entropy based attribute reduct algorithm is proposed. it is used to the attribute reduct of iris and hsv database, and the ideal results can be achieved

    並提出一種基於熵測量的屬性簡約演算法，將其用於iris數據庫和hsv數據庫的屬性簡約，得到了理想的結果。
  5. In the implementation of data classifier, we describe extraction and management of conceptual hierarchy for data, also design an automatic extraction algorithm for numeric data. in this section, we still provide the two algorithms of concept - based attribute - oriented induction and evaluating classification scheme and the visualization of classification rule. finally, the data classifier is tested in databas the results show that it is practical and its performance meet the requirement of designing

    然後，在數據分類器的實現中，論述了數據的概念層次提取和管理，並對數值型數據給出了一個自動提取概念層次演算法；同時給出了基於面向屬性歸納的分類演算法、分類模式的評價演算法和分類規則的可視化方法。
  6. Attribute is not set, the cache algorithm determines the maximum size of the cache, and the

    屬性時，緩存演算法將確定緩存的最大大小，
  7. The discussion of main parallel technologies on construction of parallel sliq algorithm is presented in this paper. the computing result of algorithm complexity of sequential and parallel algorithm indicates : when the data set is large enough, as to continuous attributes, the parallel algorithm almost get speedup value equal to the number of processors ， while as to categorical attribute the improvement of parallel algorithm is limited

    通過對串列和并行演算法時間復雜度的計算表明，當數據集充分大時，由於連續屬性的排序計算操作分散到各個處理機單元上進行，顯著降低了計算時間，從而可以得到近似於處理機個數的加速比，對于離散屬性，本并行演算法對串列演算法的性能提高有限
  8. As the problem of attribute is one of core problems in rough sets theory, this paper puts forward an improved algorithm based on genred reduction algorithm, what " s more, the improved algorithm is applied into client purchase analysis field

    屬性約簡問題是粗糙集理論的核心問題之一，本文提出了一種基於genred的最大概率因子的改進屬性約簡演算法，並將該演算法應用在市場營銷的客戶購買分析方面。
  9. Decision table algorithm based on attribute reduction

    基於屬性約簡的決策表演算法
  10. An attribute reduction algorithm based on conditional entropy

    一種基於條件熵的粗糙集屬性約簡演算法
  11. In addition, for regular grid data it presents an effective algorithm for some particularity that there are four isopoints in one grid cell and for random discrete data points it lays emphasis on triangulation. this paper firstly put forward three principles : attribute principle of adjoining isolines, attribute principle of isoregions and inclusion principle of ioslines after studying the character of isolines. the bivalue - topology algorithm based on boundary tracking is given, which is founded on the three principle and is used to fill isoregions

    另外，在這兩部分中除了對邊信息鏈表的形成過程以及基於邊信息鏈表的等值線生成做了詳細討論外，還對規則格網數據的等值線追蹤中，一個網格單元上含四個等值點的特殊情形給出了一個比較有效的演算法，並在任意離散點數據部分對平面點集的三角剖分進行了著重討論。
  12. Multi - attribute group decision - making algorithm based on group ' s ideal solution

    基於群體理想解的多屬性群決策演算法
  13. Analysis of attribute reduced algorithm based on rough set theory

    基於粗集的幾種屬性約簡演算法分析
  14. An improved attribute reduction algorithm based on rough set theory

    一種基於粗糙集的屬性約簡演算法改進
  15. An attribute reduction algorithm based on the relation matrix of rough set

    基於粗糙集相關矩陣的屬性約簡演算法
  16. An algorithm of attribute frequency reduction based on discernibility matrix

    基於可辨識矩陣的屬性頻率約簡演算法
  17. An attribute reduction algorithm based on entropy for incomplete decision table

    不完全決策表的一種信息熵屬性約簡演算法
  18. Studying the attribute reduction in incomplete information systems, a ga - based algorithm is proposed to reduce assignment with the compatibility relation taken into account

    摘要研究了不完備信息系統下的屬性約簡，基於相容關系提出一種遺傳演算法的分配約簡演算法，演算法編碼採用了二進制一維編碼形式，比較適合地表達了遺傳運算元。
  19. Using the concept of heredity knowledge and its heredity coefficient of s - rough sets, it gives the concept of variation coefficient of knowledge, presents the theorem of attribute dependence of variation coefficient and the relation theorem of heredity - variation, and puts forward the heredity mining of knowledge and its algorithm in conclusion

    摘要利用s -粗集中的遺傳知識及其遺傳系數的概念，給出了知識的變異系數的概念；提出了變異系數屬性依賴定理、遺傳變異關系定理；並給出了知識的遺傳挖掘及其演算法。
  20. By using of simulated annealing algorithm, attribute weights of hierarchy clustering model were optimized in terms of weights allocation quotas, which was used to improve the case retrieval efficiency and quality

    基於模擬退火演算法對特徵屬性的權重值進行優化，通過在相似度檢索模型中加入權值分配的指導信息，防止檢索出的相似度系數最大的事例並非最佳事例，提高了檢索的質量。
分享友人
分享到 Line

分享到臉書