2) online association rule
![点击朗读](/dictall/images/read.gif)
在线关联规则
3) qualitative association rule
![点击朗读](/dictall/images/read.gif)
定性关联规则
5) association rules with item constraints
![点击朗读](/dictall/images/read.gif)
约束性关联规则
1.
According to the characteristics of distributed databases and constraints, two algorithms for distributed mining association rules with item constraints called DMAIC and DAMICFP are developed.
针对分布式数据库和约束条件的特点,提出了2种在分布式环境下挖掘约束性关联规则的有效算法,即基于Apriori算法的DMAIC算法和基于频繁模式树的DAMICFP算法。
2.
This paper presents a new algorithm for distributed mining association rules with item constraints called DAMICFP,which is based on a new type algorithm for association rule mining,FP-growth.
在分布式环境中挖掘约束性关联规则是当前研究的热点问题之一。
3.
In this paper,we study the problem of mining association rule with it em constraints in distributed databases,and present a new algorithm for distri buted mining association rules with item constraints called DMA_IC.
该文主要研究了分布式环境中挖掘约束性关联规则的问题。
6) Cyclic association rules
![点击朗读](/dictall/images/read.gif)
周期性关联规则
1.
To overcome the limitation of existing models,the paper proposes a new model of cyclic association rules which can discover cyclic association rules more precisely by dividing a cycle into several time segments of possibly different lengths through clustering analysis.
针对已有周期性关联规则模型的局限性 ,本文提出一种新的周期性关联规则模型。
补充资料:Gilliland关联
分子式:
CAS号:
性质:1940年E. R. Gilliland以50组二元及多元蒸馏的逐板计算结果为基础,提出精馏塔中回流比与分离所需理论塔板数的关联。在此关联中,以(N-Nm)/(N+1)为纵坐标,(R-Rm)/(R+1)为横坐标作图得出一条关联曲线,N为理论塔板数;Nm为最小理论塔板数;R为回流比L/D,L为塔内回流量,mol;D为塔顶产品量,mol;Rm为最小回流比。1972年V. K. Mdokanov等人曾将此关联曲线近似的用下式表示: 其中
CAS号:
性质:1940年E. R. Gilliland以50组二元及多元蒸馏的逐板计算结果为基础,提出精馏塔中回流比与分离所需理论塔板数的关联。在此关联中,以(N-Nm)/(N+1)为纵坐标,(R-Rm)/(R+1)为横坐标作图得出一条关联曲线,N为理论塔板数;Nm为最小理论塔板数;R为回流比L/D,L为塔内回流量,mol;D为塔顶产品量,mol;Rm为最小回流比。1972年V. K. Mdokanov等人曾将此关联曲线近似的用下式表示: 其中
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条