Machine Learning-Driven Classification for Enhanced Rule Proposal Framework

In enterprise operations,maintaining manual rules for enterprise processes can be expensive,time-consuming,and dependent on specialized domain knowledge in that enterprise domain.Recently,rule-generation has been automated in enterprises,particularly through Machine Learning,to streamline routine tasks.Typically,these machine models are black boxes where the reasons for the decisions are not always transparent,and the end users need to verify the model proposals as a part of the user acceptance testing to trust it.In such scenarios,rules excel over Machine Learning models as the end-users can verify the rules and have more trust.In many scenarios,the truth label changes frequently thus,it becomes difficult for the Machine Learning model to learn till a considerable amount of data has been accumulated,but with rules,the truth can be adapted.This paper presents a novel framework for generating human-understandable rules using the Classification and Regression Tree(CART)decision tree method,which ensures both optimization and user trust in automated decision-making processes.The framework generates comprehensible rules in the form of if condition and then predicts class even in domains where noise is present.The proposed system transforms enterprise operations by automating the production of human-readable rules from structured data,resulting in increased efficiency and transparency.Removing the need for human rule construction saves time and money while guaranteeing that users can readily check and trust the automatic judgments of the system.The remarkable performance metrics of the framework,which achieve 99.85%accuracy and 96.30%precision,further support its efficiency in translating complex data into comprehensible rules,eventually empowering users and enhancing organizational decision-making processes.

Text categorization based on fuzzy classification rules tree

To deal with the problem that arises when the conventional fuzzy class-association method applies repetitive scans of the classifier to classify new texts,which has low efficiency, a new approach based on the FCR-tree（fuzzy classification rules tree）for text categorization is proposed.The compactness of the FCR-tree saves significant space in storing a large set of rules when there are many repeated words in the rules.In comparison with classification rules,the fuzzy classification rules contain not only words,but also the fuzzy sets corresponding to the frequencies of words appearing in texts.Therefore,the construction of an FCR-tree and its structure are different from a CR-tree.To debase the difficulty of FCR-tree construction and rules retrieval,more k-FCR-trees are built.When classifying a new text,it is not necessary to search the paths of the sub-trees led by those words not appearing in this text,thus reducing the number of traveling rules.Experimental results show that the proposed approach obviously outperforms the conventional method in efficiency.

A Study on Associated Rules and Fuzzy Partitions for Classification

The amount of data for decision making has increased tremendously in the age of the digital economy. Decision makers who fail to proficiently manipulate the data produced may make incorrect decisions and therefore harm their business. Thus, the task of extracting and classifying the useful information efficiently and effectively from huge amounts of computational data is of special importance. In this paper, we consider that the attributes of data could be both crisp and fuzzy. By examining the suitable partial data, segments with different classes are formed, then a multithreaded computation is performed to generate crisp rules (if possible), and finally, the fuzzy partition technique is employed to deal with the fuzzy attributes for classification. The rules generated in classifying the overall data can be used to gain more knowledge from the data collected.

Urban Morphological Rules Classification for Digital Design

The hidden dimension of the urban morphology is the underlying the urban morphological rules system.The number of these rules has increased and their application tends to become more complex.The urban morphosis based digital approaches tends to become widespread.However,achieving the target values for all the rules is difficult.This impacts the social,environmental and aesthetic objectives of these rules.This paper proposes a classification of urban morphological rules to assist the digital morphosis of urban form.The aim is to endow the system of rules with a hierarchy,which can make efficient the automatic generation of the urban forms respectful of the urban law.Thus,this work promotes the concerns of artificial intelligence in urban morphology.

Analysis of Distributed and Adaptive Genetic Algorithm for Mining Interesting Classification Rules

Distributed genetic algorithm can be combined with the adaptive genetic algorithm for mining the interesting and comprehensible classification rules.The paper gives the method to encode for the rules,the fitness function,the selecting,crossover,mutation and migration operator for the DAGA at the same time are designed.

Knowledge-Based Classification in Automated Soil Mapping

A machine-learning approach was developed for automated building of knowledgebases for soil resources mapping by using a classification tree to generate knowledge from trainingdata. With this method, building a knowledge base for automated soil mapping was easier than usingthe conventional knowledge acquisition approach. The knowledge base built by classification tree wasused by the knowledge classifier to perform the soil type classification of Longyou County,Zhejiang Province, China using Landsat TM bi-temporal images and CIS data. To evaluate theperformance of the resultant knowledge bases, the classification results were compared to existingsoil map based on a field survey. The accuracy assessment and analysis of the resultant soil mapssuggested that the knowledge bases built by the machine-learning method was of good quality formapping distribution model of soil classes over the study area.

FUZZY PARTITIONING OF FEATURE SPACE FOR PATTERN CLASSIFICATION BASED ON SUPERVISED C1USTERING

The choice of a fuzzy partitioning is crucial to the performance of a fuzzy system based on if-then rules. However, most of the existing methods are complicated or lead ,o too many subspaces, which is unfit for the applications of pattern classification. A simple but effective clustering approach is proposed in this paper, which obtains a set of compact subspaces and is applicable for classification problems with higher dimensional feature. Its effectiveness is demonstrated by the experimental results.

Correct Classification Rates in Multi-Category Discriminant Analysis of Spatial Gaussian Data

This paper discusses the problem of classifying a multivariate Gaussian random field observation into one of the several categories specified by different parametric mean models. Investigation is conducted on the classifier based on plug-in Bayes classification rule (PBCR) formed by replacing unknown parameters in Bayes classification rule (BCR) with category parameters estimators. This is the extension of the previous one from the two category cases to the multi-category case. The novel closed-form expressions for the Bayes classification probability and actual correct classification rate associated with PBCR are derived. These correct classification rates are suggested as performance measures for the classifications procedure. An empirical study has been carried out to analyze the dependence of derived classification rates on category parameters.

A Pattern Classification Model for Vowel Data Using Fuzzy Nearest Neighbor

Classification of the patterns is a crucial structure of research and applications. Using fuzzy set theory, classifying the patterns has become of great interest because of its ability to understand the parameters. One of the problemsobserved in the fuzzification of an unknown pattern is that importance is givenonly to the known patterns but not to their features. In contrast, features of thepatterns play an essential role when their respective patterns overlap. In this paper,an optimal fuzzy nearest neighbor model has been introduced in which a fuzzifi-cation process has been carried out for the unknown pattern using k nearest neighbor. With the help of the fuzzification process, the membership matrix has beenformed. In this membership matrix, fuzzification has been carried out of the features of the unknown pattern. Classification results are verified on a completelyllabelled Telugu vowel data set, and the accuracy is compared with the differentmodels and the fuzzy k nearest neighbor algorithm. The proposed model gives84.86% accuracy on 50% training data set and 89.35% accuracy on 80% trainingdata set. The proposed classifier learns well enough with a small amount of training data, resulting in an efficient and faster approach.

An Intelligent Medical Expert System Using Temporal Fuzzy Rules and Neural Classifier

As per World Health Organization report which was released in the year of 2019,Diabetes claimed the lives of approximately 1.5 million individuals globally in 2019 and around 450 million people are affected by diabetes all over the world.Hence it is inferred that diabetes is rampant across the world with the majority of the world population being affected by it.Among the diabetics,it can be observed that a large number of people had failed to identify their disease in the initial stage itself and hence the disease level moved from Type-1 to Type-2.To avoid this situation,we propose a new fuzzy logic based neural classifier for early detection of diabetes.A set of new neuro-fuzzy rules is introduced with time constraints that are applied for thefirst level classification.These levels are further refined by using the Fuzzy Cognitive Maps(FCM)with time intervals for making thefinal decision over the classification process.The main objective of this proposed model is to detect the diabetes level based on the time.Also,the set of neuro-fuzzy rules are used for selecting the most contributing values over the decision-making process in diabetes prediction.The proposed model proved its efficiency in performance after experiments conducted not only from the repository but also by using the standard diabetic detection models that are available in the market.

Adaptive associative classification with emerging frequent patterns

In this paper, we propose an enhanced associative classification method by integrating the dynamic property in the process of associative classification. In the proposed method, we employ a support vector machine（SVM） based method to refine the discovered emerging ~equent patterns for classification rule extension for class label prediction. The empirical study shows that our method can be used to classify increasing resources efficiently and effectively.

Chimp Optimization Algorithm Based Feature Selection with Machine Learning for Medical Data Classification

Datamining plays a crucial role in extractingmeaningful knowledge fromlarge-scale data repositories,such as data warehouses and databases.Association rule mining,a fundamental process in data mining,involves discovering correlations,patterns,and causal structures within datasets.In the healthcare domain,association rules offer valuable opportunities for building knowledge bases,enabling intelligent diagnoses,and extracting invaluable information rapidly.This paper presents a novel approach called the Machine Learning based Association Rule Mining and Classification for Healthcare Data Management System(MLARMC-HDMS).The MLARMC-HDMS technique integrates classification and association rule mining(ARM)processes.Initially,the chimp optimization algorithm-based feature selection(COAFS)technique is employed within MLARMC-HDMS to select relevant attributes.Inspired by the foraging behavior of chimpanzees,the COA algorithm mimics their search strategy for food.Subsequently,the classification process utilizes stochastic gradient descent with a multilayer perceptron(SGD-MLP)model,while the Apriori algorithm determines attribute relationships.We propose a COA-based feature selection approach for medical data classification using machine learning techniques.This approach involves selecting pertinent features from medical datasets through COA and training machine learning models using the reduced feature set.We evaluate the performance of our approach on various medical datasets employing diverse machine learning classifiers.Experimental results demonstrate that our proposed approach surpasses alternative feature selection methods,achieving higher accuracy and precision rates in medical data classification tasks.The study showcases the effectiveness and efficiency of the COA-based feature selection approach in identifying relevant features,thereby enhancing the diagnosis and treatment of various diseases.To provide further validation,we conduct detailed experiments on a benchmark medical dataset,revealing the superiority of the MLARMCHDMS model over other methods,with a maximum accuracy of 99.75%.Therefore,this research contributes to the advancement of feature selection techniques in medical data classification and highlights the potential for improving healthcare outcomes through accurate and efficient data analysis.The presented MLARMC-HDMS framework and COA-based feature selection approach offer valuable insights for researchers and practitioners working in the field of healthcare data mining and machine learning.

不平衡数据流的集成分类方法综述

现实世界的场景中,从数据流中学习会面临着类不平衡的问题,学习算法由于缺少训练数据而无法有效识别少数类样本。为了介绍不平衡数据流集成分类的研究现状和面临的挑战,依据近年来的不平衡数据流集成分类领域文献,从基于加权、选择和投票的决策规则和基于代价敏感学习、主动学习和增量学习的学习方式的角度详细分析和总结了不平衡数据流的集成方法,并比较了使用相同数据集的算法的性能。针对处理不同类型复杂数据流中的不平问题,从概念漂移、多类、噪声和类重叠四个方面对其集成分类算法进行总结,分析了经典算法的时间复杂度。对动态数据流、缺失信息的数据流、多标签数据流和不确定数据流中不平衡问题的分类挑战提出了下一步的集成策略研究。

Customer Requirements Mapping Method Based on Association Rule Mining for Mass Customization

Customer requirements analysis is the key step for product variety design of mass customiza-tion(MC). Quality function deployment (QFD) is a widely used management technique for understanding the voice of the customer (VOC), however, QFD depends heavily on human subject judgment during extracting customer requirements and determination of the importance weights of customer requirements. QFD pro-cess and related problems are so complicated that it is not easily used. In this paper, based on a general data structure of product family, generic bill of material (GBOM), association rules analysis was introduced to construct the classification mechanism between customer requirements and product architecture. The new method can map customer requirements to the items of product family architecture respectively, accomplish the mapping process from customer domain to physical domain directly, and decrease mutual process between customer and designer, improve the product design quality, and thus furthest satisfy customer needs. Finally, an example of customer requirements mapping of the elevator cabin was used to illustrate the proposed method.

Evolving Decision Rules to Predict Investment Opportunities

This paper is motivated by the interest in finding significant movements in financial stock prices. However, when the number of profitable opportunities is scarce, the prediction of these cases is difficult. In a previous work, we have introduced evolving decision rules （EDR） to detect financial opportunities. The objective of EDR is to classify the minority class （positive eases） in imbalaneed environments. EDR provides a range of classifications to find the best balance between not making mistakes and not missing opportunities. The goals of this paper are： 1） to show that EDR produces a range of solutions to suit the investor＇s preferences and 2） to analyze the factors that benefit the performance of EDR. A series of experiments was performed. EDR was tested using a data set from the London Financial Market. To analyze the EDR behaviour, another experiment was carried out using three artificial data sets, whose solutions have different levels of complexity. Finally, an illustrative example was provided to show how a bigger collection of rules is able to classify more positive eases in imbalanced data sets. Experimental results show that： 1） EDR offers a range of solutions to fit the risk guidelines of different types of investors, and 2） a bigger collection of rules is able to classify more positive eases in imbalanced environments.

Improving Association Rules Accuracy in Noisy Domains Using Instance Reduction Techniques

Association rules’learning is a machine learning method used in finding underlying associations in large datasets.Whether intentionally or unintentionally present,noise in training instances causes overfitting while building the classifier and negatively impacts classification accuracy.This paper uses instance reduction techniques for the datasets before mining the association rules and building the classifier.Instance reduction techniques were originally developed to reduce memory requirements in instance-based learning.This paper utilizes them to remove noise from the dataset before training the association rules classifier.Extensive experiments were conducted to assess the accuracy of association rules with different instance reduction techniques,namely:DecrementalReduction Optimization Procedure(DROP)3,DROP5,ALL K-Nearest Neighbors(ALLKNN),Edited Nearest Neighbor(ENN),and Repeated Edited Nearest Neighbor(RENN)in different noise ratios.Experiments show that instance reduction techniques substantially improved the average classification accuracy on three different noise levels:0%,5%,and 10%.The RENN algorithm achieved the highest levels of accuracy with a significant improvement on seven out of eight used datasets from the University of California Irvine(UCI)machine learning repository.The improvements were more apparent in the 5%and the 10%noise cases.When RENN was applied,the average classification accuracy for the eight datasets in the zero-noise test enhanced from 70.47%to 76.65%compared to the original test.The average accuracy was improved from 66.08%to 77.47%for the 5%-noise case and from 59.89%to 77.59%in the 10%-noise case.Higher confidence was also reported in building the association rules when RENN was used.The above results indicate that RENN is a good solution in removing noise and avoiding overfitting during the construction of the association rules classifier,especially in noisy domains.

法治化视角下我国古籍分级保护制度研究

“中华古籍保护计划”自2007年启动以来,通过《国家珍贵古籍名录》和“全国古籍重点保护单位”的申报评选工作,在全国范围内自上而下逐步建立起较为完善的古籍保护工作机制和分级保护工作体系。文章在界定分级概念的基础上,详细梳理了我国古籍分级保护工作的历史演进和工作实践,发现我国已初步构建起古籍分级保护体系、古籍存藏环境得到极大改善、古籍分级保护成果得以充分转化利用。在此基础上,建议将现有古籍分级保护工作制度以立法形式予以固化;将明确的保护措施作为我国古籍保护立法的重要内容;建立多渠道的资金筹措方式,在立法中明确社会力量参与古籍分级保护的路径和鼓励措施。图1。表2。参考文献19。

数据挖掘算法在作业车间调度问题中的应用

为了从与日俱增的车间生产数据中提取调度规则来指导生产调度任务,提出一种基于数据挖掘的调度算法。将最小化最大完工时间设置为性能指标,从作业车间的离线生产数据中建立合适的调度样本集;将建立的调度样本集按合适的比例分为训练集和测试集;用数据挖掘算法中的分类回归树(CART)从训练集中获取有效的调度知识,形成CART树状调度规则库;为了验证所得调度规则的有效性,将调度规则与遗传算法结合,设计了一种基于数据挖掘和调度规则的遗传算法作为调度算法来求解作业车间调度问题。通过对不同作业车间经典算例进行仿真与测试,验证了所提调度规则和调度算法的有效性与优越性。