paper-with-me

홈 › Papers

A Profile-Based Binary Feature Extraction Method Using Frequent Itemsets for Improving Coronary Artery Disease Diagnosis

2021-09-22 · Ali Yavari, Amir Rajabzadeh, Fardin Abdali-Mohammadi

Recent years have seen growing interest in the diagnosis of Coronary Artery Disease (CAD) with machine learning methods to reduce the cost and health implications of conventional diagnosis. This paper introduces a CAD diagnosis method with a novel feature extraction technique called the Profile-Based Binary Feature Extraction (PBBFE). In this method, after partitioning numerical features, frequent itemsets are extracted by the Apriori algorithm and then used as features to increase the CAD diagnosis accuracy. The proposed method consists of two main phases. In the first phase, each patient is assigned a profile based on age, gender, and medical condition, and then all numerical features are discretized based on assigned profiles. All features then undergo a binarization process to become ready for feature extraction by Apriori. In the last step of this phase, frequent itemsets are extracted from the dataset by Apriori and used to build a new dataset. In the second phase, the Genetic Algorithm and the Support Vector Machine are used to identify the best subset of extracted features for classification. The proposed method was tested on the Z-Alizadeh Sani dataset, which is one the richest databases in the field of CAD. Performance comparisons conducted on this dataset showed that the proposed method outperforms all major alternative methods with 98.35% accuracy, 100% sensitivity, and 94.25% specificity. The proposed method also achieved the highest accuracy on several other datasets.

📄 PDF Abstract BibTeX arXiv:2109.10966

Code (0)

등록된 구현이 없습니다.

Tasks

BinarizationSpecificity

Similar Papers 제목 키워드 기반

Nouvelles représentations concises exactes des motifs rares

2020-04-02 · Seif Ben Chaabene

Until a present, the majority of work in data mining were interested in the extraction of the frequent itemsets and the generation of the frequent association rules from these itemsets. Sometimes, the frequent of associa…

Parallel algorithms for mining of frequent itemsets

2021-08-11 · Robert Kessl

In the recent decade companies started collecting of large amount of data. Without a proper analyse, the data are usually useless. The field of analysing the data is called data mining. Unfortunately, the amount of data …

Forming Predictive Features of Tweets for Decision-Making Support

2022-01-06 · Bohdan M. Pavlyshenko

The article describes the approaches for forming different predictive features of tweet data sets and using them in the predictive analysis for decision-making support. The graph theory as well as frequent itemsets and a…

Decision Makingregression

Deciding Monotone Duality and Identifying Frequent Itemsets in Quadratic Logspace

2012-12-09 · Georg Gottlob

The monotone duality problem is defined as follows: Given two monotone formulas f and g in iredundant DNF, decide whether f and g are dual. This problem is the same as duality testing for hypergraphs, that is, checking w…

Problem Decomposition

Finding the True Frequent Itemsets

2013-01-07 · Matteo Riondato, Fabio Vandin

Frequent Itemsets (FIs) mining is a fundamental primitive in data mining. It requires to identify all itemsets appearing in at least a fraction $\theta$ of a transactional dataset $\mathcal{D}$. Often though, the ultimat…

Learning Theory