基于集成学习的无监督离散化算法.docVIP

基于集成学习的无监督离散化算法 　　摘要：模式识别与机器学习的一些算法只能处理离散属性值，而在现实生活中的很多数据具有连续的属性值，针对数据离散化的问题提出了一种无监督的方法。首先，使用Kmeans方法将数据集进行划分得到类别信息；然后，应用有监督的离散化方法对划分后的数据离散化，重复上述过程以得到多个离散化的结果，再将这些结果进行集成；最后，将集成得到的最小子区间进行合并，这里根据数据间的邻居关系选择优先合并的维度及相邻区间。其中，通过数据间的近邻关系自动寻求子区间数目，尽可能保持其内在结构关系不变。将离散后的数据应用于聚类算法，如谱聚类算法，并对聚类后的效果进行评价。实验结果表明，该算法聚类精确度比其他4种方法平均提高约33%，表明了该算法的可行性和有效性。通过该算法得到的离散化数据可应用于一些数据挖掘算法，如ID3决策树算法。 　　关键词：无监督离散化；集成学习；分类数据；相似性；谱聚类 　　中图分类号： TP391； TP18 　　文献标志码：A 　　Abstract： Some algorithms in pattern recognition and machine learning can only deal with discrete attribute values， while in real world many data sets consist of continuous data values. An unsupervised method was proposed according to the question of discretization. First， Kmeans method was employed to partition the data set into multiple subgroups to acquire label information， and then a supervised discretization algorithm was applied to the divided data set. When the process was repeatedly executed， multiple discrete results were obtained. These results were then integrated with an ensemble technique. Finally， the minimum subintervals were merged after priority dimensions and adjacent intervals were determined according to the neighbor relationship of data， where the number of subintervals was automatically estimated by preserving the correlation so that the intrinsic structure of the data set was maintained. The experimental results of applying categorical clustering algorithms such as spectral clustering demonstrate the feasibility and effectiveness of the proposed method. For example， its clustering accuracy improves by about 33% on average than other four methods. Discrete data attained can be used for some data mining algorithm， such as ID3 decision tree algorithm. 　　Key words： unsupervised discretization； ensemble learning； categorical data； similarity； spectral clustering 　　0引言 　　现实世界的数据很多都是呈连续属性，但是大部分机器学习算法（如决策树算法），只适合处理离散属性值。为了能够很好地应用这些算法，需要对连续属性值的数据进行离散化处理，使其转变为离散属性。因此，离散化是一种重要的预处理技术，尤其在频繁项集发现应用中很重要[1]，离散化是指将数值的值域划