Non-redundant association rules mining algorithm is proposed to deal with the problem of huge rules' number and redundancy.
针对关联规则数量巨大并且存在极大冗余的问题，提出无冗余告警关联规则产生算法。
This paper firstly presents a power set-based association rules mining algorithm which USES pow er set as an association rules mining tool.
首次提出了利用幂集作为挖掘关联规则的工具，给出了基于幂集的关联规则挖掘算法。
Based on data-distort method, we propose privacy preserving association rules mining algorithm IFB-PPARM using efficient data structure namely inverted file.
基于数据变换法，提出使用高效数据结构即倒排文件的隐私保护关联规则挖掘算法ifb - PPARM。
This algorithm first produces frequent items using previous common association rules mining algorithm, then produces weighted frequent items from the previous frequent items.
该算法首先利用普通的关联规则算法产生频繁集，然后在该频繁集的基础上产生加权频繁集。
This paper presents a multi-level association rules mining algorithm DMARM which can be used in distributed environments. It can apply different thresholds at different levels.
提出了在分布式环境下对于每一层使用不同支持度的多层关联规则挖掘问题及其算法DMARM。
The way of generating frequent candidate a nd pruning technology are difficult technical problem when prenest traditional association rules mining algorithm is used to spatial data mining.
现有的传统关联规则挖掘算法构建频繁候选项的方式和修剪技术是其应用于空间数据挖掘的技术难题。
This paper also discusses how to set the optimal minimum support for the common association rules mining algorithm, which can guarantee the frequent items are the weighted frequent items' superset.
同时，给出了最优的最小支持度设定方法，保证了普通关联规则算法所产生的频繁集为加权频繁集的超集。
The typical Mining Association Rules algorithm is by R.
典型的关联规则发现算法是由R。
Through defining information granule with binary string, we introduce an algorithm of mining association rules based on granular computing.
通过采用二进制串表示所定义的信息粒，提出了基于粒计算的关联规则挖掘算法。
And examples of the algorithm is an effective method for mining association rules.
并用实例说明该算法是一种有效的关联规则挖掘方法。
According to the basic pattern of sales based on Internet and the attribute of mix marketing strategy dug out, this paper proposes a new algorithm of mining association rules based on constraints.
针对目前我国网络销售的基本模式，在已发现的组合营销策略特点的基础上，提出了一种基于约束的关联规则挖掘新算法。
This algorithm has been applied in association rules mining in one marketing EIS and shown that it is practical and effective.
该算法应用于某营销经理信息系统的关联规则挖掘，获得的结果表明算法是实用和有效的。
Mining algorithm and prediction method of fuzzy association rules are discussed in this paper.
讨论了区间值关系数据库上模糊关联规则的挖掘算法与预测方法。
The algorithm of mining inter-transactional quantitative association rules is propose.
提出了事务间量化关联规则的挖掘算法。
As for quantitative attributes, they are divided into several fuzzy sets by the competitive agglomeration algorithm, and then the algorithm for mining weighted fuzzy association rules is provided.
对数量型属性，应用竞争聚集算法将数量型属性划分成若干个模糊集，并系统地提出加权模糊关联规则的挖掘算法。
This paper applies distributed data mining algorithm to IDS, takes some research on distributed pattern extraction which is based on distributed association rules algorithm.
论文把分布式数据挖掘算法运用于入侵检测系统，研究了基于分布式关联规则算法的分布式模式提取。
A novel algorithm, QAR, for mining quantitative association rules and an incremental updating algorithm, IUQAR, are proposed.
提出了一种新的量化关联规则挖掘算法QAR及其增量式更新算法IUQAR。
Mining association rules with ontological information bases on built domain ontology, using an algorithm of data mining, to produce semantic association rules which are more greatly satisfying users.
基于本体的关联规则挖掘，是利用构建好的领域本体，结合数据挖掘算法，产生出具有语义的更符合用户需求的关联规则。
Defining interestingness and putting forward new algorithm of mining association rules including negative items.
定义兴趣度，提出挖掘含负属性项关联规则算法。
The key idea of mining association rules for the basket data is studied and several methods to improve algorithm efficiency and rules selection are given.
对零售业销售数据关联规则挖掘算法的关键思想进行了研究，给出了各种提高算法效率的方法以及对规则选择的方法。
By modifying, the algorithm ML_DFPT can also distribute mine of cross level association rules using cross level mining information.
并通过对ML_DFPT算法进行部分修改，使算法可根据跨层挖掘信息在特定的层间挖掘出层间关联规则。
An asynchronous algorithm APM has been proposed for mining association rules on Shared memory multi processor machine.
该文提出了在共享内存多处理机上采掘关联规则的异步算法apm。
The stress of main memory is abated, the times of scan of database are cut down, and the algorithm executes more efficient mining of association rules in time-variant database.
该算法通过分组及时舍弃挖掘过程中生成的非频繁项目集，有效降低主存压力，减少对数据库的扫描次数，能够对时变数据库进行高效地关联规则挖掘。
In this article we introduced the concepts of DW, KDD and DM, analysed the association rules algorithm and used it into mining the association rules of kinds of tax offence.
本文介绍了数据仓库、知识发现以及数据挖掘的概念，详细分析了关联规则算法，时纳税人采用的主要违法违章手段之间的关联关系进行了数据挖掘。
In allusion to this limitation, how to enhance the efficiency of mining algorithm becomes the core issue of association rules mining research.
针对这一局限性，如何提高挖掘算法的效率就成为了关联规则挖掘研究的核心问题。
The key problem in distributed association rules mining is to cluster partition in distributed environment. This paper presents an algorithm called D-CURE which is based on the principle of CURE.
在分布式关联规则挖掘中首先需要解决分布式环境下的聚类分区问题，该文基于CURE的工作原理，提出了D -CURE算法。
The algorithm for mining time-series association rules is given. Finally, an example is used as a case to illustrate the technique to be effective and feasible.
给出了时间序列关联规则的挖掘算法，并举例说明该算法是有效的和可行的。
Aiming at a familiar and simple constraint that some items must or must not present in rules, a fast clipped-transaction-based constraint association-rule mining algorithm was put forward.
针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。
Aiming at a familiar and simple constraint that some items must or must not present in rules, a fast clipped-transaction-based constraint association-rule mining algorithm was put forward.
针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。
应用推荐