提高老采区资源回采率的若干途径

云应盐矿区通过新旧盐井更替、改造井身结构、完善分采工艺等技术措施，提高了老采区的资源回收率，实现了对老采区的挖潜改造。     

提高炮采工作面块煤率的爆破技术

通过小规模爆破试验，用线性回归方法对块煤进行筛分分析，指出影响炮采工作面块煤率的因素是炸药性能、装药结构、爆破参数、起爆顺序、时间间隔等。     

An efficient algorithm for mining frequent inter-transaction patterns

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.     

Development of materials database system for cae system of heat treatment based on data mining technology

Computer simulation for materials processing needs of materials. In order to employ the accumulated large data on a huge database containing a great deal of various physical properties materials heat treatment in the past years, it is significant to develop an intelligent database system. Based on the data mining technology for data analysis, an intelligent database web tool system of computer simulation for heat treatment process named as IndBASEweb-HT was built up. The architecture and the arithmetic of this system as well as its application were introduced.     

Adherence clustering: an efficient method for mining market-basket clusters

We explore in this paper the efficient clustering of market-basket data. Different from those of the traditional data, the features of market-basket data are known to be of high dimensionality and sparsity. Without explicitly considering the presence of the taxonomy, most prior efforts on clustering market-basket data can be viewed as dealing with items in the leaf level of the taxonomy tree. Clustering transactions across different levels of the taxonomy is of great importance for marketing strategies as well as for the result representation of the clustering techniques for market-basket data. In view of the features of market-basket data, we devise in this paper a novel measurement, called the category-based adherence, and utilize this measurement to perform the clustering. With this category-based adherence measurement, we develop an efficient clustering algorithm, called algorithm k-todes, for market-basket data with the objective to minimize the category-based adherence. The distance of an item to a given cluster is defined as the number of links between this item and its nearest tode. The category-based adherence of a transaction to a cluster is then defined as the average distance of the items in this transaction to that cluster. A validation model based on information gain is also devised to assess the quality of clustering for market-basket data. As validated by both real and synthetic datasets, it is shown by our experimental results, with the taxonomy information, algorithm k-todes devised in this paper significantly outperforms the prior works in both the execution efficiency and the clustering quality as measured by information gain, indicating the usefulness of category-based adherence in market-basket data clustering.     

基于Sql Server BI平台和决策树技术的CET-4成绩分析

文章首先对Sql Server 2008商业智能平台及决策树技术相关理论作了介绍,然后对挖掘数据源数据进行了一系列预处理。利用Sql Server 2008商业智能平台下的决策树技术并采用数据挖掘扩展语言即DMX语言创建了CET-4成绩分析决策树模型。分类矩阵和挖掘提升图分别对该模型的评估结果表明了模型具有较高的可靠性和分类准确度,同时模型对应的一些规则可作为英语教学管理和改革的重要参考依据。     

A new algorithm for fast mining frequent itemsets using N-lists

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.     

矿井提升机常见故障分析

介绍矿井提升机的常见故障及分类。     

重症监护病房紧急状况预警算法

重症监护病房中的病人身体状况通常很不稳定,常出现各种需要医护人员介入治疗的紧急状况。由于医疗资源有限,医护人员可能无法及时发现并处理这些紧急状况,给病人的存活率带来严重的负面影响。如果可以预测这些紧急状况的发生,并及时通知相关医护人员,将大大提高病人的存活率。常见重症监护病房紧急状况包括突然死亡、败血症、肺部感染、急性低血压、以及器官衰竭等。紧急状况预警建模主要采用病人的长时间生命体征监测数据,预测在一定时间之后发生某种紧急状况的可能性。预警模型所采用的监测数据分为静态数据、事件数据和时间序列数据等三类。静态数据具有容易采集、但预测准确性偏低的特点。事件数据或时间序列数据、以及多种类型数据的混合数据对于紧急状况预警模型的预测性能的提高有重要作用,将会获得更广泛的应用。     

数据挖掘技术在学校管理中的应用

数据挖掘技术是一门多学科相互交叉融合而形成的新兴学科。目前,该技术已在商业、金融业、农业、互联网、医药业等多个领域中得到广泛应用。而将数据挖掘技术与学校管理相结合,可以从大量事务管理数据中提取出了隐藏在其中的有用信息,因此可以帮助教学人员合理安排教学工作,协助辅导员对学生的管理,从而促进教育体制的进一步完善与发展。本文由数据挖掘技术概述入手,论述了数据挖掘技术在学校管理中的作用,最后,将数据挖掘技术应用在学生成绩管理中,可以实现透过现象看本质,提炼有价值的信息。