60,178 research outputs found
Improving the Prediction Accuracy of Text Data and Attribute Data Mining with Data Preprocessing
Data Mining is the extraction of valuable information from the patterns of data and turning it into useful knowledge. Data preprocessing is an important step in the data mining process. The quality of the data affects the result and accuracy of the data mining results. Hence, Data preprocessing becomes one of the critical steps in a data mining process.
In the research of text mining, document classification is a growing field. Even though we have many existing classifying approaches, Naïve Bayes Classifier is good at classification because of its simplicity and effectiveness. The aim of this paper is to identify the impact of preprocessing the dataset on the performance of a Naïve Bayes Classifier. Naïve Bayes Classifier is suggested as the best method to identify the spam emails. The Impact of preprocessing phase on the performance of the Naïve Bayes classifier is analyzed by comparing the output of both the preprocessed dataset result and non-preprocessed dataset result. The test results show that combining Naïve Bayes classification with the proper data preprocessing can improve the prediction accuracy.
In the research of Attributed data mining, a decision tree is an important classification technique. Decision trees have proved to be valuable tools for the classification, description, and generalization of data. J48 is a decision tree algorithm which is used to create classification model. J48 is an open source Java implementation of the C4.5 algorithm in the Weka data mining tool. In this paper, we present the method of improving accuracy for decision tree mining with data preprocessing. We applied the supervised filter discretization on J48 algorithm to construct a decision tree. We compared the results with the J48 without discretization. The results obtained from experiments show that accuracy of J48 after discretization is better than J48 before discretization
Temporal patterns of gene expression via nonmetric multidimensional scaling analysis
Motivation: Microarray experiments result in large scale data sets that
require extensive mining and refining to extract useful information. We have
been developing an efficient novel algorithm for nonmetric multidimensional
scaling (nMDS) analysis for very large data sets as a maximally unsupervised
data mining device. We wish to demonstrate its usefulness in the context of
bioinformatics. In our motivation is also an aim to demonstrate that
intrinsically nonlinear methods are generally advantageous in data mining.
Results: The Pearson correlation distance measure is used to indicate the
dissimilarity of the gene activities in transcriptional response of cell
cycle-synchronized human fibroblasts to serum [Iyer et al., Science vol. 283,
p83 (1999)]. These dissimilarity data have been analyzed with our nMDS
algorithm to produce an almost circular arrangement of the genes. The temporal
expression patterns of the genes rotate along this circular arrangement. If an
appropriate preparation procedure may be applied to the original data set,
linear methods such as the principal component analysis (PCA) could achieve
reasonable results, but without data preprocessing linear methods such as PCA
cannot achieve a useful picture. Furthermore, even with an appropriate data
preprocessing, the outcomes of linear procedures are not as clearcut as those
by nMDS without preprocessing.Comment: 11 pages, 6 figures + online only 2 color figures, submitted to
Bioinformatic
- …