Assessment of Performances of Spam Detection Capabilities of Nearest Mean Classifier and Gaussian Method

oai:ojs2.ijaset.org:article/1The potency of nearest mean classifiers and Gaussian in detecting SPAM has been investigated and the findings are presented in this paper. The outcomes take the form of probabilities of error traces and the duration of classification. Due to the difficulty of detecting SPAM, these automated techniques will save a great deal of resources and time necessary to manage messages in the inbox messages. Due to the difficulty of detecting SPAM, these automated techniques will save a great effort and expense of time required to manage email messages

Fuzzy Neural Network Models For Multispectral Image Analysis

Fuzzy neural networks (FNNs) provide a new approach for classification of multispectral data and to extract and optimize classification rules. Neural networks deal with issues on a numeric level, whereas fuzzy logic deals with them on a semantic or linguistic level. FNNs synthesize fuzzy logic and neural networks. Recently, there has been growing interest in the research community not only to understand how FNNs arrive at particular decisions but how to decode information stored in the form of connection strengths in the network. In this paper, we propose fuzzy neural network models for classification of pixels in multispectral images and to extract fuzzy classification rules. During the training phase, the connection strengths are updated. After training, classification rules are extracted by backtracking along the weighted paths through the FNN. The extracted rules are then optimized using a fuzzy associative memory (FAM) bank. The data mining system described above is useful in many practical applications such as mapping, monitoring and managing our planet’s resources and health, climate change impacts and assessments, environmental change detection and military reconnaissance

Land cover classification using fuzzy rules and aggregation of contextual information through evidence theory

Land cover classification using multispectral satellite image is a very challenging task with numerous practical applications. We propose a multi-stage classifier that involves fuzzy rule extraction from the training data and then generation of a possibilistic label vector for each pixel using the fuzzy rule base. To exploit the spatial correlation of land cover types we propose four different information aggregation methods which use the possibilistic class label of a pixel and those of its eight spatial neighbors for making the final classification decision. Three of the aggregation methods use Dempster-Shafer theory of evidence while the remaining one is modeled after the fuzzy k-NN rule. The proposed methods are tested with two benchmark seven channel satellite images and the results are found to be quite satisfactory. They are also compared with a Markov random field (MRF) model-based contextual classification method and found to perform consistently better.Comment: 14 pages, 2 figure

Generating Classification Rules from Training Samples

In this paper, we describe an algorithm to extract classification rules from training samples using fuzzy membership functions. The algorithm includes steps for generating classification rules, eliminating duplicate and conflicting rules, and ranking extracted rules. We have developed software to implement the algorithm using MATLAB scripts. As an illustration, we have used the algorithm to classify pixels in two multispectral images representing areas in New Orleans and Alaska. For each scene, we randomly selected 10 per cent of the samples from our training set data for generating an optimized rule set and used the remaining 90 per cent of samples to validate the extracted rules. To validate extracted rules, we built a fuzzy inference system (FIS) using the extracted rules as a rule base and classified samples from the training set data. The results in terms of confusion matrices are presented in the paper

Random Forest Algorithm for Land Cover Classification

Since the launch of the first land observation satellite Landsat-1 in 1972, many machine learning algorithms have been used to classify pixels in Thematic Mapper (TM) imagery. Classification methods range from parametric supervised classification algorithms such as maximum likelihood, unsupervised algorithms such as ISODAT and k-means clustering to machine learning algorithms such as artificial neural, decision trees, support vector machines, and ensembles classifiers. Various ensemble classification algorithms have been proposed in recent years. Most widely used ensemble classification algorithm is Random Forest. The Random Forest classifier uses bootstrap aggregating for form an ensemble of classification and induction tree like tree classifiers. A few researchers have used Random Forest for land cover analysis. However, the potential of Random Forest has not yet been fully explored by the remote sensing community. In this paper we compare classification accuracy of Random Forest with other commonly used algorithms such as the maximum likelihood, minimum distance, decision tree, neural network, and support vector machine classifiers

Random Forest Algorithm for Land Cover Classification

Since the launch of the first land observation satellite Landsat-1 in 1972, many machine learning algorithms have been used to classify pixels in Thematic Mapper (TM) imagery. Classification methods range from parametric supervised classification algorithms such as maximum likelihood, unsupervised algorithms such as ISODAT and k-means clustering to machine learning algorithms such as artificial neural, decision trees, support vector machines, and ensembles classifiers. Various ensemble classification algorithms have been proposed in recent years. Most widely used ensemble classification algorithm is Random Forest. The Random Forest classifier uses bootstrap aggregating for form an ensemble of classification and induction tree like tree classifiers. A few researchers have used Random Forest for land cover analysis. However, the potential of Random Forest has not yet been fully explored by the remote sensing community. In this paper we compare classification accuracy of Random Forest with other commonly used algorithms such as the maximum likelihood, minimum distance, decision tree, neural network, and support vector machine classifiers

Multispectral Image Analysis Using Random Forest

Classical methods for classification of pixels in multispectral images include supervised classifiers such as the maximum-likelihood classifier, neural network classifiers, fuzzy neural networks, support vector machines, and decision trees. Recently, there has been an increase of interest in ensemble learning – a method that generates many classifiers and aggregates their results. Breiman proposed Random Forestin 2001 for classification and clustering. Random Forest grows many decision trees for classification. To classify a new object, the input vector is run through each decision tree in the forest. Each tree gives a classification. The forest chooses the classification having the most votes. Random Forest provides a robust algorithm for classifying large datasets. The potential of Random Forest is not been explored in analyzing multispectral satellite images. To evaluate the performance of Random Forest, we classified multispectral images using various classifiers such as the maximum likelihood classifier, neural network, support vector machine (SVM), and Random Forest and compare their results

Multispectral Image Analysis using Decision Trees

Many machine learning algorithms have been used to classify pixels in Landsat imagery. The maximum likelihood classifier is the widely-accepted classifier. Non-parametric methods of classification include neural networks and decision trees. In this research work, we implemented decision trees using the C4.5 algorithm to classify pixels of a scene from Juneau, Alaska area obtained with Landsat 8, Operation Land Imager (OLI). One of the concerns with decision trees is that they are often over fitted with training set data, which yields less accuracy in classifying unknown data. To study the effect of overfitting, we have considered noisy training set data and built decision trees using randomly-selected training samples with variable sample sizes. One of the ways to overcome the overfitting problem is pruning a decision tree. We have generated pruned trees with data sets of various sizes and compared the accuracy obtained with pruned trees to the accuracy obtained with full decision trees. Furthermore, we extracted knowledge regarding classification rules from the pruned tree. To validate the rules, we built a fuzzy inference system (FIS) and reclassified the dataset. In designing the FIS, we used threshold values obtained from extracted rules to define input membership functions and used the extracted rules as the rule-base. The classification results obtained from decision trees and the FIS are evaluated using the overall accuracy obtained from the confusion matrix

Knowledge Extraction from Survey Data using Neural Networks

Surveys are an important tool for researchers. Survey attributes are typically discrete data measured on a Likert scale. Collected responses from the survey contain an enormous amount of data. It is increasingly important to develop powerful means for clustering such data and knowledge extraction that could help in decision-making. The process of clustering becomes complex if the number of survey attributes is large. Another major issue in Likert-Scale data is the uniqueness of tuples. A large number of unique tuples may result in a large number of patterns and that may increase the complexity of the knowledge extraction process. Also, the outcome from the knowledge extraction process may not be satisfactory. The main focus of this research is to propose a method to solve the clustering problem of Likert-scale survey data and to propose an efficient knowledge extraction methodology that can work even if the number of unique patterns is large. The proposed method uses an unsupervised neural network for clustering, and an extended version of the conjunctive rule extraction algorithm has been proposed to extract knowledge in the form of rules. In order to verify the effectiveness of the proposed method, it is applied to two sets of Likert scale survey data, and results show that the proposed method produces rule sets that are comprehensive and concise without affecting the accuracy of the classifier