discernibility 中文意思是什麼

discernibility 解釋
解析度
  1. The problem of calculating the core attributes of a dicision table is studied, a new discernibility matrix and the computation of core is put forward in this paper, and correctness of this method is proved. this method is the same with consistent and antipathic dicision tables

    論文對目前求核方法存在的問題進行了分析，提出了一種新的可區分矩陣與求核方法，並證明了方法的正確性，該方法適用於任何決策表（相容的或不相容的） 。
  2. The rosetta c + + library is a collection of c + + classes and routines that enable discernibility - based empirical modelling and data mining

    庫是一個c + +類庫和常式集合，支持基於可識別性的經驗建模和數據挖掘。
  3. Rosetta - the rosetta c + + library is a collection of c + + classes and routines that enable discernibility - based empirical modelling and data mining

    庫是一個c + +類庫和常式集合，支持基於可識別性的經驗建模和數據挖掘。
  4. Rs theory was proposed by pawlak in 1982. the focus of rs theory is on the ambiguity caused by limited discernibility of objects in domain of discourse. fuzzy set theory was proposed by zadeh in 1965 and hinges on the notion of a membership function on the domain of discourse, assigning to each object a grade of belongingness in order to represent an imprecise concept. the combination of fuzzy sets and rough sets are a new study and is very value in fact

    粗糙集理論是波蘭數學家z . pawlak於1982年提出來的兩種處理不確定和不精確數據的理論，是通過等價關系來研究對象之間的不可分辨關系;模糊集理論是美國控制論專家zadeh於1965年提出的一種處理非精確的現象的數學工具，是利用集合的特徵函數來處理邊界的不可定義性，在模糊集合中並沒有應用對象之間不可分辨性的概念。
  5. Among the decomposed synthesis reasoning sources, the field intensities were defined by dependency and classification methods based on the concept of positive region, by discernibility matrix method based on the rate of appearance, and by mutual information, condition entropy and mutual information gain rate methods based on information theory

    在分解得到的綜合源中，基於正域的概念，用依賴度和分類質量方法定義了場強，根據屬性出現頻率， ?用差別矩陣定義了場強，並結合信息論，通過互信息、條件熵和互信息增益率定義了場強。
  6. This paper shows an improved algorithm on the basis of the revised discernibility matrix, an important basis in the rough set theory, to increase the efficiency of calculating the core

    本文提出了利用差別矩陣求解核的改進演算法，提高了核計算的運算效率。因為差別矩陣是粗糙集理論應用的重要基礎之一，對差別矩陣的改進將有利於提高數據挖掘的整體效率。
  7. An algorithm of attribute frequency reduction based on discernibility matrix

    基於可辨識矩陣的屬性頻率約簡演算法
  8. Discernibility system can be used to unify the problems of computing reduct set in information system and computing relative reduct set in decision table

    區分系統的縮減集計算統一了粗糙集合理論中信息系統的縮減集的計算問題和決策表的相對縮減集的計算問題
  9. ( 2 ) the algorithm of mining classification rules based on discernibility function, which can induct simple, general, and understandable rules

    （ 2 ）提出了基於可辨識函數的分類規則提取演算法。該演算法能挖掘出簡單、通用、易理解的決策規則。
  10. An incremental updating algorithm of the computation of a core based on the discernibility matrix

    一種基於差別矩陣的核增量式更新方法
  11. 3 ) give the reduct algorithm and improved algorithm based on discernibility matrices. 4 ) give the algorithm of rules. 5 ) in this thesis, by using rs theory in the synthesis of combinational logic function, we can get minimal expression of logic function ; if by using rs theory in the rough control of boiler, we can get rough control rules

    對於前人提出的差別矩陣和差別函數的概念和定義，將其應用於信息系統中，用差別函數得到了最小約簡，然後，通過研究差別矩陣和差別函數的構造過程，提出了對差別矩陣降階和消元的策略，實例證明是有效的，起到了化簡差別矩陣和差別函數的目的； 4
  12. A complete algorithm for attribute reduction based on discernibility matrix

    一種基於差別矩陣的屬性約簡完備演算法
  13. A new method of attribute reduction of decision table based on discernibility matrix

    一種新的基於區別矩陣的決策表屬性約簡方法
  14. 5 skowron a, rauszer c. the discernibility matrices and functions in information systems

    因此，這個演算法也是一個從屬性序集合到reduct集合的映射。
  15. Data classification of reduced attributes based on discernibility matrix and discernibility function

    基於區分矩陣和區分函數進行屬性約簡的數據分類
  16. The definitions of srs and two theorems of computing the feature weights based on discernibility matrix are presented

    給出了相似粗糙集的基本定義，以及利用該方法基於差別矩陣進行特徵權值計算的兩個定理。
  17. 5 ) by using non - order pair as the basic element, we give out the definitions of discernibility system and the indiscernibility context

    5 ）以無序偶作為基本元素，我們給出了區分系統和不可區分背景的形式化定義
  18. Reduct algorithms on discernibility matrix : the ordered attributes method. j. computer science and technology, 2001, 16 : 489 - 504

    由於通常情況下，信息系統的對象個數n遠遠大於屬性個數m ，因此這個復雜性不能被接受。
  19. The discernibility matrix is one of the most important approaches to computing positive region, reduct, core and value reduct in rough sets

    正區域reduct核以及值reduct等概念源於1982年powlak提出的rough sets 1 。
  20. Its computational complexity for positive region and reduct is o m 2 - tm n instead of o m - tm n 2 in discernibility - matrix - based approach, and is not over o n 2 for other concepts in rough sets, where m and n are the numbers of attributes and objects respectively in a given dataset also called an - it information system in rough sets

    由於reduct是給定信息系統屬性集合的一個屬性子集， reduct可以考慮為特徵選擇的一個解答，因此， reduct理論的另一個可能應用是特徵選擇。無論是情報分析還是特徵選擇，關于這些應用的一個共同要求是，有關計算reduct核以及reduct理論中其它概念的演算法效率必須高。
分享友人
分享到 Line

分享到臉書