查询词典 data mining

Since any frequent itemset is a subset of a maximal frequent itemset (an itemset is maximal frequent if it has no superset that is frequent), this paper proposes the DMFI (Discovery of Maximal Frequent Itemsets) algorithm for mining all the maximal frequent itemsets from data sets. This algorithm searches the maximal frequent itemsets in data sets from both bottom-up and top-down directions in the meantime. This paper proposes an algorithm that evaluates the boundaries on the support and confidence of uncalculated itemsets by exploiting the information provided by the calculated itemsets.

本文在经典关联规则的基础上，提出了一系列扩展的关联规则开采算法：发现关联规则的难度体现在发现频繁项目集上，事实上最大频繁项目集（其所有的超集都为非频繁项目集的频繁项目集）的集合已经包含了所有的频繁项目集，本文提出一种发现最大频繁项目集的算法DMFI(Discovery Maximal Frequent Itemsets)，该算法采用自底向上和自顶向下相结合的搜索策略对数据空间进行有效的搜索。

Mines useful and unobvious information from the vast data stored in employment management information system by data mining.

对于高校就业管理信息系统中积累的大量数据，运用数据挖掘算法中的决策树方法挖掘出潜在的有用的信息，为高校开展就业工作提供决策支持。

Information Warehousing: basic concepts of data warehousing and data mining system design, development and application.

信息仓储：基本概念数据仓库和数据挖掘系统设计，开发和应用。

The rise and development of data mining technology and data warehouse solution provides the practical application academic gist and technological support, and brings new turning point to the synthetic application of Waybill information at the same time.

数据挖掘技术与数据仓库解决方案的兴起与迅速发展，为海量数据的实际应用提供了理论依据与技术支持，为货票信息的综合应用带来了新的契机。

This is a weka data mining based on the experimental data sets format. Arff. which contains terms and numerical ...

这是一个基于weka数据挖掘的实验测试数据集，格式为。arff，里面包含有名词性和数值型的数据集，用于weka挖掘测试。

Travel information and control project ;data mining; highway charge data; related rule; weka software

交通信息工程及控制；数据挖掘；高速公路；关联规则；Weka软件

Data mining is to extract some people interested, potential and useful knowledge from the data, and to present them in some apprehensible forms.

数据挖掘是从数据中提取人们感喜好的、潜伏的、可用的知识，并表示成用户可理解的形式。

This is the implementation of Apriori Algorithm used in Data Warehouse and Data Mining filed, based on the Relation Database.

这是关于数据仓库与数据挖掘的Apriori算法的实现程序，基于关系型数据库的。

The algorithm needn't generate candidate itemsets and scan database, because it employs FP-Tree to store trasanctions in database compressedly and takes full advantage of the characteristic of FP-Tree.Consequently,the complexity of space and time the algorithm used is reduced obviously in the procedure of data mining.In a thorough experimental analysis of our algorithm on real and synthetic data,we isolate the effect of the individual components of the algorithm. Our performance numbers show that MFP-Miner outperforms previous work.

该算法利用频繁模式树来压缩存储数据库中的事务，并充分利用频繁模式树的特点，在挖掘最大频繁项目集的过程中不需要产生候选项目集和扫描数据库，从而减少了算法在挖掘过程中使用的存储空间和计算时间，通过实验结果显示，该算法的性能优于同类算法。

Based on the structural machine learning, a probability decisional data-mining algorithm is proposed by composing relative rules of multi data sources that are built in quotient on topological.

第三是如何减少所得到的覆盖领域的数目，为此引入了重复覆盖方法RCA和去除覆盖领域过小的方法，这有利于提高网络的泛化能力。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。