Search

Classification is a widely used supervised learning technique that enables models to discover the relationship between a set of features and a specified label using available data. Its applications span various fields such as engineering, telecommunication, astronomy, and medicine. In this paper, we propose a novel rule-based classifier called RUCIB (RUle-based Classifier Inspired by BRADO), which draws inspiration from the socio-inspired swarm intelligence algorithm known as BRADO. RUCIB introduces two key aspects: the ability to accommodate multiple values for features within a rule and the capability to explore all data features simultaneously. To evaluate the performance of RUCIB, we conducted experiments using ten databases sourced from the UCI machine learning database repository. In terms of classification accuracy, we compared RUCIB to ten well-known classifiers. Our results demonstrate that, on average, RUCIB outperforms Naive Bayes, SVM, PART, Hoeffding Tree, C4.5, ID3, Random Forest, CORER, CN2, and RACER by 9.32%, 8.97%, 7.58%, 7.4%, 7.34%, 7.34%, 7.22%, 5.06%, 5.01%, and 1.92%, respectively. [ABSTRACT FROM AUTHOR]

Machine learning techniques aim to mimic the human ability to automatically learn how to perform tasks through training examples. They have proven capable of tasks such as prediction, learning and adaptation based on experience and can be used in virtually any scientific application, ranging from biomedical, robotic, to business decision applications, and others. However, the lack of domain knowledge for a particular application can make feature extraction ineffective or even unattainable. Furthermore, even in the presence of pre-processed datasets, the iterative process of optimizing Machine Learning parameters, which do not translate from one domain to another, maybe difficult for inexperienced practitioners. To address these issues, we present in this paper a Vectorized Automated ML Pre-processIng and post-pRocEssing framework, approximately named (VAMPIRE), which implements feature extraction algorithms capable of converting large time-series recordings into datasets. Also, it introduces a new concept, the Activation Engine, which is attached to the output of a Multi Layer Perceptron and extracts the optimal threshold to apply binary classification. Moreover, a tree-based algorithm is used to achieve multi-class classification using the Activation Engine. Furthermore, the internet of things gives rise to new applications such as remote sensing and communications, so consequently applying Machine Learning to improve operation accuracy, latency, and reliability is beneficial in such systems. Therefore, all classifications in this paper were performed on the edge in order to reach high accuracy with limited resources. Moreover, forecasts were applied on three unrelated biomedical datasets, and on two other pre-processed urban and activity detection datasets. Features were extracted when required, and training and testing were performed on the Raspberry Pi remotely, where high accuracy and inference speed were achieved in every experiment. Additionally, the board remained competitive in terms of power consumption when compared with a laptop which was optimized using a Graphical Processing Unit. [ABSTRACT FROM AUTHOR]

Clustering and classification-based pattern recognition techniques are widely used in various domains. While many approaches exist to perform these tasks, it remains a difficult process to perform clustering and classification simultaneously for particular datasets. In this paper, a method based on k-nearest neighbor (KNN) is presented to classify the dataset with PSO optimized k-medoids clustering. Initial clustering with k-medoids algorithm divides the dataset into smaller and disjoint clusters featuring similarity within clusters and dissimilarity with members of other clusters. Particle swarm optimization (PSO) is an evolutionary algorithm mainly used to optimize the issues in several research areas including data analytics. The fitness function of the PSO approach mentioned in this paper is based on inertia weights that identify the particles with the best positions and velocities for optimization. Additionally, PSO uses a novel elitism concept that allows massive searching capability between the swarm of particles to achieve a better convergence rate. Because of this property, it can be applied throughout different machine learning fields. Moreover, the KNN classifier outperforms the classification task in terms of classifying the optimized particles with high accuracy. The performance of the proposed technique is evaluated by experimenting with datasets taken from open sources. The simulation results revealed that the performance of the proposed method is better than the existing methods in terms of effective clustering as well as accurate classification. [ABSTRACT FROM AUTHOR]

The unique properties of terahertz (THz) spectroscopy show a great potential for security and defense applications such as safe screening of persons and objects. However, a successful implementation of THz screening systems requires a development of reliable and efficient identification algorithms. Dimensionality reduction (DR) methods aim to reduce the dimensionality of the multivariate data and are therefore commonly used as a preprocessing step for classification algorithms and as an analytical tool allowing data visualization. In this paper, we compare the use of unsupervised and supervised DR methods for analysis and classification of THz reflection spectra based on their most widespread linear representatives, namely principal component analysis and linear discriminant analysis, respectively. To this end, both methods were applied to more than 5000 THz reflection spectra acquired from six active materials mixed at three different concentrations with polyethylene and measured at various humidity conditions. While considering scenarios with different levels of complexity, we found that the supervised approach provides better results because it enables efficient grouping despite intra-class variability. Furthermore, we showed that manipulating labels introduced into the supervised DR algorithm allows conditioning the data for a desired classification task such as security screening. Presented classification results show that simple machine learning algorithms are sufficient for highly accurate classification (>98.6%) of THz spectra, which will be suitable for many real-life applications of THz spectroscopy based on material identification. [ABSTRACT FROM AUTHOR]

Feature selection is one of the main steps in preprocessing data in machine learning, and its goal is to reduce features by removing additional and noisy features. Feature selection methods and feature reduction in a dataset must consider the accuracy of the classifying algorithms. Meta-heuristic algorithms serve as the most successful and promising methods to solve this problem. Symbiotic Organisms Search (SOS) is one of the most successful meta-heuristic algorithms inspired by organisms' interaction in nature called mutualism, commensalism, and parasitism. In this paper, three SOS-based binary approaches are offered to solve the feature selection problem. In the first and second approaches, several S-shaped transfer functions and several Chaotic Tent Function-based V-shaped transfer functions called BSOSST and BSOSVT are used to make the binary SOS (BSOS). In the third approach, an advanced BSOS based on changing SOS and the chaotic Tent function operators called EBCSOS is provided. The EBCSOS algorithm uses the chaotic Tent function and the Gaussian mutation to increase usefulness and exploration. Moreover, two new operators, i.e., BMPT and BCPT, are suggested to make the commensalism and mutualism stage binary based on a chaotic function to solve the feature selection problem. Finally, the proposed BSOSST and BSOSVT methods and the advanced version of EBCSOS were implemented on 25 datasets than the basic algorithm's binary meta-heuristic algorithms. Various experiments demonstrated that the proposed EBCSOS algorithm outperformed other methods in terms of several features and accuracy. To further confirm the proposed EBCSOS algorithm, the problem of detecting spam E-mails was applied, with the results of this experiment indicating that the proposed EBCSOS algorithm significantly improved the accuracy and speed of all categories in detecting spam E-mails. [ABSTRACT FROM AUTHOR]

Classification is one of the foremost machine learning tasks in this modern era. Neural Network (NN) is one of the powerful classification techniques. NN can achieve high classification accuracy on highly imbalanced and complex datasets, but lacks in explanation of its reasoning process which limits its applicability in various domains which require transparent decision along with good accuracy. There are some techniques which extract rules from NN and make it transparent; however, attribute pruning, rule pruning and class overlap algorithms are not sufficiently effective. Therefore, this paper proposes a rule extraction algorithm, called Transparent Rule Extraction using Neural Network (TRENN) to convert NN into white box with greater emphasis on attribute pruning and rule pruning. The proposed TRENN is a pedagogical approach and an extension of one of the existing algorithms named Rule Extraction from Neural Network using Classified and Misclassified data (RxNCM). The proposed TRENN extends the RxNCM with sequential floating backward search for feature and rule selection to improve the comprehensibility of the generated rules. Besides, the proposed TRENN uses probabilistic approach for the treatment of class overlapping problem in the rule updating phase instead of reclassification used in RxNCM where the overlap may persist. Experiments are conducted with eight real datasets collected from the UCI repository. Performance of the TRENN is measured with Precision, Recall, FP-Rate, F-measure, and local and global comprehensibility. It is observed from the experimental results that TRENN performs better than Re-RX, RxNCM and RxREN. [ABSTRACT FROM AUTHOR]

In recent years, classifier ensemble techniques have drawn the attention of many researchers in the machine learning research community. The ultimate goal of these researches is to improve the accuracy of the ensemble compared to the individual classifiers. In this paper, a novel algorithm for building ensembles called dynamic programming-based ensemble design algorithm (DPED) is introduced and studied in detail. The underlying theory behind DPED is based on cooperative game theory in the first phase and applying a dynamic programming approach in the second phase. The main objective of DPED is to reduce the size of the ensemble while encouraging extra diversity in order to improve the accuracy. The performance of the DPED algorithm is compared empirically with the classical ensemble model and with a well-known algorithm called "the most diverse." The experiments were carried out with 13 datasets from UCI and three ensemble models. Each ensemble model is constructed from 15 different base classifiers. The experimental results demonstrate that DPED outperforms the classical ensembles on all datasets in terms of both accuracy and size of the ensemble. Regarding the comparison with the most diverse algorithm, the number of selected classifiers by DPED across all datasets and all domains is less than or equal to the number selected by the most diverse algorithm. Experiment on blog spam dataset, for instance, shows that DPED provides an accuracy of 96.47 compared to 93.87 obtained by the most diverse using 40% training size. Finally, the experimental results verify the reliability, stability, and effectiveness of the proposed DPED algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an optimal weight semi-supervised learning machine for a single-hidden layer feedforward network (SLFN) with time delay is developed. Both input weights and output weights of the SLFN are globally optimized with manifold regularization. By feature mapping, input vectors can be placed at the prescribed positions in the feature space in the sense that the separability of all nonlinearly separable patterns can be maximized, unlabeled data can be leveraged to improve the classification accuracy when labeled data are scarce, and a high degree of recognition accuracy can be achieved with a small number of hidden nodes in the SLFN. Some simulation examples are presented to show the excellent performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The qualities of new data used in the sequential learning phase of the online sequential extreme learning machine algorithm (OS-ELM) have a significant impact on the performance of OS-ELM. This paper proposes a novel data filter mechanism for OS-ELM from the perspective of fuzziness and a fuzziness-based online sequential extreme learning machine algorithm (FOS-ELM). In FOS-ELM, when new data arrive, a fuzzy classifier first picks out the meaningful data according to the fuzziness of each sample. Specifically, the new samples with high-output fuzziness are selected and then used in sequential learning. The experimental results on eight binary classification problems and three multiclass classification problems have shown that FOS-ELM updated by the new samples with high-output fuzziness has better generalization performance than OS-ELM. Since the unimportant data are discarded before sequential learning, FOS-ELM can save more memory and have higher computational efficiency. In addition, FOS-ELM can handle data one-by-one or chunk-by-chunk with fixed or varying sizes. The relationship between the fuzziness of new samples and the model performance is also studied in this paper, which is expected to provide some useful guidelines for improving the generalization ability of online sequential learning algorithms. [ABSTRACT FROM AUTHOR]

Due to the lack of experience and prior knowledge, the selection of the most informative features has become one of the challenging problems in many applications. Recently, many metaheuristic algorithms have widely used to solve the feature selection problem for classification tasks. In this paper, the chaotic atom search optimization (CASO) that integrates the chaotic maps into atom search optimization (ASO) is applied for wrapper feature selection. Twelve different chaotic maps are used to adjust the parameter of CASO through the optimization process, which is beneficial for enhancing the convergence rate and improving the efficiency of ASO algorithm. In this study, twenty benchmark datasets acquired from the UCI machine learning repository are used to validate the performance of CASO in feature selection. Several state-of-the-art metaheuristic algorithms are adopted to examine the efficacy and effectiveness of the proposed approach. Our results indicated that the Logistic-Tent map was the most suitable chaotic map to boost the performance of CASO. The experimental result shows the capability of CASO not only in finding the optimal solution but also in significantly improving the prediction accuracy and reducing the number of features. [ABSTRACT FROM AUTHOR]

Feature selection is one of the hottest machine learning topics in recent years. The main purposes of it are to simplify the original model, improve the readability of the model, and prevent over-fitting by searching for a suitable subset of features. There are many methods for this problem, including evolutionary algorithms and particle swarm optimization. Among them, the competitive swarm optimizer is a new optimization algorithm proposed in recent years, which is based on particle swarm optimization algorithm, and has achieved good results in high-dimensional feature selection problems, but it also has the problems of high computation time cost and easily being premature. Aiming at these problems, this paper proposes to add the crossover operator and mutation operator in the genetic algorithm to the competitive swarm optimization, so as to improve the generation speed of new individuals in the algorithm and prevent premature population. After testing on UC Irvine Machine Learning Repository, the new algorithm not only improves the computational efficiency, but also avoids the problem that the competitive swarm optimization algorithm is easy to fall into the local optimum, which greatly improves the calculation effect. [ABSTRACT FROM AUTHOR]

K-nearest neighbors (KNN) algorithm is a common algorithm used for classification, and also a sub-routine in various complicated machine learning tasks. In this paper, we presented a quantum algorithm (QKNN) for implementing this algorithm based on the metric of Hamming distance. We put forward a quantum circuit for computing Hamming distance between testing sample and each feature vector in the training set. Taking advantage of this method, we realized a good analog for classical KNN algorithm by setting a distance threshold value t to select k − n e a r e s t neighbors. As a result, QKNN achieves O( n ) performance which is only relevant to the dimension of feature vectors and high classification accuracy, outperforms Llyod's algorithm (Lloyd et al. 2013) and Wiebe's algorithm (Wiebe et al. 2014). [ABSTRACT FROM AUTHOR]

It is always wise to keep the frequently used information by various users in the cache memory. This makes the users feel that their needed information is available almost immediately. Apart from experiencing less access delay, caching process also helps in better bandwidth utilization and load reduction in the origin server. Pre-fetching is the process of fetching few of the Web pages in advance by assuming that those pages will be needed by the user in the near future. Combining pre-fetching and caching techniques results in experiencing much less access delay and much better bandwidth utilization. Many works have been reported in the literature, separately for Web caching techniques and pre-fetching of Web pages. In this paper, pre-fetching technique that uses clustering is combined with SVM (support vector machine)-LRU algorithm, a machine learning method for Web proxy caching. By using real-time data, it is demonstrated that the latter approach will be advantageous than clustering-based pre-fetching technique using traditional LRU-based caching policy. The efficiency of our proposed method is also compared with caching using Bayesian networks and neuro-fuzzy system. [ABSTRACT FROM AUTHOR]

Multi-instance learning was first proposed by Dietterich et al. (Artificial Intelligence 89(1–2):31–71, 1997 ) when they were investigating the problem of drug activity prediction. Here, the training set is composed of labeled bags, each of which consists of many unlabeled instances. And the goal of this learning framework is to learn some classifier from the training set for correctly labeling unseen bags. After Dietterich et al., many studies about this new learning framework have been started and many new algorithms have been proposed, for example, DD, EM-DD, Citation- kNN and so on. All of these algorithms are working on the full data set. But as in single-instance learning, different feature in training set has different effect on the training about classifier. In this paper, we will study the problem about feature selection in multi-instance learning. We will extend the data reliability measure and make it select the key feature in multi-instance scenario. [ABSTRACT FROM AUTHOR]

Regularized multiple criteria linear programming (RMCLP) model is a new powerful method for classification and has been used in various real-life data mining problems. In this paper, a new Multi-instance Classification method based on RMCLP was proposed (called MI-RMCLP), which includes two algorithms for linearly separable case and nonlinearly case separately. The key point of this method, instead of a mixed integer quadratic programming in MI-SVM, is that it is able to deal with multi-instance learning problem by an iterative strategy solving sequential quadratic programming problems. All experiment results have shown that MI-RMCLP method can converge to the optimal value in limited iterative steps and be a competitive method in multi-instance learning classification. [ABSTRACT FROM AUTHOR]

This paper aims to assist the administration departments of medical organisations in making the right decision on selecting a suitable multiclass classification model for acute leukaemia. In this paper, we proposed a framework that will aid these departments in evaluating, benchmarking and ranking available multiclass classification models for the selection of the best one. Medical organisations have continuously faced evaluation and benchmarking challenges in such endeavour, especially when no single model is superior. Moreover, the improper selection of multiclass classification for acute leukaemia model may be costly for medical organisations. For example, when a patient dies, one such organisation will be legally or financially sued for incidents in which the model fails to fulfil its desired outcome. With regard to evaluation and benchmarking, multiclass classification models are challenging processes due to multiple evaluation and conflicting criteria. This study structured a decision matrix (DM) based on the crossover of 2 groups of multi-evaluation criteria and 22 multiclass classification models. The matrix was then evaluated with datasets comprising 72 samples of acute leukaemia, which include 5327 gens. Subsequently, multi-criteria decision-making (MCDM) techniques are used in the benchmarking and ranking of multiclass classification models. The MCDM used techniques that include the integrated BWM and VIKOR. BWM has been applied for the weight calculations of evaluation criteria, whereas VIKOR has been used to benchmark and rank classification models. VIKOR has also been employed in two decision-making contexts: individual and group decision making and internal and external group aggregation. Results showed the following: (1) the integration of BWM and VIKOR is effective at solving the benchmarking/selection problems of multiclass classification models. (2) The ranks of classification models obtained from internal and external VIKOR group decision making were almost the same, and the best multiclass classification model based on the two was 'Bayes. Naive Byes Updateable' and the worst one was 'Trees.LMT'. (3) Among the scores of groups in the objective validation, significant differences were identified, which indicated that the ranking results of internal and external VIKOR group decision making were valid. [ABSTRACT FROM AUTHOR]

In this paper, the classification of the two binary bioinformatics datasets, leukemia and colon tumor, is further studied by using the recently developed neural network-based finite impulse response extreme learning machine (FIR-ELM). It is seen that a time series analysis of the microarray samples is first performed to determine the filtering properties of the hidden layer of the neural classifier with FIR-ELM for feature identification. The linear separability of the data patterns in the microarray datasets is then studied. For improving the robustness of the neural classifier against noise and errors, a frequency domain gene feature selection algorithm is also proposed. It is shown in the simulation results that the FIR-ELM algorithm has an excellent performance for the classification of bioinformatics data in comparison with many existing classification algorithms. [ABSTRACT FROM AUTHOR]

This paper presents a new classification method utilizing distance-based decision surface with nearest neighbor projection approach, called DDC. Kernel type of DDC has been extended to take into account the effective nonlinear structure of the data. DDC has some properties: (1) does not need conventional learning procedure (as k-NN algorithm), (2) does not need searching time to locate the k-nearest neighbors, and (3) does not need optimization process unlike some classification methods such as Support Vector Machine (SVM). In DDC, we compute the weighted average of distances to all the training samples. Unclassified sample will be classified as belonging to a class that has the minimum obtained distance. As a result, by such a rule we can derive a formula that can be used as the decision surface. DDC is tested on both synthetic and real-world data sets from the UCI repository, and the results were compared with k-NN, RBF Network, and SVM. The experimental results indicate DDC outperforms k-NN in the most experiments and the results are comparable to or better than SVM with some data sets. [ABSTRACT FROM AUTHOR]

This paper addresses the question of maximizing classifier accuracy for classifying task-related mental activity from Magnetoencelophalography (MEG) data. We propose the use of different sources of information and introduce an automatic channel selection procedure. To determine an informative set of channels, our approach combines a variety of machine learning algorithms: feature subset selection methods, classifiers based on regularized logistic regression, information fusion, and multiobjective optimization based on probabilistic modeling of the search space. The experimental results show that our proposal is able to improve classification accuracy compared to approaches whose classifiers use only one type of MEG information or for which the set of channels is fixed a priori. [ABSTRACT FROM AUTHOR]

Ensemble learning has gained considerable attention in different learning tasks including regression, classification, and clustering problems. One of the drawbacks of the ensemble is the high computational cost of training stages. Resampling local negative correlation (RLNC) is a technique that combines two well-known methods to generate ensemble diversity-resampling and error negative correlation-and a fine-grain parallel approach that allows us to achieve a satisfactory balance between accuracy and efficiency. In this paper, we introduce a structure of the virtual machine aimed to test diverse selection strategies of parameters in neural ensemble designs, such as RLNC. We assess the parallel performance of this approach on a virtual machine cluster based on the full virtualization paradigm, using speedup and efficiency as performance metrics, for different numbers of processors and training data sizes. [ABSTRACT FROM AUTHOR]

In the classification framework there are problems in which the number of examples per class is not equitably distributed, formerly known as imbalanced data sets. This situation is a handicap when trying to identify the minority classes, as the learning algorithms are not usually adapted to such characteristics. An usual approach to deal with the problem of imbalanced data sets is the use of a preprocessing step. In this paper we analyze the usefulness of the data complexity measures in order to evaluate the behavior of undersampling and oversampling methods. Two classical learning methods, C4.5 and PART, are considered over a wide range of imbalanced data sets built from real data. Specifically, oversampling techniques and an evolutionary undersampling one have been selected for the study. We extract behavior patterns from the results in the data complexity space defined by the measures, coding them as intervals. Then, we derive rules from the intervals that describe both good or bad behaviors of C4.5 and PART for the different preprocessing approaches, thus obtaining a complete characterization of the data sets and the differences between the oversampling and undersampling results. [ABSTRACT FROM AUTHOR]

Abstract  Aiming at the common support vector machine’s biased disadvantage and computational complexity, an unbiased least squares support vector machine (LSSVM) model is proposed in this paper. The model eliminates the bias item of LSSVM by improving the form of structure risk, then the unbiased least squares support vector classifier and the unbiased least squares support vector regression are deduced. Based on this model, we design a new learning algorithm using Cholesky factorization according to the characteristic of kernel function matrix, in this way the calculation of Lagrangian multipliers is greatly simplified. Several experiments on diffenert datasets are carried out, including the common datasets classification, synthetic aperture radar image automatic target recognition and chaotic time series prediction. The experimental results of correct recognition rate and the fitting precision testify that the unbiased LSSVM model has good universal ability and fitting accuracy, better generalization capability and stability, and have a great improvement in learning speed. [ABSTRACT FROM AUTHOR]

Most common and deadly type of cancer is Skin cancer. The destructive kind of cancers in skin is Melanoma as well as it can be identified at the initial stage and can be cured completely. For the diagnosis of melanoma, the identification of the melanocytes in the area of epidermis is an essential stage. In this paper the watershed segmentation method is implemented for segmentation. The extracted segments are subjected to feature extraction. The features extracted are shape, ABCD rule and GLCM. The extracted features are then used for classification. The classifiers are kNN (k Nearest Neighbor), Random Forest and SVM (Support Vector Machine). Among different classifiers, the SVM classifier provided better results for the skin lesions classification. [ABSTRACT FROM AUTHOR]

Detection of masses and micro calcifications are a stimulating task for radiologists in digital mammogram images. Radiologists using Computer Aided Detection (CAD) frameworks to find the breast lesion. Micro calcification may be the early sign of breast cancer. There are different kinds of methods used to detect and recognize micro calcification from mammogram images. This paper presents an ELM (Extreme Learning Machine) algorithm for micro calcification detection in digital mammogram images. The interference of mammographic image is removed at the pre-processing stages. A multi-scale features are extracted by a feature generation model. The performance did not improve by all extracted feature, therefore feature selection is performed by nature-inspired optimization algorithm. At last, the hybridized ELM classifier taken the selected optimal features to classify malignant from benign micro calcifications. The proposed work is compared with various classifiers and it shown better performance in training time, sensitivity, specificity and accuracy. The existing approaches considered here are SVM (Support Vector Machine) and NB (Naïve Bayes classifier). The proposed detection system provides 99.04% accuracy which is the better performance than the existing approaches. The optimal selection of feature vectors and the efficient classifier improves the performance of proposed system. Results illustrate the classification performance is better when compared with several other classification approaches. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new Internet of Things (IoT) based predictive modelling by using fuzzy cluster based augmentation and classification for predicting the lung cancer disease through continuous monitoring and also to improve the healthcare by providing medical instructions. Here, the fuzzy clustering method is used and which is based on transition region extraction for effective image segmentation. Moreover, Fuzzy C-Means Clustering algorithm is used to categorize the transitional region features from the feature of lung cancer image. In this work, Otsu thresholding method is used for extracting the transition region from lung cancer image. Moreover, the right edge image and the morphological thinning operation are used for enhancing the performance of segmentation. In addition, the morphological cleaning and the image region filling operations are performed over an edge lung cancer image for getting the object regions. In addition, we also propose a new incremental classification algorithm which combines the existing Association Rule Mining (ARM), the standard Decision Tree (DT) with temporal features and the CNN. The experiments have been conducted by using the standard images that are collected from database and the current health data which are collected from patient through IoT devices. The results proved that the performance of the proposed prediction model which is able to achieve the better accuracy when it is compared with other existing prediction model. [ABSTRACT FROM AUTHOR]

Meningioma is the one of the most common type of brain tumor, it as arises from the meninges and encloses the spine and the brain inside the skull. It accounts for 30% of all types of brain tumor. Meningioma's can occur in many parts of the brain and accordingly it is named. In this paper, a mixture model based classification of meningioma brain tumor using MRI image is developed. The proposed method consists of four stages. In the first stage, with respect to the cells' boundary, it is necessary to further processing, which ensures the boundary of some cells is a discrete region. Mathematical Morphology brings a fancy result during the discrete processing. Accurate cancer cell nucleus segmentation is necessary for automated cytological image analysis. Thresholding is a crucial step in segmentation..An adaptive binarization technique is an important step for medical image analysis.Finally, a novel hybrid Fuzzy SVM is designed in the classification stage meningioma brain tumor. The tumor classification results of proposed feature extraction with SVM is 74.24%, MM with FSVM is 82.67% and MM with RBF is 62.71% and our proposed method MM with Hybrid SVM is 91.64%. [ABSTRACT FROM AUTHOR]