基于决策树的流量分类方法

近年来,利用机器学习方法处理流量分类问题已成为网络测量领域一个新兴的研究方向。在目前研究中应用较多的是朴素贝叶斯方法及其改进算法,但这些基于贝叶斯定理的分类方法过于依赖样本空间的分布,具有潜在的不稳定性。为此,引入C4.5决策树方法来处理流量分类问题。C4.5决策树方法利用信息熵来构建分类模型,无须假设先验概率的稳定。实验结果表明C4.5决策树方法可以有效避免网络流分布变化所带来的影响。     

Texture-based analysis of clustered microcalcifications detected on mammograms

The need for early detection of breast cancer has led to establishing screening programs that generate large volumes of mammograms to be analyzed. These analysis are time consuming and labor intensive. Computerized analysis of mammograms has been suggested as “second opinion” or “pre-reader”.In this paper, we suggest a texture-based computerized analysis clusters of microcalcifications detected on mammograms in order to classify them into benign and malignant types.The test of the proposed system yielded a sensitivity of 100%, a specificity of 87.77% and a good classification rate of 89%; the area under the fitted ROC-curve using the MedCalc Statistical Software was 0.968.     

Few-shot decision tree for diagnosis of ultrasound breast tumor using BI-RADS features

Multimedia Tools and Applications - This paper proposes an ultrasound breast tumor CAD system based on BI-RADS features scoring and decision tree algorithm. Because of the difficulty of biopsy...     

Associative classification of mammograms using weighted rules

In this paper, we present a novel method for the classification of mammograms using a unique weighted association rule based classifier. Images are preprocessed to reveal regions of interest. Texture components are extracted from segmented parts of the image and discretized for rule discovery. Association rules are derived between various texture components extracted from segments of images and employed for classification based on their intra- and inter-class dependencies. These rules are then employed for the classification of a commonly used mammography dataset, and rigorous experimentation is performed to evaluate the rules’ efficacy under different classification scenarios. The experimental results show that this method works well for such datasets, incurring accuracies as high as 89%, which surpasses the accuracy rates of other rule based classification techniques.     

Combining decision tree and Naive Bayes for classification

Decision tree is useful to obtain a proper set of rules from a large amount of instances. However, it has difficulty in obtaining the relationship between continuous-valued data points. We propose in this paper a novel algorithm, Self-adaptive NBTree, which induces a hybrid of decision tree and Naive Bayes. The Bayes measure, which is used to construct decision tree, can directly handle continuous attributes and automatically find the most appropriate boundaries for discretization and the number of intervals. The Naive Bayes node helps to solve overgeneralization and overspecialization problems which are often seen in decision tree. Experimental results on a variety of natural domains indicate that Self-adaptive NBTree has clear advantages with respect to the generalization ability.     

Cost-sensitive decision tree ensembles for effective imbalanced classification

Real-life datasets are often imbalanced, that is, there are significantly more training samples available for some classes than for others, and consequently the conventional aim of reducing overall classification accuracy is not appropriate when dealing with such problems. Various approaches have been introduced in the literature to deal with imbalanced datasets, and are typically based on oversampling, undersampling or cost-sensitive classification. In this paper, we introduce an effective ensemble of cost-sensitive decision trees for imbalanced classification. Base classifiers are constructed according to a given cost matrix, but are trained on random feature subspaces to ensure sufficient diversity of the ensemble members. We employ an evolutionary algorithm for simultaneous classifier selection and assignment of committee member weights for the fusion process. Our proposed algorithm is evaluated on a variety of benchmark datasets, and is confirmed to lead to improved recognition of the minority class, to be capable of outperforming other state-of-the-art algorithms, and hence to represent a useful and effective approach for dealing with imbalanced datasets.     

一种改进的决策树分类属性选择方法

分析了ID3算法的基本原理、实现步骤及现有两种改进分类算法的优缺点,针对ID3算法的取值偏向问题和现有两种改进算法在分类时间、分类精确度方面存在的不足,提出了一种新的分类属性选择方案,并利用数学知识对其进行了优化。经实验证明,优化后的方案克服了ID3算法的取值偏向问题,同时在分类时间及分类精确度方面优于ID3算法及现有两种改进的分类算法。     

A pairwise decision tree framework for hyperspectral classification

A novel pairwise decision tree (PDT) framework is proposed for hyperspectral classification, where no partitions and clustering are needed and the original C‐class problem is divided into a set of two‐class problems. The top of the tree includes all original classes. Each internal node consists of either a set of class pairs or a set of class pairs and a single class. The pairs are selected by the proposed sequential forward selection (SFS) or sequential backward selection (SBS) algorithms. The current node is divided into next‐stage nodes by excluding either class of each selected pair. In the classification, an unlabelled pixel is recursively classified into the next node, by excluding the less similar class of each node pair until the classification result is obtained. Compared to the single‐stage classifier approach, the pairwise classifier framework and the binary hierarchical classifier (BHC), experiments on an Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) data set for a nine‐class problem demonstrated the effectiveness of the proposed framework.     

不确定数据的决策树分类算法

经典决策树算法不能处理树构建和分类过程中的不确定数据。针对这一局限,将可用于不确定数据表达的证据理论与决策树分类算法相结合,把决策树分类技术扩展到含有不确定数据的环境中。为避免在决策树构建过程中出现组合爆炸问题,引入新的测量算子和聚集算子,提出了D-S证据理论决策树分类算法。实验结果表明,D-S证据理论决策树分类算法能有效地对不确定数据进行分类,有较好的分类准确度,并能有效避免组合爆炸。     

Feature selection and classification using support vector machine and decision tree

Breast cancer is one of the human threats which cause morbidity and mortality worldwide. The death rate can be reduced by advanced diagnosis. The objective of this article is to select the reduced number of features the help in diagnosing breast cancer in Wisconsin Diagnostic Breast Cancer (WDBC). This proposed model depicts women who all have no cancer cells or in benign stage later develop into malignant (metastases). Due to the dynamic nature of the big data framework, the proposed method ensures high confidence and low execution time. Moreover, healthcare information growth chases an exponential pattern, and current database systems cannot adequately manage the massive amount of data. So, it is requisite to adopt the “big data” solution for healthcare information.     

A CBR-based fuzzy decision tree approach for database classification

Database classification suffers from two well-known difficulties, i.e., the high dimensionality and non-stationary variations within the large historic data. This paper presents a hybrid classification model by integrating a case-based reasoning technique, a fuzzy decision tree (FDT), and genetic algorithms (GAs) to construct a decision-making system for data classification in various database applications. The model is major based on the idea that the historic database can be transformed into a smaller case base together with a group of fuzzy decision rules. As a result, the model can be more accurately respond to the current data under classifying from the inductions by these smaller case-based fuzzy decision trees. Hit rate is applied as a performance measure and the effectiveness of our proposed model is demonstrated experimentally compared with other approaches on different database classification applications. The average hit rate of our proposed model is the highest among others.     

A decision tree framework for shot classification of field sports videos

The Journal of Supercomputing - Automated approaches to analyze sports video content have been heavily explored in the last few decades to develop more informative and effective solutions for...     

基于决策树分类的可拓建筑策划预测方法

为提升建筑师在策划过程中科学预测的能力,提出了一种基于决策树分类的可拓建筑策划预测方法。首先,运用数据采集软件批量采集互联网中的建筑案例数据,将数据预处理后存储至建筑案例库中;其次,通过评价特征选取、评价信息元集生成、决策树构建等步骤,获得决策树模型;最后,运用该模型预测当前策划项目的性能指标是否满足要求,并给出不满足要求情况下性能指标变换的途径。案例检验表明,该方法能有效提高建筑师运用互联网数据的能力,能够挖掘决策树分类知识,从而加速计算机辅助可拓建筑策划的进程。     

基于决策树分类的智能缓存模型研究

Web缓存技术是互联网提升访问性能的有效手段。构建了基于决策树的智能缓存数据挖掘模型,通过数据建模、NextAccess的离散化、构造决策树所用的观察属性集和权重,从而对数据进行缓存处理。实验证明其性能得到了优化。     

基于判定树归纳分类的土质分类定名方法

数据分类是数据挖掘领域中一个非常重要的研究课题,而判定树归纳分类是数据分类技术中最常用的方法之一,应用广泛.工程建设需要对工程用土进行分类定名,在土工试验中土的分类定名相当烦琐,而且土的用途或工程性质不同适用分类标准也不同,手工进行土质分类定名容易出错.将判定树归纳分类法应用于土质分类定名工作,介绍了判定树归纳算法,根据最高信息增益构建土质分类的预测模型,并给出了具体的数据分类实例.     

A novel image mining technique for classification of mammograms using hybrid feature selection

The image mining technique deals with the extraction of implicit knowledge and image with data relationship or other patterns not explicitly stored in the images. It is an extension of data mining to image domain. The main objective of this paper is to apply image mining in the domain such as breast mammograms to classify and detect the cancerous tissue. Mammogram image can be classified into normal, benign, and malignant class. Total of 26 features including histogram intensity features and gray-level co-occurrence matrix features are extracted from mammogram images. A hybrid approach of feature selection is proposed, which approximately reduces 75% of the features, and new decision tree is used for classification. The most interesting one is that branch and bound algorithm that is used for feature selection provides the best optimal features and no where it is applied or used for gray-level co-occurrence matrix feature selection from mammogram. Experiments have been taken for a data set of 300 images taken from MIAS of different types with the aim of improving the accuracy by generating minimum number of rules to cover more patterns. The accuracy obtained by this method is approximately 97.7%, which is highly encouraging.     

A classification algorithm based on the complete decision tree

Application of decision trees in problems of classification by precedents is considered. A new model of classifier (which is called the complete decision tree) is proposed and compared with other recognition algorithms based on constructing decision trees. Elena V. Djukova born 1945. Graduated from Moscow State University in 1967. Candidate’s degree in Physics and Mathematics in 1979. Doctoral degree in Physics and Mathematics in 1997. Dorodnicyn Computing Center, Russian Academy of Sciences, leading researcher. Moscow State University, lecturer. Moscow Pedagogical University, lecturer. Scientific interests: discrete mathematics and mathematical methods of pattern recognition. Author of 76 papers. Nikolai V. Peskov born 1978. Graduated from Moscow State University in 2000. Candidate’s degree in Physics and Mathematics in 2004. Dorodnicyn Computing Center, Russian Academy of Sciences, junior researcher. Scientific interests: discrete mathematics and mathematical methods of pattern recognition. Author of seventeen papers.     

Mass classification method in mammograms using correlated association rule mining

In this paper, we present an efficient computer-aided mass classification method in digitized mammograms using Association rule mining, which performs benign–malignant classification on region of interest that contains mass. One of the major mammographic characteristics for mass classification is texture. Association rule mining (ARM) exploits this important factor to classify the mass into benign or malignant. The statistical textural features used in characterizing the masses are mean, standard deviation, entropy, skewness, kurtosis and uniformity. The main aim of the method is to increase the effectiveness and efficiency of the classification process in an objective manner to reduce the numbers of false-positive of malignancies. Correlated association rule mining was proposed for classifying the marked regions into benign and malignant and 98.6% sensitivity and 97.4% specificity is achieved that is very much promising compare to the radiologist’s sensitivity 75%.     

Investigation of wave atom transform by using the classification of mammograms

This paper presents an approach for breast cancer diagnosis in digital mammograms using wave atom transform. Wave atom is a recent member of the multi-resolution representation methods. Primarily, the mammogram images are decomposed on the basis of wave atoms, and then a special set of the biggest coefficients from wave atom transform is used as a feature vector. Two different classifiers, support vector machine and k-nearest neighbors, are employed to classify mammograms. The method is tested using two different sets of images provided by MIAS and DDSM database.