Mixed Types Of Attributes Research Articles

A composite entropy-based uncertainty measure guided attribute reduction for imbalanced mixed-type data

In real-world scenarios, datasets generally exhibit containing mixed-type of attributes and imbalanced classes distribution, and the minority classes in the data are the primary research focus. Attribute reduction is a key step in the data preprocessing process, but traditional attribute reduction methods commonly overlook the significance of minority class samples, causing the critical information possessed in minority class samples to damage and decrease the performance of classification. In order to address this issue, we develop an attribute reduction algorithm based on a composite entropy-based uncertainty measure to handle imbalanced mixed-type data. To begin with, we design a novel oversampling method based on the three-way decisions boundary region to synthesize the samples of minority class, for the boundary region to contain more high-quality samples. Then, we propose an attribute measure to select candidate attributes, which considers the boundary entropy, degree of dependency and weight of classes. On this basis, a composite entropy-based uncertainty measure guided attribute reduction algorithm is developed to select the attribute subset for the imbalanced mixed-type data. Experimental on UCI imbalanced datasets, as well as the results indicate that the developed attribute reduction algorithm is significantly outperforms compared to other attribute reduction algorithms, especially in total AUC, F1-Score and G-Mean.

Map Reduce based REmoving Dependency on K and Initial Centroid Selection MR-REDIC Algorithm for clustering of Mixed Data

In machine learning, clustering is recognized as widely used task to find hidden structure of data. While handling the massive amount of data, the traditional clustering algorithm degrades in performance due to size and mixed type of at-tributes. The Removal Dependency on K and Initial Centroid Selection (REDIC) algorithm is designed to handle mixed data with frequency based dissimilarity measurement for categorical attributes. The selection of initial centroids and prior decision for number of cluster improves the efficiency of REDIC algorithm. To deal with the large scale data, the REDIC algorithm is migrated to Map Reduce paradigm,and Map Reduce based REDIC( MR-REDIC) algorithm is proposed. The large amount of data is divided into small chunks and parallel approach is used to reduce the execution time of algorithm.The proposed algorithm inherits the feature of REDIC algorithm to cluster the data.The algorithm is implemented in Hadoop environment with three different configuration and evaluated using five bench mark data sets. Experimental results show that the Speed up value of data is gradually shifting towards linear by increasing number of data nodes from one to four. The algorithm also achieves the near to closer value for Scale up parameter, while maintaining the accuracy of algorithm.

One-pass MapReduce-based clustering method for mixed large scale data

Big data is often characterized by a huge volume and a mixed types of attributes namely, numeric and categorical. K-prototypes has been fitted into MapReduce framework and hence it has become a solution for clustering mixed large scale data. However, k-prototypes requires computing all distances between each of the cluster centers and the data points. Many of these distance computations are redundant, because data points usually stay in the same cluster after first few iterations. Also, k-prototypes is not suitable for running within MapReduce framework: the iterative nature of k-prototypes cannot be modeled through MapReduce since at each iteration of k-prototypes, the whole data set must be read and written to disks and this results a high input/output (I/O) operations. To deal with these issues, we propose a new one-pass accelerated MapReduce-based k-prototypes clustering method for mixed large scale data. The proposed method reads and writes data only once which reduces largely the I/O operations compared to existing MapReduce implementation of k-prototypes. Furthermore, the proposed method is based on a pruning strategy to accelerate the clustering process by reducing the redundant distance computations between cluster centers and data points. Experiments performed on simulated and real data sets show that the proposed method is scalable and improves the efficiency of the existing k-prototypes methods.

Design of Intrusion Detection System using Fuzzy Class-Association Rule Mining based on Genetic Algorithm

Now security is considered as a major issue in networks, since the network has extended dramatically. Therefore, intrusion detection systems have attracted attention, as it has an ability to detect intrusion accesses effectively. These systems identify attacks and react by generating alerts or by blocking the unwanted data/traffic. The proposed system includes fuzzy logic with a data mining method which is a class-association rule mining method based on genetic algorithm. Due to the use of fuzzy logic, the proposed system can deal with mixed type of attributes and also avoid the sharp boundary problem. Genetic algorithm is used to extract many rules which are required for anomaly detection systems. An association-rulemining method is used to extract a sufficient number of important rules for the user’s purpose rather than to extract all the rules meeting the criteria which are useful for misuse detection. Experimental results with KDD99 Cup database from MIT Lincoln Laboratory show that the proposed method provides competitively high detection rates compared with crisp data mining.

Scalable algorithms for clustering large datasets with mixed type attributes

Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes. However, datasets with mixed types of attributes are common in real life data mining applications. In this article, we present two algorithms that extend the Squeezer algorithm to domains with mixed numeric and categorical attributes. The performance of the two algorithms has been studied on real and artificially generated datasets. Comparisons with other clustering algorithms illustrate the superiority of our approaches. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1077–1089, 2005.