Book Rating Analysis Based on Feature Selection and Apriori Algorithm

Remote sensing images obtained by remote sensing are a key source of data for studying large-scale geographic areas. From 2013 onwards, a new generation of land remote sensing satellites from USA, China, Brazil, India and Europe will produce in 1year as much data as 5 years of the Landsat-7 satellite. Thus, the research community needs new ways to analyze large data sets of remote sensing imagery. To address this need, this paper describes a toolbox for combing land remote sensing image analysis with data mining techniques. Data mining methods are being extensively used for statistical analysis, but up to now have had limited use in remote sensing image interpretation due to the lack of appropriate tools. The toolbox described in this paper is the Geographic Data Mining Analyst (GeoDMA). It has algorithms for segmentation, feature extraction, feature selection, classification, landscape metrics and multi-temporal methods for change detection and analysis. GeoDMA uses decision-tree strategies adapted for spatial data mining. It connects remotely sensed imagery with other geographic data types using access to local or remote database. GeoDMA has methods to assess the accuracy of simulation models, as well as tools for spatio-temporal analysis, including a visualization of time-series that helps users to find patterns in cyclic events. The software includes a new approach for analyzing spatio-temporal data based on polar coordinates transformation. This method creates a set of descriptive features that improves the classification accuracy of multi-temporal image databases. GeoDMA is tightly integrated with TerraView GIS, so its users have access to all traditional GIS features. To demonstrate GeoDMA, we show two case studies on land use and land cover change.

The way we learn has changed as a result of advances in science and technology and the growing influence of information technology on daily life. E-learning is a relatively new concept in educational settings, but it has progressively earned a spot in modern training techniques. Data mining methods are used in many applications, particularly in elearning. Comparing direct communications difficult to track the student involvement in online courses. To overcome the above mentioned issues the existing methods are analyzed various techniques of data mining and optimization methods which can be applied to bring out hidden knowledge from the educational data? In the e-learning work, preprocessing, feature selection and classification process are performed to improve the Kalboard 360 educational dataset accuracy significantly. This study focused on educational data mining (EDM) and employed decision trees, support vector machines (SVM), multilayer perceptrons, and the naive bayesian C4.5 algorithm among other classification techniques to assess the features for the prediction of students’ behaviour and academic achievement. This paper analyzes the advantages and shortcomings of each algorithm applied to data set on the basis of accuracy for various classification techniques like Multilayer Perceptron based ANN algorithm (MP-ANN), Decision Tree (DT) C4.5 and Hybrid Regression model with Multi Label Classification (HR-MLC) approach. The experimental result shows that the HR-MLC algorithm provides better performance in terms of higher accuracy, precision, recall and f-measure rather than the other existing methods.

Recent advances in computing, communications, digital storage technologies, and high-throughput data-acquisition technologies, make it possible to gather and store incredible volumes of data. It creates unprecedented opportunities for large-scale knowledge discovery from huge database. Data mining (DM) technology has emerged as a means of performing this discovery. There are countless researchers working on designing efficient data mining techniques, methods, and algorithms. Many data mining methods and algorithms have been developed and applied in a lot of application fields [1]. Unfortunately, most data mining researchers pay much attention to technique problems for developing data mining models and methods, while little to basic issues of data mining [2]. In this talk, some basic issues of data mining are addressed. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? What is the rule we should obey in a data mining process? Through analyzing existing data mining methods, and domain-driven (or user-driven) data mining models [3-5], we find that we should take a data mining process as a process of knowledge transformation. Based on this understanding of data mining, a conceptual data mining model of domain-oriented data-driven data mining (3DM) is proposed [2]. The relationship between traditional domain-driven (or user-driven) data mining models and our proposed 3DM model is also analyzed. Some domain-oriented data-driven data mining algorithms for mining such knowledge as default rule [6], decision tree [7], and concept lattice [8] from database are proposed. The experiment results for these algorithms are also shown to illustrate the efficiency and performance of the knowledge acquired by our 3DM data mining algorithms.

This paper initiates perceptions and algorithms of feature selection, survey of existing feature selection algorithms and assesses diverse algorithms with a classifying frame based on search approaches, valuation criteria, and provides strategy in selecting feature selection algorithms. A unifying platform is projected to continue our efforts headed for building an incorporated system for intelligent feature selection. Feature selection intends to reduce the dimensionality of patterns for classification by choosing the most informative instead of irrelevant and/or redundant features. In this proposed work Intuitionistic fuzzy based feature clustering is proposed for grouping features based on the degree of membership and degree of indeterminacy among the attributes and clusters. In this proposed work a novel approach which uses an Intuitionistic fuzzy version of k-means has been introduced for grouping interdependent features. Genetic algorithm reinstating which is the variation of traditional genetic algorithm is then applied to appraise whether the measured feature is independent of class labels; hence, it leads to eliminate unrelated clusters to classification process and progress the selection of features. The proposed method achieves improvement on classification accuracy and perhaps to select less number of features which show the way to simplification of learning task to a big extent. The Experiment results have been demonstrated by the good performance and also find good enough subset features of this method on using UCI benchmark datasets that are for data mining methods such as Breast Cancer, Sensor and Iris Records.

The aim of this research is to explore and analyze the benefits of risk classification methods by using data mining techniques on premium ratemaking in nonlife insurance. We rely on generalized linear models (GLMs) framework for nonlife premiums and examine the impact of specific data mining techniques on classifications of risk in motor hull insurance in Bosnia and Herzegovina. We study this relationship in an integrated framework considering a standard risk model based on the application of Poisson GLM for claims frequency estimate. Although GLM is a widely used method to determine insurance premiums, improvements of GLM by using the data mining methods identified in this paper may solve practical challenges for the risk models. The application of the data mining method in this paper aims to improve the results in the process of nonlife insurance premium ratemaking. The improvement is reflected in the choice of predictors or risk factors that have an impact on insurance premium rates. The following data mining methods for the selection of prediction variables were investigated: forward stepwise and neural networks. We provide strong and robust evidence that the use of data mining techniques influences premium ratemaking in nonlife insurance.KeywordsRatemakingForward stepwiseNeural networksNonlife insuranceGLM

The aim of this study is to highlight the importance of the unsupervised learning in Data mining and CRM fields. Data mining commonly known by its acronym KDD: knowledge discovery in data base, it refers to all methods and algorithms used for data exploration or prediction in large data bases volumes, Data mining is very important in various fields such as science, business and other areas deal with a large data set. CRM: Customer Relationship Management is an integrated information system that is used to plan, schedule and control the pre-sales and post-sales activities in an organization, both CRM and data mining techniques helps organizations maximize the value of every customer interaction and drive superior corporate performance. Clustering is one of the favoured used methods in data mining: The objective of this study is to implement the clustering algorithm K-Medoids via a shell script applied on a set of Analytical CRM data stored in Teradata environment.

In the present state of affairs, the motive behind every educational organization is to uplift the academic achievement of students. Educational data mining (EDM) is an upward field of research, and it is very helpful for academic institutions to predict the academic performance of the students. Educational datasets are the basis of various predictive models. Quality of these models can be improved by using feature selection (FS). To get the required benefits from the available data, there must be some tools for analysis and prediction. In lieu of the above, machine learning/data mining are most suitable. In educational data mining, for better accuracy of prediction models’ and quality of various educational datasets, feature selection (FS) plays a vital role. Feature selection (FS) algorithms abolish inappropriate information from the repositories of educational background so that performance of classifier in terms of accuracy could be increased and the same could be used for better decision. In lieu of the above, a best feature selection algorithm must be selected. In this paper, two filter selection approaches namely correlation feature selection (CFS) and wrapper-based feature selection have been used to demonstrate the importance of selection of a feature subset for a classification problem. The present paper aims to find the detailed investigation of filter feature selection algorithms along with the classification algorithms on a given dataset. We found result with numerous numbers of features from various Feature selection algorithms and classifiers which will help the researcher to discover the most excellent mixture of filter feature selection algorithms and its associated classifiers. The result indicates that SMO and J48 have the highest accuracy measures with the correlation feature selection algorithms, while Naïve Bayes has the highest accuracy measures with the wrapper subset feature selection algorithms for predicting high, medium and low grade for the students.

Computing significant factors quantitatively is an imperative task in understanding the underlying reasons that contribute to a final outcome. In this paper, a case of e-Government ranking is studied by attempting to find the significance of each KPIs which leads to resultant rank of a country. Significant factors in this context are inferred as some degrees of relations between the input variables (which are the KPIs in this case) and the final outcome (the rank). In the past, significant factors were either acquired as first-hand information via direct questioning from users’ satisfaction survey or qualitative inference; typical question is ‘You are satisfied with a particular e-Government service’ by applying a multi-level Likert scale. Respondents answered by choosing one of the following: Strongly agree, Agree, Neutral, Disagree, and Strongly Disagree. The replies are then counted and studied using traditional statistical methods. In this paper, an alternative method by feature selection in data mining is proposed which computes quantitatively the relative importance of each KPI with respective to the predicted class, the rank. The main advantage of feature selection by data mining (FSDM) method is that it considers the cross-dependencies of the variables and how they contribute as a whole predictive model to a particular predicted outcome. In contrast, classical significant factor analysis such as correlogram tells only the strength of correlation between an individual pair of factor and outcome. Another advantage of using data mining method over simple statistic is that the inferred predictive model could be used as a predictor and/or what-if decision simulator; given some values of KPIs a corresponding rank could be guesstimated. A case study of computing significant factors in terms of KPIs that lead to the world rank in from the data of UN e-Government Survey 2010, is presented.

In modern society, mortality and morbidity are caused majorly by heart disease (HD), and in world, deaths are mainly caused by heart disease (HD). The detection of HD and prevention against death is a challenging task. Medical diagnosis is highly complicated and it is very important. It must be performed efficiently with high accuracy. The professionals in healthcare in heart disease diagnosis are assisted by using various techniques in data mining. In this work, heart disease prediction method with following steps is introduced. The steps are preprocessing technique, feature selection, and learning algorithm. Before that important features are selected via the use of the updated frequency-based bat algorithm (UFBBA). In the UFBBA algorithm, the frequency values are computed via the use of the features. If the features are most important, then the frequency is higher else the frequency is lower. A selected feature from the UFBBA is used for better accuracy results than the other classifiers. A feature selected from the algorithm is applied for classification (Vote). Experimentation dataset of the proposed system is collected from Irvine (UCI) Cleveland dataset, University of California dataset. The results are measured with respect to accuracy, f-measure, precision, and recall.

Due to increasing use of technology-enhanced educational assessment, data mining methods have been explored to analyse process data in log files from such assessment. However, most studies were limited to one data mining technique under one specific scenario. The current study demonstrates the usage of four frequently used supervised techniques, including Classification and Regression Trees (CART), gradient boosting, random forest, support vector machine (SVM), and two unsupervised methods, Self-organizing Map (SOM) and k-means, fitted to one assessment data. The USA sample (N = 426) from the 2012 Program for International Student Assessment (PISA) responding to problem-solving items is extracted to demonstrate the methods. After concrete feature generation and feature selection, classifier development procedures are implemented using the illustrated techniques. Results show satisfactory classification accuracy for all the techniques. Suggestions for the selection of classifiers are presented based on the research questions, the interpretability and the simplicity of the classifiers. Interpretations for the results from both supervised and unsupervised learning methods are provided.

With the continuous development of Internet technology, data gradually present a complicated and high-dimensional trend. These high-dimensional data have a large number of redundant features and irrelevant features, which bring great challenges to the existing machine learning algorithms. Feature selection is one of the important research topics in the fields of machine learning, pattern recognition and data mining, and it is also an important means in the data preprocessing stage. Feature selection is to look for the optimal feature subset from the original feature set, which would improve the classification accuracy and reduce the machine learning time. The traditional feature selection algorithm tends to ignore the kind of feature which has a weak distinguishing capacity as a monomer, whereas the feature group’s distinguishing capacity is strong. Therefore, a new dynamic interaction feature selection (DIFS) algorithm is proposed in this paper. Initially, under the theoretical framework of interactive information, it redefines the relevance, irrelevance and redundancy of the features. Secondly, it offers the computational formulas for calculating interactive information. Finally, under the eleven data sets of UCI and three different classifiers, namely, KNN, SVM and C4.5, the DIFS algorithm increases the classification accuracy of the FullSet by 3.2848% and averagely decreases the number of features selected by 15.137. Hence, the DIFS algorithm can not only identify the relevance feature effectively, but also identify the irrelevant and redundant features. Moreover, it can effectively improve the classification accuracy of the data sets and reduce the feature dimensions of the data sets.

Most companies find themselves in highly competitive markets nowadays. As a result, many companies struggle to manage their financial obligation to pay their supplier on time. Delayed payments to suppliers can create all kinds of issue with the supplier's cash flow. Finding a way to reduce or avoid any potential losses because of this delay is needed. Currently, data mining techniques have been widely applied to the assessment or prediction of credit scores for customers in the banking industry (credit scoring), and the most commonly used method is classification. Based on previous studies, research has been conducted to develop a data mining model to produce the best classification model to predict a customer’s payment capabilities. With the application of data mining approaches using oversampling, feature selection (FS) algorithm, including Relief, Information Gain Ratio, PCA, and multiclass algorithm, including Random Forest, SVM, One-versus-all, All-versus-all and Error Correcting Output Coding (ECOC), is expected to produce good accuracy to predict the ability of these payments. As a result of this research, the model proposed can provide the best classification model with 84.24% accuracy and AUC value of 95.3% using sample dataset of manufacturing industry within three years period

Predictive analytics has emerged as a powerful tool in the field of financial engineering, enabling organizations to forecast trends, optimize strategies, and mitigate risks. Data mining techniques play a crucial role in extracting meaningful patterns from large volumes of financial datasets, contributing to the development of predictive modeling techniques. The purpose of this paper is to explore the application of various data mining techniques in predictive analytics within the financial sector, with a focus on their effectiveness in risk management, fraud detection, and portfolio optimization. Machine learning algorithms, such as decision trees, support vector machines, and neural networks, are increasingly being employed to model complex financial systems and enhance predictive accuracy. Additionally, techniques like clustering, association rule mining, and time series analysis are used to uncover hidden relationships and temporal patterns in financial datasets. Despite the significant advancements in these techniques, challenges remain in terms of data quality, computational complexity, and interpretability of results. This paper addresses these challenges and provides a comprehensive review of the most widely used data mining methods in financial engineering. Furthermore, it discusses the potential for future advancements in data mining algorithms and their integration with other emerging technologies like artificial intelligence and big data analytics. The findings indicate that while data mining offers significant potential in financial analytics, careful consideration must be given to the selection of appropriate techniques and the proper handling of data to ensure reliable predictions. Ultimately, this paper aims to contribute to the ongoing development of robust predictive modeling techniques in financial engineering by emphasizing the importance of data mining as an indispensable tool.

One of the most difficult tasks in the whole KDD process is to choose the right data mining technique, as the commercial software tools provide more and more possibilities together and the decision requires more and more expertise on the methodological point of view. Indeed, there are a lot of data mining techniques available for an environmental scientist wishing to discover some model from her/his data. This diversity can cause some troubles to the scientist who often have not a clear idea of what are the available methods, and moreover, use to have doubts about the most suitable method to be applied to solve a concrete domain problem. Within the data mining literature there is not a common terminology. A classification of the data mining methods would greatly simplify the understanding of the whole space of available methods. In this work, a classification of most common data mining methods is presented in a conceptual map which makes easier the selection process. Also an intelligent data mining assistant is presented. It is oriented to provide model/algorithm selection support, suggesting the user the most suitable data mining techniques for a given problem.

Data Mining is a process that uses statistical techniques, mathematics, artificial intelligence, machine learning to extract and identify useful information and related knowledge from large databases. Data mining is the process of finding new patterns in data by filtering large amounts of data. Data mining uses pattern recognition technology that is similar to statistical techniques and mathematical techniques. The patterns found can provide useful information for generating economic benefits, effectiveness and efficiency. Algorithm Naive Bayes Classifier is one method of data mining that can be used to support effective and efficient promotion strategies. The Naive Bayes Classifier algorithm is used to predict the interest of the study based on the calculations performed. The data used are new student registration data from 2014 until 2016 at Bina Darma University. The results of this study are new models that are expected to provide important information can be used to assist the Marketing Team of Bina Darma University Palembang in policy making and implementation of appropriate marketing strategy. The results obtained are expected to help to support the promotion strategies that impact on the effectiveness and efficiency of promotion and increase the number of new students who will register.