An efficient stripped cover-based accelerator for reduction of attributes in incomplete decision tables

As the object of study incomplete decision table, with the study of the notion of conflict region, the definition of attribution reduction based on conflict region in incomplete decision table is provided. it is proved that the attribute reduction is equivalent to the attribute reduction based on positive region, at the same time ,a new attribute reduction algorithm which is in incomplete decision table is designed, whose time complexity is O(|K||C|2|U|)(|K| = max{|T c (x i )|,x i ∈ U}) .Finally, an example is used to illustrate the efficiency of the new algorithm.

Metric technique has recently been applied to solve such data mining problems as classification, clustering, feature selection, decision tree construction. In this paper, we apply metric technique to solve a attribute reduction problem of incomplete decision tables in rough set theory. We generalize Liang entropy in incomplete information systems and investigate its properties. Based on the generalized Liang entropy, we establish a metric between coverings and study its properties for attribute reduction. Consequently, we propose a metric based attribute reduction method in incomplete decision tables and perform experiments on UCI data sets. The experimental results show that metric technique is an effective method for attribute reduction in incomplete decision tables.

Attribute reduction is an important process in many fields, such as knowledge discovery, data mining, machine learning, pattern recognition and so on. However, totally labeled data are quite hard to obtain in real life. Thus, we often have to face the situation that not all the data have been associated with labels in advance. Due to the coexistence of labeled and unlabeled data, attribute reduction problem for partially labeled data becomes more complex and challenging. Many scholars have devoted themselves to solve this problem in the past few years. But current algorithms for partially labeled data are not efficient enough in terms of time complexity. To address this issue, we propose a hypergraph model, where two types of induced hypergraphs are designed from partially labeled decision systems. Then, a fast algorithm based on low-complexity heuristics is raised to compute the minimum vertex cover of a hypergraph. Finally, we propose two types of hypergraph models-based attribute reduction algorithms for partially labeled decision systems. Experimental results on broadly used data sets show that the feasibility and efficiency of our proposed algorithms.

Granular maximum decision entropy-based monotonic uncertainty measure for attribute reduction

Laser-based metal additive manufacturing (MAM), particularly laser powder bed fusion (LPBF) and laser directed energy deposition (L-DED), is a transformative technology enabling the production of complex, high-performance metal components with precision and minimal waste. However, its wider adoption is hindered by challenges in ensuring repeatability and consistency due to the complex, dynamic nature of the process. Closed-loop systems with in-situ monitoring and control have gained attention for quality assurance, where machine learning (ML) models are crucial for correlating sensor data with process state diagnosis and facilitating control actions. This review adopts an ML perspective to elucidate the role of ML in closed-loop control systems. It first outlines sensor data types and preprocessing methods used as ML datasets, then discusses roles and applications of ML models for in-situ monitoring, highlighting limitations and potential solutions. An ML-based closed-loop control framework is also presented, with emphasis on the integration of ML in the control component. Finally, future development directions of advanced ML approaches are envisioned. This review provides new insights into enhancing the role of ML models in laser-based MAM closed-loop control systems, serving as a crucial aid in the development of intelligent control systems.

Data reduction has an extreme role in machine learning and pattern recognition with high-dimensional data. It can be achieved with attribute reduction and/or instance selection. The selection of relevant instances and/or attributes from the large amount of data not only affects data reduction (size) but also maintains classification accuracy. Different algorithms have been proposed by many researchers based on instance based learning for attribute reduction to improve classification accuracy. In this paper, based on entropy and fuzzy entropy attribute reduction method is introduced and further tested with different kinds of classifiers. Proposed method helps in reducing storage size and improving classification accuracy. A large number of standard data sets with multiple classes are used to investigate the performance of the proposed method. The performance of this novel approach in terms of reduced data size and mean classification accuracy is measured and compared with existing instance based learning and attribute reduction methods. The experimental result reveals that the performance of the proposed method is positively better than current methods.KeywordsData reductionAttribute selectionInstance selectionFuzzy entropyMLP ANNSVM multiclass data

Intelligent computing system based on pattern recognition and data mining algorithms

Background: Assessment of liver fibrosis is a vital need for enabling therapeutic decisions and prognostic evaluations of chronic hepatitis. Liver biopsy is considered the definitive investigation for assessing the stage of liver fibrosis but it carries several limitations. FIB-4 and APRI also have a limited accuracy. The National Committee for Control of Viral Hepatitis (NCCVH) in Egypt has supplied a valuable pool of electronic patients’ data that data mining techniques can analyze to disclose hidden patterns, trends leading to the evolution of predictive algorithms. Aim: to collaborate with physicians to develop a novel reliable, easy to comprehend noninvasive model to predict the stage of liver fibrosis utilizing routine workup, without imposing extra costs for additional examinations especially in areas with limited resources like Egypt. Methods: This multi-centered retrospective study included baseline demographic, laboratory, and histopathological data of 69106 patients with chronic hepatitis C. We started by data collection preprocessing, cleansing and formatting for knowledge discovery of useful information from Electronic Health Records EHRs. Data mining has been used to build a decision tree (Reduced Error Pruning tree (REP tree)) with 10-fold internal cross-validation. Histopathology results were used to assess accuracy for fibrosis stages. Machine learning feature selection and reduction (CfsSubseteval / best first) reduced the initial number of input features (N=15) to the most relevant ones (N=6) for developing the prediction model. Results: In this study, 32419 patients had F(0-1), 25073 had F(2) and 11615 had F(3-4). FIB-4 and APRI revalidation in our study showed low accuracy and high discordance with biopsy results, with overall AUC 0.68 and 0.58 respectively. Out of 15 attributes machine learning selected Age, AFP, AST, glucose, albumin, and platelet as the most relevant attributes. Results for REP tree indicated an overall classification accuracy up to 70% and ROC Area 0.74 which was not nearly affected by attribute reduction, and pruning . However attribute reduction, and tree pruning were associated with simpler model easy to understand by physician with less time for execution. Conclusion: This study we had the chance to study a large cohort of 69106 chronic hepatitis patients with available liver biopsy results to revise and validate the accuracy of FIB-4 and APRI. This study represents the collaboration between computer scientist and hepatologists to provide clinicians with an accurate novel and reliable, noninvasive model to predict the stage of liver fibrosis.

A systematic study on attribute reduction with rough sets based on general binary relations

Attribute reduction (feature selection) has become an important challenge in areas of pattern recognition, machine learning, data mining and knowledge discovery. Based on attribute reduction, one can extract fuzzy decision rules from a fuzzy decision table. As consistency is one of several criteria for evaluating the decision performance of a decision-rule set, in this paper, we devote to present a consistency-preserving attribute reduction in fuzzy rough set framework. Through constructing the membership function of an object, we first introduce a consistency measure to assess the consistencies of a fuzzy target set and a fuzzy decision table, which underlies a foundation for attribute reduction algorithm. Then, we derive two attribute significance measures based on the proposed consistency measure and design a forward greedy algorithm (ARBC) for attribute reduction from both numerical and nominal data sets. Numerical experiments show the validity of the proposed algorithm from search strategy and heuristic function in the meaning of consistency. Number of the selected features is the least for a given threshold of consistency measure.

Cybersecurity forms the backbone of digital infrastructure that protects overstretched payment systems, governmental operations, and business continuity today. With machine learning (ML) techniques, it can help analyze a large amount of data and improve cyber-security. It’s tough to quantify how effective the ML-based cybersecurity system is, especially when we theorize it. This review paper talks about the significant role of ML in security, threat detection and security measures. Using machine learning algorithms helps in cybersecurity as they make the system automatic and fast. We can implement a threat detection security model using widely used ML algorithms. For classification purposes, we have Support Vector Machines (SVM), Decision Trees (DT), Random forests (RF), and Adaptive and Extreme gradient boosting (XGBoost). This review paper proposes ML algorithms for the implementation of cybersecurity with some practical application demonstrations. Machine learning algorithms can provide valuable analytics to help bolster security and reduce threats. We assess the accuracy of threat detection in network security by utilizing a set of formulas based on confusion, recall, F1-score, time complexity, accuracy and precision. This review synthesizes algorithmic performance across benchmark datasets (CICIDS2017 NSL-KDD UNSW-NB15) to identify significant gaps in previous ML-based cybersecurity frameworks. The results demonstrate the superior precision (90. 8 percent) and scalability of XGBoost.

IntroductionMachine learning (ML) algorithms are computational procedures that use pattern recognition and inference by learning from previously categorized documents to predict the category to which a new document belongs. The role of machine learning within cancer registries remains unclear given the lack of in-depth testing and guidance from health technology assessment (HTA) agencies. We evaluated the effectiveness of coding new cases through machine learning at the Integrated Cancer Registry.MethodsThe Integrated Cancer Registry covers the eastern area of Sicily in Italy, which has an annual average incidence of about 10,000 cases of malignant neoplasm. Potential new cancer cases were retrieved from pathology services and processed by pathologists who confirmed the neoplastic nature of supposed cases and specified the morphological type and location of the tumors. The current method involves identification by reading the free-text report when International Classification Diseases for Oncology information was not provided. We used the new Microsoft ML.Net Library, a framework developed in response to the challenge of facilitating machine learning pipeline utilization in large software applications. A total of 1,050,952 free-text pathology reports published from 2003 to 2018 were selected separately from all Sicilian pathology services and uploaded to machine learning software that explored eight binary classification algorithms.ResultsWe evaluated each algorithm’s performance by calculating metrics (the number of true positives, true negatives, false positives, and false negatives) from the classification procedure applied to the test dataset. The metrics used were accuracy, F1 score, and area under the receiver operating characteristic curve. With a test set of around 210,000 text diagnoses, each algorithm reached an F1 score of up to 95 percent.ConclusionsMachine learning algorithms capture relevant information about tumors from free-text pathology reports, optimizing the process and reducing waste. With the help of machine learning systems, cancer registries can provide more timely data for research and evaluation of all types of new cancer technologies (drugs, devices, radiology and radiotherapy equipment, diagnostic devices, robotic surgery, and vaccines).

Navigating through the Maze of Homogeneous Catalyst Design with Machine Learning

AI’s 10 to Watch, 2022

Kernel Machines, such as Kernel Ridge Regression, provide an effective way to construct non-linear, nonparametric models by projecting data into high-dimensional space and play an important role in machine learning. However, when dealing with large-scale problems, high computational cost in the prediction stage limits their use in real-world applications. In this paper, we propose hashing based prediction, a fast kernel prediction algorithm leveraging hash technique. The algorithm samples a small subset from the input dataset through the locality-sensitive hashing method and computes prediction value approximately using the subset. Hashing based prediction has the minimum time complexity compared to the state-of-art kernel machine prediction approaches. We further present a theoretical analysis of the proposed algorithm showing that it can keep comparable accuracy. Experiment results on most commonly used large-scale datasets, even with million-level data points, show that the proposed algorithm outperforms the state-of-art kernel prediction methods in time cost while maintaining satisfactory accuracy.