THAPE: A Tunable Hybrid Associative Predictive Engine Approach for Enhancing Rule Interpretability in Association Rule Learning for the Retail Sector

Association rule learning(ARL)is a widely used technique for discovering relationships within datasets.However,it often generates excessive irrelevant or ambiguous rules.Therefore,post-processing is crucial not only for removing irrelevant or redundant rules but also for uncovering hidden associations that impact other factors.Recently,several post-processing methods have been proposed,each with its own strengths and weaknesses.In this paper,we propose THAPE(Tunable Hybrid Associative Predictive Engine),which combines descriptive and predictive techniques.By leveraging both techniques,our aim is to enhance the quality of analyzing generated rules.This includes removing irrelevant or redundant rules,uncovering interesting and useful rules,exploring hidden association rules that may affect other factors,and providing backtracking ability for a given product.The proposed approach offers a tailored method that suits specific goals for retailers,enabling them to gain a better understanding of customer behavior based on factual transactions in the target market.We applied THAPE to a real dataset as a case study in this paper to demonstrate its effectiveness.Through this application,we successfully mined a concise set of highly interesting and useful association rules.Out of the 11,265 rules generated,we identified 125 rules that are particularly relevant to the business context.These identified rules significantly improve the interpretability and usefulness of association rules for decision-making purposes.

Semantic Consistency and Correctness Verification of Digital Traffic Rules

The consensus of the automotive industry and traffic management authorities is that autonomous vehicles must follow the same traffic laws as human drivers.Using formal or digital methods,natural language traffic rules can be translated into machine language and used by autonomous vehicles.In this paper,a translation flow is designed.Beyond the translation,a deeper examination is required,because the semantics of natural languages are rich and complex,and frequently contain hidden assumptions.The issue of how to ensure that digital rules are accurate and consistent with the original intent of the traffic rules they represent is both significant and unresolved.In response,we propose a method of formal verification that combines equivalence verification with model checking.Reasonable and reassuring digital traffic rules can be obtained by utilizing the proposed traffic rule digitization flow and verification method.In addition,we offer a number of simulation applications that employ digital traffic rules to assess vehicle violations.The experimental findings indicate that our digital rules utilizing metric temporal logic(MTL)can be easily incorporated into simulation platforms and autonomous driving systems(ADS).

STRONGLY CONVERGENT INERTIAL FORWARD-BACKWARD-FORWARD ALGORITHM WITHOUT ON-LINE RULE FOR VARIATIONAL INEQUALITIES

This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.

Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals

Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.

Learning Vector Quantization-Based Fuzzy Rules Oversampling Method

Imbalanced datasets are common in practical applications,and oversampling methods using fuzzy rules have been shown to enhance the classification performance of imbalanced data by taking into account the relationship between data attributes.However,the creation of fuzzy rules typically depends on expert knowledge,which may not fully leverage the label information in training data and may be subjective.To address this issue,a novel fuzzy rule oversampling approach is developed based on the learning vector quantization(LVQ)algorithm.In this method,the label information of the training data is utilized to determine the antecedent part of If-Then fuzzy rules by dynamically dividing attribute intervals using LVQ.Subsequently,fuzzy rules are generated and adjusted to calculate rule weights.The number of new samples to be synthesized for each rule is then computed,and samples from the minority class are synthesized based on the newly generated fuzzy rules.This results in the establishment of a fuzzy rule oversampling method based on LVQ.To evaluate the effectiveness of this method,comparative experiments are conducted on 12 publicly available imbalance datasets with five other sampling techniques in combination with the support function machine.The experimental results demonstrate that the proposed method can significantly enhance the classification algorithm across seven performance indicators,including a boost of 2.15%to 12.34%in Accuracy,6.11%to 27.06%in G-mean,and 4.69%to 18.78%in AUC.These show that the proposed method is capable of more efficiently improving the classification performance of imbalanced data.

Density Clustering Algorithm Based on KD-Tree and Voting Rules

Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.

Automatic Rule Discovery for Data Transformation Using Fusion of Diversified Feature Formats

This article presents an innovative approach to automatic rule discovery for data transformation tasks leveraging XGBoost,a machine learning algorithm renowned for its efficiency and performance.The framework proposed herein utilizes the fusion of diversified feature formats,specifically,metadata,textual,and pattern features.The goal is to enhance the system’s ability to discern and generalize transformation rules fromsource to destination formats in varied contexts.Firstly,the article delves into the methodology for extracting these distinct features from raw data and the pre-processing steps undertaken to prepare the data for the model.Subsequent sections expound on the mechanism of feature optimization using Recursive Feature Elimination(RFE)with linear regression,aiming to retain the most contributive features and eliminate redundant or less significant ones.The core of the research revolves around the deployment of the XGBoostmodel for training,using the prepared and optimized feature sets.The article presents a detailed overview of the mathematical model and algorithmic steps behind this procedure.Finally,the process of rule discovery(prediction phase)by the trained XGBoost model is explained,underscoring its role in real-time,automated data transformations.By employingmachine learning and particularly,the XGBoost model in the context of Business Rule Engine(BRE)data transformation,the article underscores a paradigm shift towardsmore scalable,efficient,and less human-dependent data transformation systems.This research opens doors for further exploration into automated rule discovery systems and their applications in various sectors.

Heterogeneous information fusion recognition method based on belief rule structure

To solve the problem that the existing situation awareness research focuses on multi-sensor data fusion,but the expert knowledge is not fully utilized,a heterogeneous informa-tion fusion recognition method based on belief rule structure is proposed.By defining the continuous probabilistic hesitation fuzzy linguistic term sets(CPHFLTS)and establishing CPHFLTS distance measure,the belief rule base of the relationship between feature space and category space is constructed through information integration,and the evidence reasoning of the input samples is carried out.The experimental results show that the proposed method can make full use of sensor data and expert knowledge for recognition.Compared with the other methods,the proposed method has a higher correct recognition rate under different noise levels.

Rule acquisition of three-way semi-concept lattices in formal decision context

Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way semi-concept lattices have three-way operators with weaker constraints,which can generate more concepts.In this article,the problem of rule acquisition for three-way semi-concept lattices is discussed in general.The authors construct the finer relation of three-way semi-concept lattices,and propose a method of rule acquisition for three-way semi-concept lattices.The authors also discuss the set of decision rules and the relationships of decision rules among object-induced three-way semi-concept lattices,object-induced three-way concept lattices,classical concept lattices and semi-concept lattices.Finally,examples are provided to illustrate the validity of our conclusions.

Multi-modal knowledge graph inference via media convergence and logic rule

Media convergence works by processing information from different modalities and applying them to different domains.It is difficult for the conventional knowledge graph to utilise multi-media features because the introduction of a large amount of information from other modalities reduces the effectiveness of representation learning and makes knowledge graph inference less effective.To address the issue,an inference method based on Media Convergence and Rule-guided Joint Inference model(MCRJI)has been pro-posed.The authors not only converge multi-media features of entities but also introduce logic rules to improve the accuracy and interpretability of link prediction.First,a multi-headed self-attention approach is used to obtain the attention of different media features of entities during semantic synthesis.Second,logic rules of different lengths are mined from knowledge graph to learn new entity representations.Finally,knowledge graph inference is performed based on representing entities that converge multi-media features.Numerous experimental results show that MCRJI outperforms other advanced baselines in using multi-media features and knowledge graph inference,demonstrating that MCRJI provides an excellent approach for knowledge graph inference with converged multi-media features.

基于ER Rule的多分类器汽车评论情感分类研究

该文针对汽车评论语料的情感二分类问题,提出一种基于证据推理规则的多分类器融合的情感分类方法。在情感特征构建方面,通过实验对比不同特征模型对分类结果的影响,并改进传统的TFIDF权重计算方法。同时,在此基础上使用ER Rule融合不同分类器进行文本情感极性分析,并考虑各分类器的权重和可靠度。最后,爬取汽车网站上的评论数据对上述方法进行测试,并用公开的中文酒店评论语料数据进行了验证,结果表明该方法能够有效集成不同分类器的优点,与传统机器学习分类算法相比,其结果在Recall,F1值和Accuracy三个指标上得到了提高,与目前流行的深度学习算法和集成学习算法相比,其结果总体占优。

Composite Fractional Trapezoidal Rule with Romberg Integration

The aim of this research is to demonstrate a novel scheme for approximating the Riemann-Liouville fractional integral operator.This would be achieved by first establishing a fractional-order version of the 2-point Trapezoidal rule and then by proposing another fractional-order version of the(n+1)-composite Trapezoidal rule.In particular,the so-called divided-difference formula is typically employed to derive the 2-point Trapezoidal rule,which has accordingly been used to derive a more accurate fractional-order formula called the(n+1)-composite Trapezoidal rule.Additionally,in order to increase the accuracy of the proposed approximations by reducing the true errors,we incorporate the so-called Romberg integration,which is an extrapolation formula of the Trapezoidal rule for integration,into our proposed approaches.Several numerical examples are provided and compared with a modern definition of the Riemann-Liouville fractional integral operator to illustrate the efficacy of our scheme.

Principles of Shiology——Revealing the Basic Rules of Human Shiance

The objective principles of shiology are mainly reflected in three fields as food acquisition, eaters' health and shiance order. Most of the objective principles in the field of food acquisition have been revealed by agronomy and foodstuff science. This research mainly focuses on 10 principles in the field of eaters' health and shiance order and in addition, there are also five lemmas that extend from the above principles. The 10 principles are the core theory of the shiology knowledge system, which play an important role in the objective principles revealed by human beings and constitute one of the basic principles of human civilization. Compared with the scientific principles of mathematics, physics, chemistry and economics, the principles of shiology have three characteristics as popularity, practicability and survivability. The principles of shiology in the field of eaters' health are all around us, and everyone can understand and master them. Using the principles of shiology can improve the healthy life span of 8 billion people. The principles of shiology in the field of shiance order is an important tool of social governance, which can reduce human social conflicts, reduce social involution, improve overall efficiency of social operation, and maintain the sustainable development of human beings.

Advancements in Medication Rule for Pulmonary Nodules: A Review of Current Research Progress

This paper reviewed the literature on medication rule of pulmonary nodules in recent years. It is found that contemporary doctors pay more attention to regulating Qi, clearing heat and detoxifying, eliminating phlegm, dissolving phlegm and dissipating masses. They use mild drugs, cold and warm treatments in parallel, combining the tastes of pungent, bitterness, and sweetness at the same time. The treatment focuses on the five viscera with emphasis on the lung meridian while also considering the spleen and stomach functions as well as soothing liver stagnation. This information aims to provide some reference for clinical treatment of pulmonary nodules.

Discovering hidden patterns:Association rules for cardiovascular diseases in type 2 diabetes mellitus

BACKGROUND It is increasingly common to find patients affected by a combination of type 2 diabetes mellitus(T2DM)and coronary artery disease(CAD),and studies are able to correlate their relationships with available biological and clinical evidence.The aim of the current study was to apply association rule mining(ARM)to discover whether there are consistent patterns of clinical features relevant to these diseases.ARM leverages clinical and laboratory data to the meaningful patterns for diabetic CAD by harnessing the power help of data-driven algorithms to optimise the decision-making in patient care.AIM To reinforce the evidence of the T2DM-CAD interplay and demonstrate the ability of ARM to provide new insights into multivariate pattern discovery.METHODS This cross-sectional study was conducted at the Department of Biochemistry in a specialized tertiary care centre in Delhi,involving a total of 300 consented subjects categorized into three groups:CAD with diabetes,CAD without diabetes,and healthy controls,with 100 subjects in each group.The participants were enrolled from the Cardiology IPD&OPD for the sample collection.The study employed ARM technique to extract the meaningful patterns and relationships from the clinical data with its original value.RESULTS The clinical dataset comprised 35 attributes from enrolled subjects.The analysis produced rules with a maximum branching factor of 4 and a rule length of 5,necessitating a 1%probability increase for enhancement.Prominent patterns emerged,highlighting strong links between health indicators and diabetes likelihood,particularly elevated HbA1C and random blood sugar levels.The ARM technique identified individuals with a random blood sugar level>175 and HbA1C>6.6 are likely in the“CAD-with-diabetes”group,offering valuable insights into health indicators and influencing factors on disease outcomes.CONCLUSION The application of this method holds promise for healthcare practitioners to offer valuable insights for enhancing patient treatment targeting specific subtypes of CAD with diabetes.Implying artificial intelligence techniques with medical data,we have shown the potential for personalized healthcare and the development of user-friendly applications aimed at improving cardiovascular health outcomes for this high-risk population to optimise the decision-making in patient care.

A Health State Prediction Model Based on Belief Rule Base and LSTM for Complex Systems

In industrial production and engineering operations,the health state of complex systems is critical,and predicting it can ensure normal operation.Complex systems have many monitoring indicators,complex coupling structures,non-linear and time-varying characteristics,so it is a challenge to establish a reliable prediction model.The belief rule base(BRB)can fuse observed data and expert knowledge to establish a nonlinear relationship between input and output and has well modeling capabilities.Since each indicator of the complex system can reflect the health state to some extent,the BRB is built based on the causal relationship between system indicators and the health state to achieve the prediction.A health state prediction model based on BRB and long short term memory for complex systems is proposed in this paper.Firstly,the LSTMis introduced to predict the trend of the indicators in the system.Secondly,the Density Peak Clustering(DPC)algorithmis used todetermine referential values of indicators for BRB,which effectively offset the lack of expert knowledge.Then,the predicted values and expert knowledge are fused to construct BRB to predict the health state of the systems by inference.Finally,the effectiveness of the model is verified by a case study of a certain vehicle hydraulic pump.

Verification and Application Evaluation of Intelligent Audit Rules for The UN9000 Urine Analysis System

Objective:To apply and verify the application of intelligent audit rules for urine analysis by Cui et al.Method:A total of 1139 urine samples of hospitalized patients in Tai’an Central Hospital from September 2021 to November 2021 were randomly selected,and all samples were manually microscopic examined after the detection of the UN9000 urine analysis line.The intelligent audit rules(including the microscopic review rules and manual verification rules)were validated based on the manual microscopic examination and manual audit,and the rules were adjusted to apply to our laboratory.The laboratory turnaround time(TAT)before and after the application of intelligent audit rules was compared.Result:The microscopic review rate of intelligent rules was 25.63%(292/1139),the true positive rate,false positive rate,true negative rate,and false negative rate were 27.66%(315/1139),6.49%(74/1139),62.34%(710/1139)and 3.51%(40/1139),respectively.The approval consistency rate of manual verification rules was 84.92%(727/856),the approval inconsistency rate was 0%(0/856),the interception consistency rate was 12.61%(108/856),and the interception inconsistency rate was 0%(0/856).Conclusion:The intelligence audit rules for urine analysis by Cui et al.have good clinical applicability in our laboratory.

Review of Arbitral Award of Network Loan and Analysis of Construction of Implementation Review Rules

The network arbitration cases arising from the network lending disputes are pouring into the courts in large numbers.It is reported that the network arbitration system of some arbitration institutions even“can accept more than 10,000 cases every day,”while online lending is booming,it has also caused a lot of contradictions and disputes,and traditional dispute resolution methods have failed to effectively respond to the need for efficient and convenient resolution of online lending disputes.This paper tries to study the arbitral award of online loans and proposes the construction of implementation review rules.

Safety Assessment of Liquid Launch Vehicle Structures Based on Interpretable Belief Rule Base

A liquid launch vehicle is an important carrier in aviation,and its regular operation is essential to maintain space security.In the safety assessment of fluid launch vehicle body structure,it is necessary to ensure that the assessmentmodel can learn self-response rules from various uncertain data and not differently to provide a traceable and interpretable assessment process.Therefore,a belief rule base with interpretability(BRB-i)assessment method of liquid launch vehicle structure safety status combines data and knowledge.Moreover,an innovative whale optimization algorithm with interpretable constraints is proposed.The experiments are carried out based on the liquid launch vehicle safety experiment platform,and the information on the safety status of the liquid launch vehicle is obtained by monitoring the detection indicators under the simulation platform.The MSEs of the proposed model are 3.8000e-03,1.3000e-03,2.1000e-03,and 1.8936e-04 for 25%,45%,65%,and 84%of the training samples,respectively.It can be seen that the proposed model also shows a better ability to handle small sample data.Meanwhile,the belief distribution of the BRB-i model output has a high fitting trend with the belief distribution of the expert knowledge settings,which indicates the interpretability of the BRB-i model.Experimental results show that,compared with other methods,the BRB-i model guarantees the model’s interpretability and the high precision of experimental results.

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.