Search

The superiority of Convolutional Neural Networks (CNNs) largely relies on their architectures that are usually manually crafted with extensive human expertise. Unfortunately, such kind of domain knowledge is not necessarily owned by every interested user. Data mining on existing CNNs can discover useful patterns and fundamental comments from their architectures, providing researchers with strong prior knowledge to design effective CNN architectures when they have no expertise in CNNs. There are various state-of-the-art data mining algorithms at hand, while there is only rare work on mining CNN architectures. One of the main reasons is the gap between CNN architectures and data mining algorithms. Specifically, the current CNN architecture descriptions cannot be exactly vectorized to feed to an data mining algorithm. In this paper, we propose a unified approach, named ArcText, to describing CNN architectures based on text. Particularly, four different units and an ordering method have been elaborately designed in ArcText, to uniquely describe the same CNN architecture with sufficient information. Also, the resulted description can be exactly converted back to the corresponding CNN architecture. ArcText bridges the gap between CNN architectures and data mining researchers, and has the potential to be utilized to wider scenarios.

Population structure changes interact with economic development, moderate population and reasonable population structure are important guarantees for sustainable social and economic development. The research ignores the specific impact of the change of population age structure on economic growth, and proposes and establishes a population economic function model based on data mining algorithm. Based on the changes of population structure in Liaoning Province in the past 20 years, Grey correlation analysis method is selected. The analysis shows that there is a close relationship between population structure and economic growth. Based on this research, the econometric method is used to construct a multiple linear regression model to further analyze the specific impact of population structure changes on economic growth. The analysis results show that the total population of urban areas, the total number of employed people in the primary industry, the number of middle school students per 10,000 people, and the total number of employed people in the tertiary industry are the four most significant demographic indicators for the per capita GDP of the study area. There is a significant positive correlation between the total number of employed people in the tertiary industry and per capita GDP and there is a significant negative correlation between the total number of employed people in the primary industry and the number of middle school students per capita and per capita GDP. The impact of other indicators on per capita GDP is not significant. According to the conclusion, countermeasures and suggestions to ease population structure change and promote the coordinated development of population and economy in the study area are put forward.

Driver drowsiness causes many road accidents, and preparing a risk map of these accidents with spatial criteria and data mining algorithms highlights accident points well. In this study, accidents ...

High utility itemset (HUI) mining is a powerful data mining technique to discover profitable patterns. The utility of an item is computed by using two measures named quantity and per-unit profit. All existing HUI mining algorithms consider a single value of external utility (per unit profit) for the entire database. However, the per-unit profit of items might fluctuate over time in many applications. This research introduces three novel strategies to comprise the external utilities of items as input for the HUI mining algorithm. Traditional HUI mining algorithms have been developed for the standalone system and do not fit for big data processing due to the limited computing resources (CPU, memory). Big data are efficiently processed on distributed frameworks like Apache Hadoop, Spark, etc. This paper introduces a distributed HUI mining algorithm named Spark-based Top-k high utility itemset (k-SHUI) miner. We also propose a fair load distribution strategy to divide the search space equally among the cluster nodes. The k-SHUI produces top-k HUIs without the requirement of the minimum utility threshold. We conducted extensive experiments on six real-life datasets to compare the proposed algorithm's performance with the existing algorithm. The experimental results demonstrate that the proposed algorithm outperforms the existing algorithms.

Computer science has evolved to become the basis for evolution and entered into all areas of life where the use of computer has been developed in all scientific, military, commercial and health institutions. In addition, it has been applied in residential and industrial projects due to the high capacity and ability to achieve goals in a shorter time and less effort. In this research, the computer, its branches, and algorithms will be invested in the psychological field. In general, in psychological fields, a questionnaire model is created according to the requirements of the research topic. The model contains many questions that are answered by the individuals of the sample space chosen by the researcher. Often, these questions are long and tedious, and some questions are repeated and not useful. In this research, we will work on summarizing these forms without effecting their research results; eventually, these steps in the proposed approach will produce better forms. However, it leads to building a method using the Apriori algorithm and Association rule mining which, consequently, applies to each questionnaire from which unnecessary questions are to be removed.

There is currently no effective analytical method in colorectal image analysis, which leads to certain errors in colorectal image analysis. In order to improve the accuracy of colorectal imaging detection, this study used a genetic algorithm as the data mining algorithm and combined it with image processing technology to perform image analysis. At the same time, combined with the actual requirements of image detection, the gray theory model is used as the basic theory of image processing, and the image detection prediction model is constructed to predict the data. In addition, in order to study the effectiveness of the algorithm, the experiment is carried out to analyze the validity of the data of the study, and the predicted value is compared with the actual value. The research shows that the proposed algorithm has certain accuracy and can provide theoretical reference for subsequent related research.

With the advent of the big data era, information presentation has exploded. For example, rich methods such as audio and video have integrated more information, but with it, a lot of bad information has been brought. In view of this situation, this paper relies on data mining algorithms, builds a multimedia filtering system model for massive information, and integrates content recognition, packet filtering, and other technologies to match the two to ensure the integrity and real time of filtering. Practice results prove that the method is effective.

Next-term grade prediction is a challenging problem. The objective of this problem is to predict students grades in new courses, given their grades in courses they have previously taken. Adopting various machine learning algorithms is a very common and straightforward approach to tackling this problem. However, such models are very difficult to interpret. That is, it is difficult to explain to a student (or a teacher) why the model predicted grade B for a given student for example. In this work, we shed light on the importance of building interpretable models for educational data mining tasks. Specifically, we propose a novel interpretable framework for multi-class grade prediction that is based on an optimal rule-list mining algorithm. Additionally, we evaluate our proposed framework on two private datasets and compare our results with baseline models. Our findings show that our proposed framework is capable of achieving higher prediction and interpretability values when compared to black-box models.

In disease diagnosis, the classification accuracy based on multi‐modal models is usually higher than single‐modal models. However, in the process of multimodal data fusion, how to reasonably solve the heterogeneity problem and better extract the information between different modal data has attracted the attention of scholars. Federated learning is an efficient machine learning method that can expand between multiple parameters or multiple computing nodes. It has been applied successfully in the financial industry and cross‐industry cooperation. In this paper, a novel algorithm to disease diagnosis model based on federated learning is proposed. The model not only cleverly solves heterogeneous problems, but also excavates information between different modal data to promote the model to be more robust and discriminative. The experiment results show that the proposed model has better performance than traditional fusion algorithms. Notably, compared with other models, this model converges faster and requires less computation.

Based on an assessment of production capabilities, manufacturing sectors' core competency is increased. The importance of product quality in this aspect cannot be overstated. Several academics have introduced Deming's 14 principles, Shewhart cycle, total quality management, and other approaches to decrease the external failure costs and enhance product yield rates. Analysis of industrial data and process monitoring is becoming increasingly important as a part of the Industry 4.0 paradigm. In order to reduce the internal failure cost and inspection overhead, quality control (QC) schemes are utilized by industries. The final product quality has an interactive and cumulative effect of various parameters like operators and equipment in multistage manufacturing processes (MMP). In other cases, the final product is inspected in a single workstation with QC. It's challenging to do a cause analysis in MMP whenever a failure occurs. Several industries are looking for the optimal quality prediction model in order to achieve flawless production. The majority of current approaches solely handles single-stage manufacturing and is inadequate in dealing with MMP quality concerns. To overcome this issue, this paper proposes an industrial quality prediction system with a combination of multiple Program Component Analysis (PCA) and Decision Stump (DS) algorithm for MMP quality prediction. A SECOM (SEmiCOnductor Manufacturing) dataset is used for verification and validation of the proposed model. Based on the findings, it is clear that this model is capable of performing accurate classification and prediction in the field of industrial quality.

In the current paper, the efficiency of three new standalone data-mining algorithms [M5 Prime (M5P), Random Forest (RF), M5Rule (M5R)] and six novel hybrid algorithms of bagging (BA-M5P, BA-RF and BA-M5R) and Attribute Selected Classifier (ASC-M5P, ASC-RF and ASC-M5R) for streamflow prediction were assessed and compared with an autoregressive integrated moving average (ARIMA) model as a benchmark. The models used precipitation (P) and streamflow (Q) data from the period 1979–2012 for training and validation (70% and 30% of data, respectively). Different input combinations were prepared using both P and Q with different lag times. The best input combination proved to be that in which all of the the data were used (i.e. R and Q – with lag times). Overall, employing Q with different lag times proved to be more effective than using only P as input for streamflow prediction. Although all models showed very good predictive power, BA-M5P outperformed the other models.

Lane-level road cluster is a most representative phenomenon in road networks and is vital to spatial data mining, cartographic generalization, and data integration. In this article, a lane-level road cluster recognition method was proposed. First, the conception of lane-level road cluster and our motivation were addressed and the spatial characteristics were given. Second, a region growing cluster algorithm was defined to recognize lane-level road clusters, where constraints including distance and orientation were used. A novel moving distance (MD) metric was proposed to measure the distance of two lines, which can effectively handle the non-uniformly distributed vertexes, heterogeneous length, inharmonious spatial alignment, and complex shape. Experiments demonstrated that the proposed method can effectively recognize lane-level road clusters with the agreement to human spatial cognition.

Data mining techniques are included with Ensemble learning and deep learning for the classification. The methods used for classification are, Single C5.0 Tree (C5.0), Classification and Regression Tree (CART), kernel-based Support Vector Machine (SVM) with linear kernel, ensemble (CART, SVM, C5.0), Neural Network-based Fit single-hidden-layer neural network (NN), Neural Networks with Principal Component Analysis (PCA-NN), deep learning-based H2OBinomialModel-Deeplearning (HBM-DNN) and Enhanced H2OBinomialModel-Deeplearning (EHBM-DNN). In this study, experiments were conducted on pre-processed datasets using R programming and 10-fold cross-validation technique. The findings show that the ensemble model (CART, SVM and C5.0) and EHBM-DNN are more accurate for classification, compared with other methods.

Data analysis subjects are an important part of the computer science degree. In these subjects, seminars and practical sessions where students can practice with different data mining algorithms and techniques are a paramount part. This usually involves the installation and deployment of a common development environment for all the students including libraries, databases, datasets and so forth. Due to the heterogeneity of these environments and the characteristics of the undergraduates, such a configuration and deployment might be an important task in the seminars schedule. Consequently, the present work puts forward an open-source tool for the automatic deployment of data-mining environments based on Docker containers. By means of this tool, the teacher can specify the parameters of the environment to deploy. This results in a set of virtual images comprising the whole practice environment that can be easily distributed among students. This way, we meaningfully optimize the aforementioned deployment step and we also guarantee that all students work with the same practice environment. Finally, we have evaluated the performance of the tool and the level of satisfaction of the students with the generated environments showing quite promising results.

Data preprocessing is an essential task to prepare suitable target datasets to apply statistical and data mining algorithms. It has become one of the complex segment in Web usage mining due to the ...

At present, PBL English (foreign language) micro audio and video teaching mode is gradually rising, and the application of intelligent algorithm in it has gradually attracted people’s attention. This paper studies PBL English micro audio and video teaching mode based on human-computer interaction and micro audio and video recognition and data mining algorithm. Through the extraction and selection of acoustic features of speech emotion, the relationship between emotion and each feature parameter is explored, and the acoustic feature with the strongest emotion discrimination ability is selected. Using the machine learning method of support vector machine, a speech emotion recognition model with high recognition rate is constructed and applied to the mobile speech emotion recognition system, and the algorithm is verified by experiments. The experimental results show that the prediction accuracy is 70%. The algorithm proposed in this paper has good recognition effect, strong human-computer interaction ability and good effect. The research of this paper will contribute to the development of English (foreign language) micro audio and video teaching mode, optimize the human-computer interaction mode of English (foreign language) micro audio and video teaching, and improve the teaching autonomy.

Mining of colossal patterns is used to mine patterns in databases with many attributes and values, but the number of instances in each database is small. Although many efficient approaches for extracting colossal patterns have been proposed, they cannot be applied to colossal pattern mining with constraints. In this paper, we solve the challenge of extracting colossal patterns with length constraints. Firstly, we describe the problems of min-length constraint and max-length constraint and combine them with length constraints. After that, we evolve a proposal for efficiently truncating candidates in the mining process and another one for fast checking of candidates. Based on these properties, we offer the mining algorithm of Length Constraints for Colossal Pattern (LCCP) to extract colossal patterns with length constraints. Experiments are also conducted to show the effectiveness of the proposed LCCP algorithm with a comparison to some other ones.

Internal and external quality characters of poultry eggs are quitely important to determine egg weight. Also, the quality of eggs is important for both hatching and egg production. The purpose of this study was modelling of egg weight with the MARS (Multivariate Adaptive Regression Splines) method using inner and outsider quality characters of egg in Lohmann LSL Classic white hybrit flock. For this purpose, the eggs of the Lohmann LSL Classic white hybrid flock (n=60) were used. Weekly egg yields were evaluated from the 22nd week to the 62nd week. In the research, for the prediction of dependent and continuous variable egg weight; shape index (SI), shell breaking resistance (SBS), shell weight (SW), shell thickness (ST), yolk diameter (YD), yolk width (YW), yolk height (YH), color (YC ), albumen length (AW), albumen height (AL) and albumen height (AH) were used. In order to obtain perfect goodness of fit, in the “earth” package of the R program, the definitions of penalty -1, degree = 2, nprune = 10 and nk = 60. The research, the mars prediction model was determined such as EW = 63.1-0.906 * max (0,75-SI)-0.32 * max (0, SI-75) -62.4 * max (0,0.57-ST) -354 * max (0, ST-0.57) + 1.13 * Groupa2 * max (0, 75-SI) + 1.49 * (0.0.57-ST) max * YD + 8.2*max(0, ST 0.57) * YD-0.02*(0 YD-38.5)max* YC-0.0366*YH * max(0,13-YC). As a result, some quality variables were found to be important in determining egg weight. Variables such as group a2, SI, YC, ST, YD, YH to estimate the weight of the egg determined as the dependent variable were used. Other variables are not included in this equation. In the poultry, the MARS prediction model may be a better alternative to classical nonlinear models in predicting egg weight since that it is easier and has higher accuracy., Kanatlı hayvanlarda, yumurta ağırlığını belirlemede yumurtanın iç ve dış kalite özellikleri oldukça önemlidir. Yumurtanın kalite özellikleri, gerek kuluçka üretimi ve gerekse yemeklik yumurta üretimi açısından büyük önem taşımaktadır. Bu çalışmanın amacı, Lohmann LSL Classic beyaz hibrit sürü yumurtaları kullanılarak yumurtanın ic dış kalite özellikleri ile yumurta ağırlığının tahminini MARS (Multivariate Adaptive Regression Splines) yöntemi ile modellemektir. Bu amacı gerçekleştirmek için Lohmann LSL Classic beyaz hibrit sürü (n = 60) yumurtaları kullanıldı. Haftalık yumurta verimleri 22. haftadan 62. haftaya kadar değerlendirilmiştir. Bağımlı ve sürekli değişken olarak belirlenen yumurta ağırlığını (EW) tahmin etmek için; şekil indeksi (SI), kabuk kırılma mukavemeti (SBS), kabuk ağırlığı (SW), kabuk kalınlığı (ST), yumurta sarısı çapı (YD), yumurta sarısı genişliği (YW), yumurta sarısı yüksekliği (YH), yumurta sarısı rengi (YC) albümin genişliği (AW), albümin uzunluğu (AL), albümin yüksekliği (AH) kullanılmıştır. Mükemmel uyum iyiliği elde etmek için, R programının “earth” paketinde, penalty = -1, derece = 2, nprune = 10 ve nk = 60 tanımları yapıldı. Araştırma sonucunda mars tahmin modeli, EW = 63.1-0.906 * max (0,75-SI) -0.321 * max (0, SI-75)-62.4*max(0,0.57-ST)-354*max(0,ST 0.57)+1.13*Groupa2*max (0,75-SI)+1.49* max(0.0.57-ST) * YD + 8.2 * max(0, ST-0.57)*YD-0.02*max(0 YD-38.5)*YC-0.0366* YH*max(0,13-YC) olarak belirlendi. Sonuç olarak, bazı kalite değişkenlerinin yumurta ağırlığının belirlenmesinde önemli olduğu bulunmuştur.Bağımlı değişken olarak belirlenen yumurtanın ağırlığını tahmin ederken a2, SI, YC, ST, YD, YH görülürken, diğer değişkenler bu denkleme dahil edilmemiştir. Tavukçulukta, MARS tahmin modeli, daha kolay formül ve daha yüksek doğruluk ile yumurta ağırlığını tahmin etmede klasik lineer olmayan modellere daha iyi bir alternatif olabilir.

Purpose Real estate appraisals are becoming an increasingly important means of backing up financial operations based on the values of these kinds of assets. However, in very large databases, there is a reduction in the predictive capacity when traditional methods, such as multiple linear regression (MLR), are used. This paper aims to determine whether in these cases the application of data mining algorithms can achieve superior statistical results. First, real estate appraisal databases from five towns and cities in the State of Paraná, Brazil, were obtained from Caixa Econômica Federal bank. Design/methodology/approach After initial validations, additional databases were generated with both real, transformed and nominal values, in clean and raw data. Each was assisted by the application of a wide range of data mining algorithms (multilayer perceptron, support vector regression, K-star, M5Rules and random forest), either isolated or combined (regression by discretization – logistic, bagging and stacking), with the use of 10-fold cross-validation in Weka software. Findings The results showed more varied incremental statistical results with the use of algorithms than those obtained by MLR, especially when combined algorithms were used. The largest increments were obtained in databases with a large amount of data and in those where minor initial data cleaning was carried out. The paper also conducts a further analysis, including an algorithmic ranking based on the number of significant results obtained. Originality/value The authors did not find similar studies or research studies conducted in Brazil.

Association rule mining is a common technique used in discovering interesting frequent patterns in data acquired in various application domains. The search space combinatorically explodes as the size of the data increases. Furthermore, the introduction of new data can invalidate old frequent patterns and introduce new ones. Hence, while finding the association rules efficiently is an important problem, maintaining and updating them is also crucial. Several algorithms have been introduced to find the association rules efficiently. One of them is Apriori. There are also algorithms written to update or maintain the existing association rules. Update with early pruning (UWEP) is one such algorithm. In this paper, the authors propose that in certain conditions it is preferable to use an incremental algorithm as opposed to the classic Apriori algorithm. They also propose new implementation techniques and improvements to the original UWEP paper in an algorithm we call UWEP2. These include the use of memorization and lazy evaluation to reduce scans of the dataset.

Breast cancer, a type of malignant tumor, affects women more than men. About one-third of women with breast cancer die of this disease. Hence, it is imperative to find a tool for the proper identification and early treatment of breast cancer. Unlike the conventional data mining algorithms, fuzzy logic-based approaches help in the mining of association rules from quantitative transactions. In this study, a novel fuzzy methodology, IFFP (improved fuzzy frequent pattern mining), based on a fuzzy association rule mining for biological knowledge extraction, is introduced to analyze the dataset in order to find the core factors that cause breast cancer. It is determined that the factor, mitoses, has low range of values on both malignant and benign, and hence it does not contribute to the detection of breast cancer. On the other hand, the high range of bare nuclei shows more chances for the presence of breast cancer. Experimental evaluations on real datasets show that the proposed method outperforms recently proposed state-of-the-art algorithms in terms of runtime and memory usage.

Nowadays, data from various sources are gathered and stored in databases. The collection of the data does not give a significant impact unless the database owner conducts certain data analysis such as using data mining techniques to the databases. Presently, the development of data mining techniques and algorithms provides significant benefits for the information extraction process in terms of the quality, accuracy, and precision results. Realizing the fact that performing data mining tasks using some available data mining algorithms may disclose sensitive information of data subject in the databases, an action to protect privacy should be taken into account by the data owner. Therefore, privacy preserving data mining (PPDM) is becoming an emerging field of study in the data mining research group. The main purpose of PPDM is to investigate the side effects of data mining methods that originate from the penetration into the privacy of individuals and organizations. In addition, it guarantees that the data miners cannot reveal any personal sensitive information contained in a database, while at the same time data utility of a sanitized database does not significantly differ from that of the original one. In this paper, we present a wide view of current PPDM techniques by classifying them based on their taxonomy techniques to differentiate the characteristics of each approach. The review of the PPDM methods is described comprehensively to provide a profound understanding of the methods along with advantages, challenges, and future development for researchers and practitioners.

Mining maximal frequent patterns is significant in many fields, but the mining efficiency is often low. The bottleneck lies in too many candidate subgraphs and extensive subgraph isomorphism tests. In this paper we propose an efficient mining algorithm. There are two key ideas behind the proposed methods. The first is to divide each edge of every certain graph (converted from equivalent uncertain graph) and build search tree, avoiding too many candidate subgraphs. The second is to search the tree built in the first step in order, avoiding extensive subgraph isomorphism tests. The evaluation of our approach demonstrates the significant cost savings with respect to the state-of-the-art approach not only on the real-world datasets as well as on synthetic uncertain graph databases.

The economic interaction between the countries of the world is gradually strengthening. Among them, the US stock market is a “barometer” of the global economy, which has a huge impact on the global economy. Therefore, it is of great significance to study the data in the US stock market, especially the data mining algorithm of abnormal data. At present, although data mining technology has achieved many research results in the financial field, it has not formed a good research system for time series data in stock market anomalies. According to the actual performance and data characteristics of the stock market anomaly, this paper uses data mining techniques to find the abnormal data in the stock market data, and uses the isolated point detection method based on density and distance to analyze the obtained abnormal data to obtain its implicit useful information. However, due to the defects of traditional data mining algorithms in dealing with stock market anomalies containing uncertain factors, that is, the errors caused by other human factors, this paper introduces the roughening entropy of the uncertainty data and applies its theory to the field of data mining, a data mining algorithm based on rough entropy in the US stock market anomaly is designed. Finally, the empirical analysis of the algorithm is carried out. The experimental results show that the data mining algorithm based on rough entropy proposed in this paper can effectively detect the abnormal fluctuation of time series in the stock market.

The focus of extracting colossal closed itemsets from high dimensional biological datasets has been great in recent times. A massive set of short and average sized mined itemsets do not confine complete and valuable information for decision making. But, the traditional itemset mining algorithms expend a gigantic measure of time in mining a massive set of short and average sized itemsets. The greater interest of research in the field of bioinformatics and the abundant data across the variety of domains paved the way for the generation of the high dimensional dataset. These datasets are depicted by an extensive number of features and a smaller number of rows. Colossal closed itemsets are very significant for numerous applications including the field of bioinformatics and are influential during the decision making. Extracting a huge amount of information and knowledge from the high dimensional dataset is a nontrivial task. The existing colossal closed itemsets mining algorithms for the high dimensional dataset are sequential and computationally expensive. Distributed and parallel computing is a good strategy to overcome the inefficiency of the existing sequential algorithm. Balanced Distributed Parallel Frequent Colossal Closed Itemset Mining (BDPFCCIM) algorithm is designed for high dimensional datasets. An efficient closeness checking method to check the closeness of the rowset and an efficient pruning strategy to snip the row enumeration mining search space is enclosed with the proposed BDPFCCIM algorithm. The proposed BDPFCCIM algorithm is the first distributed load balancing algorithm to mine frequent colossal closed itemsets from high dimensional biological datasets. The experimental results demonstrate the efficient performance of the proposed BDPFCCIM algorithm in comparison with the state-of-the-art algorithms.

Beer is considered one of the top three most popular drinks, being consumed all over the world. During the last few decades, discrimination of beverages and food products has gained attention with many application research studies based on chemical parameters and chemometric or machine learning algorithms. However, no reviews about the evaluation of beers have been reported. Therefore, this review presents applications of beer classification among brands, styles and types, aging, origin, and the prediction of quality attributes of interest based on chemometric, machine learning methods, and chemical parameters. After analyzing the literature, it was found that chemometric and machine learning methods are successful tools for qualitative and quantitative examination of beers. However, more work needs to be done to evaluate machine learning methods and data mining algorithms, such as sampling, feature selection, and advanced classification algorithms.

The standard sequential pattern mining scheme hardly considers the positions of events in a sequence, and therefore it is difficult to focus on more interesting patterns that represent better the causal relationships between events. Without quantifying how close two events are in a sequence, we may fail to evaluate how likely an event is caused by the others from the pattern, which is a severe drawback for some applications like prediction. Motivated by this, we propose the recency-based sequential pattern mining scheme together with a novel measure of pattern interestingness to effectively capture recency as well as frequency. To efficiently extract all the recency-based sequential patterns, we devise a mining algorithm, called Recency-based Frequent pattern Miner (RF-Miner), together with an effective prediction method to evaluate the quality of recency-based patterns in terms of their prediction power. The experimental results show that our RF-Miner algorithm can extract more diverse and important patterns that can be used to make prediction of the next event, and can be more efficiently performed by using the upper bounds of our measure than baseline algorithms.

This article depicts a decision support system (DSS) devoted to the coordinated administration of urban frameworks. This framework defines the information and related treatments normal to a few civil managers and characterizes the necessities and functionalities of the PC devices created to enhance the conveyance, execution, and coordination of metropolitan administrations to the populace. The cooperative framework called Decision Support System for Urban Planning (DSS-UP) is made out of a universal planning and coordination framework. So, it helps the decision-making process, a DSS was created as a learning-based framework gave derivation components that empower urban architect to settle on key decisions as far as specialized meditations on civil foundations. The learning-based framework stores experts_ information and additionally answers for past issues. Preparatory execution comes about demonstrate that DSS-UP viably and effectively underpins the decision-making process identified with overseeing urban foundations by using K-means++ data mining algorithm.

In the past decades, a lot of effort has been put into roadway traffic safety. With the help of data mining, the analysis of roadway traffic data is much needed to understand the factors related to fatal accidents. This paper analyses Fatality Analysis Reporting System (FARS) data set using several data mining algorithms. Here, we compare the performance of four meta-classifiers and four data-oriented techniques known for their ability to handle imbalanced datasets, entirely based on Random Forest classifier. Also, we study the effect of applying several feature selection algorithms including PSO, Cuckoo, Bat and Tabu on improving the accuracy and efficiency of classification. The empirical results show that the Threshold selector meta-classifier combined with over-sampling techniques results were very satisfactory. In this regard, the proposed technique has gained a mean overall Accuracy of 91% and a Balanced Accuracy that varies between 96% to 99% using 7-15 features instead of 50 original features.

This article considered only natural types of texture and then applying the Gabor filter for better classifications. The concept used is to discard the stochastic features to avoid any mixing of feature vector while it is extracting from the image dataset. The proposed approach has considered the Gabor filter for texture recognition primarily but with the combined method of spatial width and orientation to get the optimal alignment, this optical alignment mine the maximum feature vector by applying the REP algorithm over the data mined from the texture. This will result in better accuracy in the results. Initially, the frequency response over the surface due to applying Gabor filter has been calculated and then the work proceeded in a manner that first natural images are loaded into the MATLAB tool then it is preprocessed, and then final classifications are performed for final results. The primarily concentrated over texture information of image datasets rather than the multispectral information along with REP regression algorithm to do actual mining of feature vectors. Unlike the conventional approach of the Gabor filter, this article focuses on the variance and spatial relationship between two or more than two pixels. The deviation calculated is used for normalizing the feature vectors, and the accuracy can be hence increase using the proposed commuted technique.

In order to address the problems of low precision, long time-consuming and low recall rate in mining complex attribute medical data in medical information, an intelligent mining algorithm for complex attribute medical data based on deep learning is proposed. Discretized medical data with complex attributes and converted it into a data type suitable for deep learning research, the convolutional neural network is used to analyze the association mapping relationship between complex attribute medical data sets and extract association rules of data. According to the degree of association between complex attribute medical data sets in multi-dimensional subspace to realize the effective mining of complex attribute medical data. The results show that the proposed algorithm takes less time and can extract association rules accurately, the data priority control efficiency is higher, the data mining accuracy is better, and the data mining recall rate is much higher than other methods, which verifies the feasibility of the proposed algorithm.

Data stream is the huge amount of data generated in various fields, including financial processes, social media activities, Internet of Things applications, and many others. Such data cannot be processed through traditional data mining algorithms due to several constraints, including limited memory, data speed, and dynamic environment. Concept Drift is known as the main constraint of data stream mining, mainly in the classification task. It refers to the change in the data stream underlining distribution over time. Thus, it results in accuracy deterioration of classification models and wrong predictions. Spam emails, consumer behavior changes, and adversary activates, are examples of Concept Drift. In this paper, a Concept Drift detection model is introduced, Concept Drift Detection Model (CDDM). It monitors the accuracy of the classification model over a sliding window, assuming the decline in accuracy indicates a drift occurrence. A modification over CDDM is a weighted version of the CDDM as W-CDDM.Both models have evaluated against two real datasets and four artificial datasets. The experimental results of abrupt drift show that CDDM, W-CDDM outperforms the other models in the dataset of 100K and 1M instances, respectively. Regarding gradual drift, the W-CDDM overtook the rest in terms of accuracy, run time, and detection delays in the dataset of 100 K instances. While in the dataset of 1M instances, CDDM has got the highest accuracy using the NB classifier. Moreover, W-CDDM achieves the highest accuracy on real datasets.

The purpose of this study is to evaluate whether Tahfiz activities and learning outcomes are effective or not. The data processed in this study were data on tahfiz activities and data on student learning outcomes in class XI (eleven) totaling 42 data sourced from memorization of tahfiz, tahfiz grades, and student grades in Madrasah Aliyah Negeri 1 Bukittinggi. Based on the analysis of the data, this classification uses one of the methods of the Data Mining algorithm, K-Means Clustering. K-Means Clustering algorithm works based on the grouping method, In this data mining technique consists of data testing and training data with the input of the number of memorization of tahfiz, and the value of tahfiz as well as learning outcomes. The results of this study the school can determine how influential this activity tahfiz on student grades.

Elections in Indonesia from period to period have undergone some changes. Elections legislative candidates not determined voters, but instead became a political elite authority in accordance with the order of the list of legislative candidates and their number sequence. To perform a prediction one of them with data mining. Data mining can be applied in the political sphere for example to predict the results of the legislative election and others. K-nearest neighbor algorithm is one of the data mining algorithm that performs classification based on learning object against which are closest to the object. Election-related research has been done with the k-nearest neighbor algorithm, but accuracy is obtained that method is still too low, so it takes an additional algorithm to improve accuracy. In this study, the proposed method, namely the method of k-nearest neighbor method combined with backward elimination as a selection of features. The dataset that will be used in the study comes from the KPU Sidoarjo that has special attributes 1 and 13 regular attributes. From the results of the analysis and computation of some methods, it can be concluded that the method of k-nearest neighbor method combined with backward elimination produced some conclusions. First, of the 14 attributes in the dataset, retrieved 8 most influential attribute. Second, the best accuracy are of 96.03% when k = 2 and tested by 10 fold cross validation.

As one of the important research directions in the spatial data mining, spatial co-location pattern mining aimed at finding the spatial features whose the instances are frequent co-locate in neighbouring domain. With the introduction of fuzzy sets into traditional spatial co-location pattern mining, the research on fuzzy spatial co-location pattern mining has been deepened continuously, which extends traditional spatial co-location pattern mining to deal with fuzzy spatial objects and discover their laws of spatial symbiosis. In this paper, the operation principle of a classical join-based algorithm for mining spatial co-location patterns is briefly described firstly. Then, combining with the definition of classical participation rate and participation degree, a novel hesitant fuzzy spatial co-location pattern mining algorithm is proposed based on the establishment of the hesitant fuzzy participation rate and hesitant fuzzy participation formula according to the characteristics in fusion of hesitant fuzzy set theory, the score function and spatial co-location pattern mining. Finally, the proposed algorithm is written and implemented based on Python language, which uses a NumPy system to the expansion of the open source numerical calculation. The Python program of the proposed algorithm includes the method of computing hesitant fuzzy membership based on score function, the implementation of generating k-order candidate patterns, k-order frequent patterns and k-order table instances. A hesitant fuzzy spatial co-location pattern mining experiment is carried out and the experimental results show that the proposed and implemented algorithm is effective and feasible.

With the popularity of mobile devices equipped with positioning devices, it is convenient to obtain enormous amounts of trajectory data. The development promotes the study of extracting moving patterns from trajectory data of moving objects. One such pattern is the convoy, which refers to a group of objects moving together for a period of time. The existing convoy mining algorithms have a large time cost because they adopt a density-based clustering algorithm over global objects. In this paper, we propose an efficient convoy mining algorithm (ECMA) that adopts the divide-and-conquer methodology. A block-based partition model (BP-Model) is designed to divide objects into multiple maximized connected nonempty block areas (MOBAs). The convoy mining problem is then solved by processing each MOBA sequentially, which significantly reduces the time cost of convoy mining. In the experiments, we evaluate the performance of our algorithm on real-world datasets. The results show that the ECMA is more efficient than existing convoy mining algorithms.

Frequent Itemset Mining (FIM) includes developing data mining algorithms to discover interesting and productive patterns from a variety of databases. There are several FIM algorithms available, but their use can be different and depend on two major factors, one is the database used, and another is the implementation technique. The database used in FIM can be certain or uncertain, and the implementation technique can be sequential or parallel. In this paper, the techniques of generating frequent itemsets by different algorithms on certain, uncertain, and combinations of certain and uncertain databases are discussed. The performances of algorithms are measured based on the time taken and the number of frequent itemsets generated by each algorithm. To support this work, a demonstration kit has been developed called Frequent Itemset Mining Algorithms Kit (FIMAK) which take certain or uncertain database as input, executes the selected algorithm on that database, and produce results in the form of frequent items and time taken by the algorithm. FIMAK is also used for transforming a probabilistic database into a fuzzy database.

The emergence of various data mining algorithms and its application to various fields include medical imaging, network traffic analysis, environment system etc. Environment system now a day is the most important area of people’s concern in today’s world since it has daily impact on human beings life. May it be earthquake, soil erosion, deforesting, increasing summer temperature, rain fall density/intensity, flood occurrences and the most important is the impact of all these ES factors to directly and indirectly on the human beings and their behaviour. The capability of data mining algorithms of finding pattern in a data can be applied to Environment System data which is largely distributed, heterogeneous, sparse, multidimensional and heterogeneous. This paper gives a brief survey of essential steps, related algorithms and details processes that deals in designing and dealing with ES data that are essential in development of data mining tool for finding and interpreting patterns in environment system data set. The design process of ES Tool using data mining techniques ranges from processing of rough data sets to transforming it into pattern for analysis.

High Utility Itemset Mining aims at extracting high utility patterns from a given database. Most of the mining algorithms are designed for static datasets. However, the real-life datasets continuously evolve with incremental data. In this paper, we present a mining algorithm which uses efficient data structures and pruning conditions to mine and maintain high utility patterns across incremental datasets. Several experiments are conducted to show the efficacy of the proposed algorithm.