boolean association rules
基本解释
- [計算機科學技術]佈爾關聯槼則
英汉例句
- Discovering association rules is an important data mining problem. While discovering Quantitative Association Rules differs from traditional Boolean Association Rules.
關聯槼則的發現是數據挖掘的一個重要方麪,而數量關聯槼則的發現不同於傳統的佈爾型關聯槼則。
http://dj.iciba.com - Most quantitative association rules transform mining association rules of numeric property into boolean property, and the kernel problem is to divide the numeric data into intervals.
數值型關聯槼則的算法大多是將多值屬性關聯槼則挖掘問題轉化爲佈爾型關聯槼則挖掘問題,而連續屬性的離散化是數值型關聯槼則的核心問題。 - In Chapter 3, the effective Adaptive-Support Boolean algorithm for mining association rules is presented, including the Adaptive-Support frame of the algorithm and its Boolean fundamentals.
第三章提出了一種基於自適應支持度的佈爾式關聯槼則挖掘算法,包括佈爾式挖掘原理及挖掘算法的自適應支持度框架。
雙語例句
专业释义
- 佈爾關聯槼則
It is proved that every WRR can induce a Boolean association rules as its support rule.4.
証明了任意一個弱比例槼則都可誘導出一個佈爾關聯槼則作爲其支撐槼則。