# An Approach to Acquire the Constraints Using Panel Big Data Hybrid Association Rule and Discretization Process for Breast Cancer Prediction

Authors: Ahmad Althunibat; Wael Alzyadat; Mohammad Muhairat; Aysh Alhroob; Ikhlas H. Almukahel
Journal: Journal of Healthcare Engineering
 (2021)

---

## Abstract

In recent years, big data has become an important branch of computer science. However, without AI, it is difficult to dive into the context of data as a prediction term, relying on a large feature of improving the process of prediction is connected with big data modelling, which appears to be a significant aspect of improving the process of prediction. Accordingly, one of the basic constructions of the big data model is the rule-based method. Rule-based method is used to discover and utilize a set of association rules that collectively represent the relationships identified by the system. This work focused on the use of the Apriori algorithm for the investigations of constraints from panel data using the discretization preprocess technique. The statistical outcomes are associated with the improved preprocess that can be applied over the transaction and it can illustrate interesting rules with confidence approximately equal to one. The minimum support provided to the present rule considers constraint as a milestone for the prediction model. The model makes an effective and accurate decision. In nowadays business, several guidelines have been produced. Moreover, the generation method was upgraded because of an association data algorithm that works for dissimilar principles of the structures compared with fewer breaks that are delivered by the discretization technique.


---

## Body

## 1. Introduction

Big data analysis techniques are emerging trends regarding the issues related to the Vs of the big data and the optimal and effective decisions [1]. Big data volume can be used to extract valued decisions and achievement plan depending on prediction. However, the large volume and complex variety limit the applicability of many well-known approaches, such as principal component analysis, singular value decomposition, spectral analysis, and other decision support system, which was developed to facilitate problem-solving in a complex prediction process [2]. Big data analysis concerns discovering relevant patterns from the challenging datasets towards relation development and valued data extraction depend on the computation and statistical process [3].The discretization applied for panel data attributes before extracting the association rules to overcome the main limitation of an association rule acquisition is that all the attributes must be categorical [4]. Even though discretization methods have two issues, the first one is to decide the correct number of intervals to apply because using too few intervals will make the data and result incomplete and introduce information loss [5]. On the other hand, using too many intervals, the data representation will be lower than the required level, resulting in noneffective intervals values. The second issue is that discretization methods make a clear theory about data distributions, and they do not work well when their assumptions are despoiled [4]. We identify the numerical correlations among attributes in the provided data to overcome the discretization issues and find repeated sequences of events for selecting relevant information about the relationships based on weight (the more effective value of an attribute) to uncover meaningful and hidden patterns by reducing the running time which in turns approaches the velocity aspect of big data.In this investigation, we are going to introduce the latest method to further reprocess the association rules that are constructed based on the discretization technique, in addition to introducing its NP-complete. Therefore, the splitting of a continuous range of values in different levels of the interval is required for the discretization of the numerical features to perform an efficient search for rule induction. The values are further subdivided for the different data features, and visualization of the big data model is the main objective of the present work.To assess the performance of the proposed approach, we have presented an experimental study using UCI datasets. We have developed the following studies: first, we have compared our approach with the original Apriori algorithm to analyze the performance of the newly introduced approach. Second, we have compared the performance of our approach with two other approaches developed by Apriori. Third, we showed the obtained results from the comparison from a time-consuming point of view for hybrid discretization association rules. Finally, we have analysed the scalability of the approach.This research provides a new approach that depends on the concept of the discretization process of panel data to generate associated rules applied to discover and identify attribute-value conditions. Also, this research applied unsupervised learning model to define the interconnections among the attributes in the dataset, not only ordinal relationbut also focused on co-occurrences of attribute values to discover hidden patterns which lead to being much more meaningful..The rest of this article is arranged as follows: Section2 reviews the background and related works, section 3 presents the research methodology, section 4 summarizes the results, and section 5 illustrates the conclusions.


## 2. Background and Related Works

Big data became a technological cultural and scholarly phenomenon that led to maximizing computation power and algorithmic accuracy to identify patterns on a large dataset, using artificial intelligence techniques to offer higher form objectivity and accuracy with an aura of truth [6].


### 2.1. Panel Big Data

The IDC report in 2011 defined big data based on prime properties. The definition is big data technologies mainly describing a new process for the generation of architectures and technologies. The IDC report provides extracted value from huge volumes of data wide variety, through discovery and high-velocity capture analysis [7].The characteristics of big data can be summarized in four words: volume, capacity, speed (fast growth; big data is a hot topic because of its diversity; many modalities), and great value, but low speed and density. Big data is less expensive to store and access and more cost-effective [8]. The panel data concept describes the multiple phenomena that can be observed for multiple periods. The mean consideration for the data is different types of phenomena that can be observed over multiple periods. The method is different for all sampling units, individual, data points, and it is observed in more conditions compared with the one-time period [9].Panel big data initiates with heterogeneous numerical data, large volume, and autonomous sources that are decentralized and distributed for the control and can be developed to explore complex and evolving relationships between the whole data [3]. The first process of greatest data investigation entails all stages of processing that declare excellence and the setup of data as necessary for the process [10]. The data preprocessing process is appropriately accomplished to practice the large dataset for the requirements that were modelled through dissimilar kinds of algorithm [4]. The application of the data processing process is to produce data transformation, cleansing, integration, and normalization. Afterwards, the present work aims to reduce the data complexity through the featured selection that is discretization [5]. Big data preprocessing is emerging as a challenging task due to the complexity of the reduction of dimensionality [11].


### 2.2. Discretization

The simple data reduction processing is discretization. The preprocessing of data converts it from the fully developed and huge range of different continuous values. The values selected in the discretization are suitable datasets for the discrete transaction values [6]. The main process involved here was data representations based on categories according to the comprehensive dictionary for the prediction of different tasks. The maximum information is provided for the original and continuous possible features [7].The numerical big data is different in all the scenarios and follows three types of formats including nominal, discrete, and continuous. The ordinal data types are discrete and continuous data for certain values. In the case of nominal values, they are not holding complete order. The separate standards can be labelled by way of the method of intermissions taking a nonstop sequence of standards [12].The quality of nonstop standards is dissimilar and countless. The feature of continuous values is infinitely common for discretization. The discrete values split according to different intervals and the continuous values have series of different values. The splitting of values follows algorithms, and in the numerical domain intervals, the values are different for each case [9].Data discretization is a preprocessing step used in big data analysis that assures quality and the format of the data through different algorithms [13]. Discretization includes procedures related to the modification of the original data form. The common discretization consists of different continuous and splitting obtained discrete features that are required by the algorithm and numerical domain into intervals. The data discretization is an important preprocessing technique used for knowledge discovery and data classification [14]. The discretization of algorithms can be used for the improvement of induced models and the extraction of knowledge from the designed models. Some discretization techniques can be used and the common method for the data processing is related to the equal frequency and an equal width. The procedure contains the formation of a definite number of breaks having an equal scope and a similar sum of transactions correspondingly.The key procedure accepted data investigation needs the circumstances for the equal sum of transactions, similar size, and stated sum of intervals. Algorithm discretization can be taken towards the information approaches due to the command into progress the encouraged models and information removal. Several methods of discretization are going to construct. The usual technique is used for the same width and the frequency is the same, which contain and generate the sum of intervals. This technique is stated with the similar sum of transaction correspondingly and transforming numerical input or output variables to have discrete ordinal labels [15]. On contrary, there are two types of discretization including univariate and multivariate.The feature of continuous quantities and the univariate discretization have an impact on the multivariate discretization and consider the number of features. The process of univariate discretization provides more advantages for single continuous features and multivariate discretization is used for multivariate discretization. For the multivariate discretization, there are multiple features. The univariate discretization provides more advantages due to simple processing and the discovery is associated with the rules. The available features in the present analysis are used for the determination of quantities [13]. The discretization provides unique transactions regarding the algorithms for the investigation of different details from the dataset.


### 2.3. Association Rules Induction

Association rules are used to represent and identify dependencies between items in a dataset, which are applied to a large volume of a dataset through the discretization process, which enhances the performance and speed. The Apriori algorithm is popular for frequently collecting all of the item sets. The work in [9] identified the limitations of the original Apriori algorithm, in which it wastes time scanning data in datasets. The proposed algorithm provides an improvement over the Apriori algorithm through scanning for some transactions only, which in turn reduces the waste of time. The results are then compared with the experimental data that can be applied to the original Apriori algorithm.The first planned suggestion was the removal of labelled existing and unseen relations regarding the dissimilar acquired substances in some transactional files [9]. The rule of association can be definite on behalf of the relationship among X and Y and the relationship is in the procedure X! Y. Due to the dynamic updating of the relationship between the items X and Y in a given dataset. The intersection between X and Y processes the unfilled set. It consists of two significant methods, controls a link among the transaction of items, and supports every degree in the dissimilar self-assurance [15]. The sustenance for regulation X! Y is assumed in the database and holds equally X and Y, P (X U Y). In the delivered dataset, the self-assurance can be clear for the regulation X! Y that is a measure for the transactions in the assumed database enclosing X and Y.The primary goal of big data analysis is to extract new features of the extract association rule in order to improve accuracy and produce useful data. In [16, 17], the author extracted rules using fuzzy rules and integrated them with MapReduce, which has a good influence on big data analysis in terms of accuracy and performance. Additionally, a hybrid method is used for extracting rules and improving the accuracy of important data using machine learning. Apriori algorithms are used in [18] to improve the reduction of time as consumed through 67.38% compared with the original Apriori [19]. An Approach for documentation of dissimilar instructions linked to the transactional datasets is shown in [11]. The procedure increases the unique Apriori for the number of database tests, recollection consumption, and interestingness of the guidelines.The process enables the scanning of the database by multiple times. Therefore, therefore the growth arm (association mining rule), frequent Growth Pattern (FP). The algorithm is identified as an effective pattern for mining with the growth of database growth. Moreover, the same time expressions have some limitations. Urmila [20] worked to implement Apriori through MPI and showed parallelization as a suitable solution for increasing the performance of the Apriori algorithm in the present work process of discretization prepared transaction data and then applied it for Apriori algorithm. Table 1 illustrates most related work considered on association rules.Table 1
Association rules applied for big data analysis.
AuthorWorksDescriptionXu, yu et al., 2019 [21]An improved Apriori algorithm research in massive data environmentUnder the enormous data environment, the revised Apriori algorithm may effectively minimize the algorithm execution time and increase the efficiency of data mining.Tan, 2018 [22]Improving association rule mining using clustering-based discretization of numerical dataAlthough discretization methods were used, the methodology concentrated on descriptive factions, which improved the quality of association rule mining.Rajendran et al., 2010 [23]Hybrid medical image classification using association rule mining with decision tree algorithmFor effective medical diagnosis, use preprocessing, feature extraction, association rule mining, and hybrid classifier.Chaves et al., 2013 [24]Integrating discretization and association rule-based classification for Alzheimer’s disease diagnosisDiscretization for feature selection and an association rule for classification are combined.


## 2.1. Panel Big Data

The IDC report in 2011 defined big data based on prime properties. The definition is big data technologies mainly describing a new process for the generation of architectures and technologies. The IDC report provides extracted value from huge volumes of data wide variety, through discovery and high-velocity capture analysis [7].The characteristics of big data can be summarized in four words: volume, capacity, speed (fast growth; big data is a hot topic because of its diversity; many modalities), and great value, but low speed and density. Big data is less expensive to store and access and more cost-effective [8]. The panel data concept describes the multiple phenomena that can be observed for multiple periods. The mean consideration for the data is different types of phenomena that can be observed over multiple periods. The method is different for all sampling units, individual, data points, and it is observed in more conditions compared with the one-time period [9].Panel big data initiates with heterogeneous numerical data, large volume, and autonomous sources that are decentralized and distributed for the control and can be developed to explore complex and evolving relationships between the whole data [3]. The first process of greatest data investigation entails all stages of processing that declare excellence and the setup of data as necessary for the process [10]. The data preprocessing process is appropriately accomplished to practice the large dataset for the requirements that were modelled through dissimilar kinds of algorithm [4]. The application of the data processing process is to produce data transformation, cleansing, integration, and normalization. Afterwards, the present work aims to reduce the data complexity through the featured selection that is discretization [5]. Big data preprocessing is emerging as a challenging task due to the complexity of the reduction of dimensionality [11].


## 2.2. Discretization

The simple data reduction processing is discretization. The preprocessing of data converts it from the fully developed and huge range of different continuous values. The values selected in the discretization are suitable datasets for the discrete transaction values [6]. The main process involved here was data representations based on categories according to the comprehensive dictionary for the prediction of different tasks. The maximum information is provided for the original and continuous possible features [7].The numerical big data is different in all the scenarios and follows three types of formats including nominal, discrete, and continuous. The ordinal data types are discrete and continuous data for certain values. In the case of nominal values, they are not holding complete order. The separate standards can be labelled by way of the method of intermissions taking a nonstop sequence of standards [12].The quality of nonstop standards is dissimilar and countless. The feature of continuous values is infinitely common for discretization. The discrete values split according to different intervals and the continuous values have series of different values. The splitting of values follows algorithms, and in the numerical domain intervals, the values are different for each case [9].Data discretization is a preprocessing step used in big data analysis that assures quality and the format of the data through different algorithms [13]. Discretization includes procedures related to the modification of the original data form. The common discretization consists of different continuous and splitting obtained discrete features that are required by the algorithm and numerical domain into intervals. The data discretization is an important preprocessing technique used for knowledge discovery and data classification [14]. The discretization of algorithms can be used for the improvement of induced models and the extraction of knowledge from the designed models. Some discretization techniques can be used and the common method for the data processing is related to the equal frequency and an equal width. The procedure contains the formation of a definite number of breaks having an equal scope and a similar sum of transactions correspondingly.The key procedure accepted data investigation needs the circumstances for the equal sum of transactions, similar size, and stated sum of intervals. Algorithm discretization can be taken towards the information approaches due to the command into progress the encouraged models and information removal. Several methods of discretization are going to construct. The usual technique is used for the same width and the frequency is the same, which contain and generate the sum of intervals. This technique is stated with the similar sum of transaction correspondingly and transforming numerical input or output variables to have discrete ordinal labels [15]. On contrary, there are two types of discretization including univariate and multivariate.The feature of continuous quantities and the univariate discretization have an impact on the multivariate discretization and consider the number of features. The process of univariate discretization provides more advantages for single continuous features and multivariate discretization is used for multivariate discretization. For the multivariate discretization, there are multiple features. The univariate discretization provides more advantages due to simple processing and the discovery is associated with the rules. The available features in the present analysis are used for the determination of quantities [13]. The discretization provides unique transactions regarding the algorithms for the investigation of different details from the dataset.


## 2.3. Association Rules Induction

Association rules are used to represent and identify dependencies between items in a dataset, which are applied to a large volume of a dataset through the discretization process, which enhances the performance and speed. The Apriori algorithm is popular for frequently collecting all of the item sets. The work in [9] identified the limitations of the original Apriori algorithm, in which it wastes time scanning data in datasets. The proposed algorithm provides an improvement over the Apriori algorithm through scanning for some transactions only, which in turn reduces the waste of time. The results are then compared with the experimental data that can be applied to the original Apriori algorithm.The first planned suggestion was the removal of labelled existing and unseen relations regarding the dissimilar acquired substances in some transactional files [9]. The rule of association can be definite on behalf of the relationship among X and Y and the relationship is in the procedure X! Y. Due to the dynamic updating of the relationship between the items X and Y in a given dataset. The intersection between X and Y processes the unfilled set. It consists of two significant methods, controls a link among the transaction of items, and supports every degree in the dissimilar self-assurance [15]. The sustenance for regulation X! Y is assumed in the database and holds equally X and Y, P (X U Y). In the delivered dataset, the self-assurance can be clear for the regulation X! Y that is a measure for the transactions in the assumed database enclosing X and Y.The primary goal of big data analysis is to extract new features of the extract association rule in order to improve accuracy and produce useful data. In [16, 17], the author extracted rules using fuzzy rules and integrated them with MapReduce, which has a good influence on big data analysis in terms of accuracy and performance. Additionally, a hybrid method is used for extracting rules and improving the accuracy of important data using machine learning. Apriori algorithms are used in [18] to improve the reduction of time as consumed through 67.38% compared with the original Apriori [19]. An Approach for documentation of dissimilar instructions linked to the transactional datasets is shown in [11]. The procedure increases the unique Apriori for the number of database tests, recollection consumption, and interestingness of the guidelines.The process enables the scanning of the database by multiple times. Therefore, therefore the growth arm (association mining rule), frequent Growth Pattern (FP). The algorithm is identified as an effective pattern for mining with the growth of database growth. Moreover, the same time expressions have some limitations. Urmila [20] worked to implement Apriori through MPI and showed parallelization as a suitable solution for increasing the performance of the Apriori algorithm in the present work process of discretization prepared transaction data and then applied it for Apriori algorithm. Table 1 illustrates most related work considered on association rules.Table 1
Association rules applied for big data analysis.
AuthorWorksDescriptionXu, yu et al., 2019 [21]An improved Apriori algorithm research in massive data environmentUnder the enormous data environment, the revised Apriori algorithm may effectively minimize the algorithm execution time and increase the efficiency of data mining.Tan, 2018 [22]Improving association rule mining using clustering-based discretization of numerical dataAlthough discretization methods were used, the methodology concentrated on descriptive factions, which improved the quality of association rule mining.Rajendran et al., 2010 [23]Hybrid medical image classification using association rule mining with decision tree algorithmFor effective medical diagnosis, use preprocessing, feature extraction, association rule mining, and hybrid classifier.Chaves et al., 2013 [24]Integrating discretization and association rule-based classification for Alzheimer’s disease diagnosisDiscretization for feature selection and an association rule for classification are combined.


## 3. Proposed Approach

This work proposed a new approach that consists of six different components including the transaction, panel data, discretization, extract rules, evaluation rules, and components evaluation. The generation of constraints is based on different rules including extract rule and component evaluation. The rule and accurate component are evaluated towards the generation of facts and constraints. Approach main components are shown in Figure1.Figure 1
The main components of the proposed approach.


### 3.1. Component 1: Panel Big Data

The driving concepts of big data as a platform is provided by panel data for multidimensional data that involves measurements over time ranges and covers the velocity and enables the identification of the differences for techniques including data mining and data science. The use of panel data provides many advantages [23], such as flexibility, controlling for individual heterogeneity of big data, extraction of more information from the data set, and less risk for the correlation that is between variables [25].


### 3.2. Component 2: Transaction

The “dynamics of adjustment” provides a solution for different data sets related to the extraction of rules and reducing dataset scanning [26]. The transaction technique follows the panel data.


### 3.3. Component 3: Discretization

The importance of the discretization of an algorithm is based on balanced and unbalanced datasets. The data can be adapted to improve the extraction of knowledge and acquiring of models. The other unsupervised machine learning process is linked to the well-extracted processes for equal width and equal frequency. Table2 describes the accurate association rule performance indicator. The main purpose of using Algorithm 1 was to show the discretization algorithms.Table 2
Accurate Association rule performance indicator.
RuleConfidence measuresReferenceRule A⟶B A || confidence({sup (AUB))/(max{sup (A); sup (b)}) = min{p (A|B); p (B|A)}[24]Rule A ⟶ B kulczynski0 : 5∗((A|B) + (B|A))[24]ule A ⟶ B liftP (A∪B)/p (A) p (B) = confidence (A⇒B)/p (B)[24]Pseudo-Algorithm 1: Discretization.
Result: create an ordered list of values of the featureInitialization;for each value;Compute frequencies of occurrence of objects with respect to each class; assign the class label to every value using procedureASSIGN;Create the intervals from values using a procedureINTERVAL; create continuous coverage of the feature;


### 3.4. Component 4: Extract Rules

The Apriori algorithm is applied by a component that can be used to find the different and frequent item sets. The items can be generated through association rules. These components provide benefits such as detection of unknown relation, production of results, prediction, and decision-making process to counting their frequencies. The Apriori algorithm is shown in Algorithm2.Pseudo-Algorithm 2: Original Apriori algorithm
Result: Rule ListInitialization;Def initial (confidence), (support), (item set of size kS),Rk: rule item set of sizek;Def Fk frequent itemset of sizek item;for each transaction in panel data;Increment the count of all rule in CL that is rule list Fk+add a rule in CL with min support.Return Rk;


### 3.5. Component 5: Evaluation Rule

The minimum support is provided by the evaluation rule that leads to some type of specified minimum and specified maximum confidence for the selected dataset at the same time. Support (s), about the association rule, can be clear according to the ratio linked to the records and that encompassX [Y. The relationship displays the entire number of records in the database [9]. Assurance (c) for the association rule can be clear on the foundation of the ratio of the sum of transactions. These numbers hold X [Y for all the number of records that encompass X, further; the previously mentioned percentage is linked to the threshold of self-assurance. The interesting situations are association rule X->Y can be produced. Assurance is a measurement of the strength of the association rules.


### 3.6. Component 6: Accurate Rule

The association rule provides some performance indicators of support and confidence. Several rules are generated that are still not efficient. The difference in the evaluation standards for the association rules is that different measures provide different characteristics. The confidence measure is the most commonly used in association rule mining [27]. Lift measure is mainly the ratio of two possibilities in which the target possibility is divided by the average possibility [33]. In the present case, our data provides two divisions including healthy and control. Figure 2 illustrates the roadmap component’s process.Figure 2
Roadmap components process.


## 3.1. Component 1: Panel Big Data

The driving concepts of big data as a platform is provided by panel data for multidimensional data that involves measurements over time ranges and covers the velocity and enables the identification of the differences for techniques including data mining and data science. The use of panel data provides many advantages [23], such as flexibility, controlling for individual heterogeneity of big data, extraction of more information from the data set, and less risk for the correlation that is between variables [25].


## 3.2. Component 2: Transaction

The “dynamics of adjustment” provides a solution for different data sets related to the extraction of rules and reducing dataset scanning [26]. The transaction technique follows the panel data.


## 3.3. Component 3: Discretization

The importance of the discretization of an algorithm is based on balanced and unbalanced datasets. The data can be adapted to improve the extraction of knowledge and acquiring of models. The other unsupervised machine learning process is linked to the well-extracted processes for equal width and equal frequency. Table2 describes the accurate association rule performance indicator. The main purpose of using Algorithm 1 was to show the discretization algorithms.Table 2
Accurate Association rule performance indicator.
RuleConfidence measuresReferenceRule A⟶B A || confidence({sup (AUB))/(max{sup (A); sup (b)}) = min{p (A|B); p (B|A)}[24]Rule A ⟶ B kulczynski0 : 5∗((A|B) + (B|A))[24]ule A ⟶ B liftP (A∪B)/p (A) p (B) = confidence (A⇒B)/p (B)[24]Pseudo-Algorithm 1: Discretization.
Result: create an ordered list of values of the featureInitialization;for each value;Compute frequencies of occurrence of objects with respect to each class; assign the class label to every value using procedureASSIGN;Create the intervals from values using a procedureINTERVAL; create continuous coverage of the feature;


## 3.4. Component 4: Extract Rules

The Apriori algorithm is applied by a component that can be used to find the different and frequent item sets. The items can be generated through association rules. These components provide benefits such as detection of unknown relation, production of results, prediction, and decision-making process to counting their frequencies. The Apriori algorithm is shown in Algorithm2.Pseudo-Algorithm 2: Original Apriori algorithm
Result: Rule ListInitialization;Def initial (confidence), (support), (item set of size kS),Rk: rule item set of sizek;Def Fk frequent itemset of sizek item;for each transaction in panel data;Increment the count of all rule in CL that is rule list Fk+add a rule in CL with min support.Return Rk;


## 3.5. Component 5: Evaluation Rule

The minimum support is provided by the evaluation rule that leads to some type of specified minimum and specified maximum confidence for the selected dataset at the same time. Support (s), about the association rule, can be clear according to the ratio linked to the records and that encompassX [Y. The relationship displays the entire number of records in the database [9]. Assurance (c) for the association rule can be clear on the foundation of the ratio of the sum of transactions. These numbers hold X [Y for all the number of records that encompass X, further; the previously mentioned percentage is linked to the threshold of self-assurance. The interesting situations are association rule X->Y can be produced. Assurance is a measurement of the strength of the association rules.


## 3.6. Component 6: Accurate Rule

The association rule provides some performance indicators of support and confidence. Several rules are generated that are still not efficient. The difference in the evaluation standards for the association rules is that different measures provide different characteristics. The confidence measure is the most commonly used in association rule mining [27]. Lift measure is mainly the ratio of two possibilities in which the target possibility is divided by the average possibility [33]. In the present case, our data provides two divisions including healthy and control. Figure 2 illustrates the roadmap component’s process.Figure 2
Roadmap components process.


## 4. Experiments

R package tool is used in order to implement the experiments with dataset gained from UCI machine learning repository was used [28]. The prime objective and motive for the use of UCI are to first verify the proper working of a dataset and then to perform several preprocessing steps as already mentioned in the above discussion. The aim was to prepare the transaction for the Apriori application. After identifying the transaction, the process was carried out further and the discredited Apriori was investigated. Eleven independent experiments are conducted for the comparison of the discretization Apriori approach with the original Apriori approach.


### 4.1. Dataset

Coimbra breast cancer dataset was used and the data were collected from 116 randomly selected females whose age was at least 24 years old. The sample is divided into 64 patients and 52 controls as given in Table3.Table 3
Features of Coimbra breast cancer dataset.
Feature in dataDescriptionTypeAge (years)Age of the patientNumericMCP-1 (pg/dL)Monocyte chemoattractant proteinNumericBMI (kg/m2)Body mass indexNumericResistin (ng/mL)Serum values of resistinNumericAdiponectin (μg/mL)Serum values of adiponectinNumericHOMAHomeostasis model assessmentNumericLeptin (ng/mL)Serum values of leptinNumericGlucose (mg/dL)Serum glucose levelsNumericInsulin (μU/mL)Plasma levels of insulinNumeric


### 4.2. Implementation

This work aims to achieve constraints from accuracy association rules by applying the discretization algorithms that work to build models. The models are allowing for predicting breast cancer based on age and metabolic parameters. The dataset contains integer and numeric variables. We apply the discretization process in two steps. The first step is to get the cuts and the threshold values from all the segments. The second step is to use the threshold values to obtain different and categorical variables to generate the firm rules for the association and the experimental approach. The Apriori algorithm was implemented in a statistical programming language. The number ofR packages is used in Table 4. All the numerical features in the present research are used for generating the association rules. These rules can use a wide range of values for the analysis. The reduction in these numbers is for the generated rules and this process is necessary for the discretization of all features. The process is based on the splitting of values range. The numbers are manageable numbers for the intervals. The discrete values can be classified into two steps.Table 4
Package used for applying the approach.
R packagesPurposedReadr [29]Read rectangular text dataDplyr [30]Data manipulationTidyr [31]Work with features (column) and raw (observation)Arules [32]Apply induction association ruleStep 1.
The same numbers are observed for the intervals and features of the transactions.Step 2.
The overlap of two adjacent intervals generates a cut point (the superior boundary of the first and inferior boundary of the next) and it was located at the center point of the overlapping region. The intervals were then merged and formed a unique interval. The interval is close to the mean values.


### 4.3. Time-Consuming Log (N)

Ten types of independent runs were developed on the original Apriori and discretization approaches. The performance was examined by the Apriori algorithm under various conditions. The process aims to determine and analyze the practical performance of the Apriori algorithm. The analysis defines the degree of discretization for the speedup of the achieved results as shown in Table5. Figure 3 clarifies the enhanced time consumption of the original Apriori algorithm.Table 5
Result of the independent running for the Apriori algorithm.
Original Apriori0.60.450.430.430.480.450.370.380.40.35Discretization Apriori0.480.370.390.390.420.350.30.30.350.29Figure 3
The enhanced time consuming of the original Apriori algorithm.Figure 3 illustrates the test results and comparison between Apriori algorthim and the traditional algorithm, using eleven independent experiments. The results shows that discretization apriori algorithm has a positive effect on enhancing time consuming.


## 4.1. Dataset

Coimbra breast cancer dataset was used and the data were collected from 116 randomly selected females whose age was at least 24 years old. The sample is divided into 64 patients and 52 controls as given in Table3.Table 3
Features of Coimbra breast cancer dataset.
Feature in dataDescriptionTypeAge (years)Age of the patientNumericMCP-1 (pg/dL)Monocyte chemoattractant proteinNumericBMI (kg/m2)Body mass indexNumericResistin (ng/mL)Serum values of resistinNumericAdiponectin (μg/mL)Serum values of adiponectinNumericHOMAHomeostasis model assessmentNumericLeptin (ng/mL)Serum values of leptinNumericGlucose (mg/dL)Serum glucose levelsNumericInsulin (μU/mL)Plasma levels of insulinNumeric


## 4.2. Implementation

This work aims to achieve constraints from accuracy association rules by applying the discretization algorithms that work to build models. The models are allowing for predicting breast cancer based on age and metabolic parameters. The dataset contains integer and numeric variables. We apply the discretization process in two steps. The first step is to get the cuts and the threshold values from all the segments. The second step is to use the threshold values to obtain different and categorical variables to generate the firm rules for the association and the experimental approach. The Apriori algorithm was implemented in a statistical programming language. The number ofR packages is used in Table 4. All the numerical features in the present research are used for generating the association rules. These rules can use a wide range of values for the analysis. The reduction in these numbers is for the generated rules and this process is necessary for the discretization of all features. The process is based on the splitting of values range. The numbers are manageable numbers for the intervals. The discrete values can be classified into two steps.Table 4
Package used for applying the approach.
R packagesPurposedReadr [29]Read rectangular text dataDplyr [30]Data manipulationTidyr [31]Work with features (column) and raw (observation)Arules [32]Apply induction association ruleStep 1.
The same numbers are observed for the intervals and features of the transactions.Step 2.
The overlap of two adjacent intervals generates a cut point (the superior boundary of the first and inferior boundary of the next) and it was located at the center point of the overlapping region. The intervals were then merged and formed a unique interval. The interval is close to the mean values.


## 4.3. Time-Consuming Log (N)

Ten types of independent runs were developed on the original Apriori and discretization approaches. The performance was examined by the Apriori algorithm under various conditions. The process aims to determine and analyze the practical performance of the Apriori algorithm. The analysis defines the degree of discretization for the speedup of the achieved results as shown in Table5. Figure 3 clarifies the enhanced time consumption of the original Apriori algorithm.Table 5
Result of the independent running for the Apriori algorithm.
Original Apriori0.60.450.430.430.480.450.370.380.40.35Discretization Apriori0.480.370.390.390.420.350.30.30.350.29Figure 3
The enhanced time consuming of the original Apriori algorithm.Figure 3 illustrates the test results and comparison between Apriori algorthim and the traditional algorithm, using eleven independent experiments. The results shows that discretization apriori algorithm has a positive effect on enhancing time consuming.


## 5. Results and Discussions

The association rules are developed to extract all the required databases for the possible combination of different features. The factors of confidence and support can be used to gain different values that were greater than the threshold values for the designed confidence. After the computation of the discretization process, the values of the computational analysis were reduced and the same values were obtained at the same time. Support and confidence factors can be used for obtaining how much each rule is interesting which has values for factors greater than a threshold value. The confidence is determined once the relevant support for the rules is computed.The discretization process is constrained to reduce the value of computational analysis and to obtain high accurate rules at the same time. Less numbers of association rules were generated by the Apriori discretization approach. The statistical strength, confidence factor, and support were used to measure the higher values and the confident rules. The reliability is higher and can be used to have decisions. The number of discovered rules was 4562 where the confidence value is 100% and the remaining values show higher yield factors at the average value of 92.18%. The diagnostic yields are good for the decision-making process and future diagnosis. In the other experiments, the comparison of results was carried out. The Apriori algorithm was used for the extraction of associated rules and then the discretization was developed. The methods of equal frequency discretization and equal width were used for the feature splitting. The features were converted into five intervals that affected the results. The comparison of the results is shown for three methods in Table6. The results obtained in the present method showed a significant number of rules that are higher than the highest mean confidence factor in the proposed methods. The results provide support to the methods used for the smaller percentage including 28.88% and 57.00% respectively; with a high number of rules, 19943 and 15634, our method gets total support of 57, 27% with just 156434 rules.Table 6
Comparison of the results for each algorithm.
AlgorithmsNumber of rules% Mean confidence% Total supportOriginal Apriori40511868.6335.76Equal-frequency discretization19943385.7928.88Equal-width discretization15643479.2557.00The analysis of the experimental results describes the produced discretization by the Apriori algorithm. The results showed that it can be enhanced by the execution time and speedup and generate strong association rules. The increase is in terms of support and the terms of the confidence interval for the association rules. Figure4 shows the mean confidence along with the total support for the original Apriori, equal width discretization, and equal frequency.Figure 4
The mean confidence along with the total support for each algorithm.For acquiring constraint, we applied all of the confidence, lift, and Kuczynski measures. The result is shown in Figure5.Figure 5
Comparison among all confidence, lift, and Kuczynski measures.Hahsler [32] used the association rules and classification and implemented a new package called Arules; when we study and compare this package with the proposed approach, we conclude that the Arules identify the pattern based on frequent itemset for our proposed approach rely on discretizing the data before generating rules which the befits can realize on time-consuming refer to Figure 3 and the acquiring constraints define by mean confidence.


## 6. Conclusions

This work aims to enhance the performance of Apriori by demonstrating the adaptation approach for Apriori using different conditions of discretization. The proposed discretization Apriori algorithm focused on a strong bond between balanced diversification and intensification during the long run. Adaptive strategy can be used to dynamically control all different and essential parameters that are used in the Apriori process that affect Apriori performance in a good manner. The second consideration of the process is to enrich the Apriori behavior that can be used to avoid different conditions from the trapped big volume challenge that is faced by the big data. This work is carried out to identify the solution of a problem related to finding useful association rules (facts) from some datasets. One of the major drawbacks is the treatment based on the continuous features and the difficulty associated with the domain knowledge for evaluating the interestingness related to the association rules. The considered success related to the work is mainly because of the supervised multivariate procedure that was used for discretizing and for the continuous features for generating the rules.The proposed approach pinpoints the limitation in a variety of electronic health record (EHR) dataset which includes different types of features that need to spill the features based on behavior and contents. The future work extends the proposed approach to combine the dependent and independent features to be applicable for automated deep learning methods.



---

*Source: 3870147-2021-11-03.xml*