提出了事务间量化关联规则的挖掘算法。
The algorithm of mining inter-transactional quantitative association rules is propose.
提出了一种基于最小完美哈希函数的关联规则的挖掘算法。
An optimized direct hashing and pruning algorithm is proposed based on minimal perfect Hash scheme.
讨论了区间值关系数据库上模糊关联规则的挖掘算法与预测方法。
Mining algorithm and prediction method of fuzzy association rules are discussed in this paper.
给出了时间序列关联规则的挖掘算法，并举例说明该算法是有效的和可行的。
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.
给出了时间序列模式和规则的挖掘算法，并举例说明该算法是有效和可行的。
The paper gives the algorithm for mining time-series pattern or rules and illustrates the...
针对此类问题，文章提出新的加权关联规则模型，并提出了完全加权关联规则的挖掘算法。
Aiming at the problem, this paper puts forward a new model of weighted association rules for solving the problem, and proposes an algorithm to discover all-weighted association rules.
对数量型属性，应用竞争聚集算法将数量型属性划分成若干个模糊集，并系统地提出加权模糊关联规则的挖掘算法。
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.
针对这种情况，提出了一种高效关联规则的挖掘算法EA，解决了在挖掘关联规则过程中如何高效挖掘满足最小置信度的关联规则问题。
Under this kind of situation, a data mining algorithm EA(efficient algorithm) is proposed, which can fast calculate the confidence in association rules, it soluted the question how to efficient mi…
第三章在普通关联规则的基础上，改进了规则的描述和评价标准，提出了动态关联规则的概念，并给出了两种动态关联规则的挖掘算法。
In Chapter 3, based on the system of general association rules, a new conception, dynamic association rule, is introduced, which improves the description and assessment of a rule.
基于数据变换法，提出使用高效数据结构即倒排文件的隐私保护关联规则挖掘算法ifb - PPARM。
Based on data-distort method, we propose privacy preserving association rules mining algorithm IFB-PPARM using efficient data structure namely inverted file.
其次，分析了数据挖掘中所使用的关联规则和序列模式，对关联规则和序列模式的各种挖掘算法进行了比较。
Secondly, it analyzed association rule and sequence mode used in the process of data mining and compared the main algorithms of association rule and sequence mode.
通过分类正确度有效处理了决策表的不一致性，采用启发式算法，挖掘出满足给定精确度的最简产生式规则知识。
We deal with the inconsistency through classification accuracy, using heuristic algorithms we can get a set of minimal productive rules satisfying the given classification accuracy.
本文的内容包括两个方面：关联规则挖掘算法研究和数据挖掘应用系统体系结构的研究。
The content of this paper includes two respects: research of data mining algorithms and the system structure of the application platform of data mining.
提出了基于云的网络安全态势预测思想和基于云的网络安全态势预测规则挖掘算法。
The thought of network security situation prediction based on cloud and an algorithm of network security situation prediction based on cloud were proposed.
设计一个算法挖掘这样的有趣规刚，它的前件和后件分别属于不同的概念类，称这种规则为类间桥。
This paper designs an algorithm for mining a kind of as- sociation rules that the antecedent and action of such a rule belong to different conceptual classes, referred to class bridges.
首次提出了利用幂集作为挖掘关联规则的工具，给出了基于幂集的关联规则挖掘算法。
This paper firstly presents a power set-based association rules mining algorithm which USES pow er set as an association rules mining tool.
给出了一个在多级概念层上交互挖掘关联规则的算法，并进行了讨论。
This article gives an algorithm on mutually mining the correlative rules among multiple conceptual layers and discusses it.
目的提出基于关系代数理论的关联规则挖掘算法。
Aim To put forward association rule mining algorithm based on relation algebra theory.
最后，讨论了生成子的性质及连接策略，并在包含索引的基础上，给出了一种宽度优先的无冗余关联规则挖掘算法。
Finally, the characteristics and connection strategies of generator are presented, and based on subsume index, a breadth-first algorithm for mining non-redundant association rule is proposed.
针对一类常见而简单的规则中有项或缺项的约束，提出了一种基于事务数据修剪的约束关联规则的快速挖掘算法。
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.
该文介绍了原关联规则的概念，证明了传统算法挖掘出的关联规则集中的任何规则，均可以由原关联规则导出，而原关联规则的数目远远小于传统算法挖掘出的关联规则数目。
This paper introduces the concepts of original association rules and proves all rules in the rules set mined by conventional mining algorithms can be generated by the original association rules.
介绍了在数据立方体上对于不同可信度的数据进行分块的方法，阐述了基于数据立方体分块的多维关联规则挖掘的算法。
This paper introduces partition method in data cube with different confidence, expatiates on multidimensional association rule data mining algorithm based on data cube partition.
通过采用二进制串表示所定义的信息粒，提出了基于粒计算的关联规则挖掘算法。
Through defining information granule with binary string, we introduce an algorithm of mining association rules based on granular computing.
提出了一种基于变精度粗糙集理论的规则挖掘算法。
A rough rules mining approach based on variable precision rough set theory is proposed in this paper.
该算法应用于某营销经理信息系统的关联规则挖掘，获得的结果表明算法是实用和有效的。
This algorithm has been applied in association rules mining in one marketing EIS and shown that it is practical and effective.
文章在分析已有并行关联规则挖掘算法的基础上，讨论了多处理器系统中影响并行关联规则挖掘算法性能的主要问题。
The current algorithms of parallel association rules mining are analyzed, and the main factors affecting the performance of the mining algorithm in the multi-processor system are discussed.
为了提高对隐私数据的保护程度和挖掘结果的准确性，提出一种有效的隐私保护分布式关联规则挖掘算法。
In order to raise the level of protection of data privacy and accuracy of the outcome of the excavation, an effective protection of the privacy of distributed algorithms Mining Association Rules Act.
提出了一种新的量化关联规则挖掘算法QAR及其增量式更新算法IUQAR。
A novel algorithm, QAR, for mining quantitative association rules and an incremental updating algorithm, IUQAR, are proposed.
提出了一种新的量化关联规则挖掘算法QAR及其增量式更新算法IUQAR。
A novel algorithm, QAR, for mining quantitative association rules and an incremental updating algorithm, IUQAR, are proposed.
应用推荐