Attribute Reduction of Hybrid Decision Information Systems Based on Fuzzy Conditional Information Entropy

The presence of numerous uncertainties in hybrid decision information systems(HDISs)renders attribute reduction a formidable task.Currently available attribute reduction algorithms,including those based on Pawlak attribute importance,Skowron discernibility matrix,and information entropy,struggle to effectively manages multiple uncertainties simultaneously in HDISs like the precise measurement of disparities between nominal attribute values,and attributes with fuzzy boundaries and abnormal values.In order to address the aforementioned issues,this paper delves into the study of attribute reduction withinHDISs.First of all,a novel metric based on the decision attribute is introduced to solve the problem of accurately measuring the differences between nominal attribute values.The newly introduced distance metric has been christened the supervised distance that can effectively quantify the differences between the nominal attribute values.Then,based on the newly developed metric,a novel fuzzy relationship is defined from the perspective of“feedback on parity of attribute values to attribute sets”.This new fuzzy relationship serves as a valuable tool in addressing the challenges posed by abnormal attribute values.Furthermore,leveraging the newly introduced fuzzy relationship,the fuzzy conditional information entropy is defined as a solution to the challenges posed by fuzzy attributes.It effectively quantifies the uncertainty associated with fuzzy attribute values,thereby providing a robust framework for handling fuzzy information in hybrid information systems.Finally,an algorithm for attribute reduction utilizing the fuzzy conditional information entropy is presented.The experimental results on 12 datasets show that the average reduction rate of our algorithm reaches 84.04%,and the classification accuracy is improved by 3.91%compared to the original dataset,and by an average of 11.25%compared to the other 9 state-of-the-art reduction algorithms.The comprehensive analysis of these research results clearly indicates that our algorithm is highly effective in managing the intricate uncertainties inherent in hybrid data.

Attribute Reduction Method Based on Sequential Three-Branch Decision Model

Attribute reduction is a research hotspot in rough set theory. Traditional heuristic attribute reduction methods add the most important attribute to the decision attribute set each time, resulting in multiple redundant attribute calculations, high time consumption, and low reduction efficiency. In this paper, based on the idea of sequential three-branch decision classification domain, attributes are treated as objects of three-branch division, and attributes are divided into core attributes, relatively necessary attributes, and unnecessary attributes using attribute importance and thresholds. Core attributes are added to the decision attribute set, unnecessary attributes are rejected from being added, and relatively necessary attributes are repeatedly divided until the reduction result is obtained. Experiments were conducted on 8 groups of UCI datasets, and the results show that, compared to traditional reduction methods, the method proposed in this paper can effectively reduce time consumption while ensuring classification performance.

Attribute Reduction of Neighborhood Rough Set Based on Discernment

For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.

Attributes of Domestic Spaces for Contemporary Habitation-A Secondary Publication

The domestic space can be defined as the sphere that articulates the needs for subjective containment and contextual stimuli.In this sense,questions arise about the indispensable attributes that spaces must possess for this articulation to take place adequately.Architecture,as the discipline in charge of satisfying the specific spatial needs of those who inhabit these spaces and,in a broader sense,as a concrete contribution to society,must address this relationship in all its complexity and generate concrete responses that incorporate the appropriate spatial attributes during the design processes.The design processes that shape living spaces confront this dialectic,and the manner in which they do so brings identity and character to them.It is believed that the higher the level of variables that are contemplated and weighted,the greater the adequacy of spaces to the changing dynamics of the people who inhabit them.This article focuses on a thorough analysis of these spatial attributes,in parallel to the definition of each one as a particular condition for design,based on their conceptualization,breakdown,and articulation.Conceptually,the following attributes are addressed:flexibility,adaptability,variability,versatility,multiplicity,plurality,integrality,gradualness,incrementality,progressiveness,independence,connectivity,intimacy,and privacy.Each of these attributes is valued as a contribution to creating adequate habitability in contextual terms,with consideration to possible integrations and combinations.

A Lightweight ABE Security Protection Scheme in Cloud Environment Based on Attribute Weight

Attribute-based encryption(ABE)is a technique used to encrypt data,it has the flexibility of access control,high security,and resistance to collusion attacks,and especially it is used in cloud security protection.However,a large number of bilinear mappings are used in ABE,and the calculation of bilinear pairing is time-consuming.So there is the problem of low efficiency.On the other hand,the decryption key is not uniquely associated with personal identification information,if the decryption key is maliciously sold,ABE is unable to achieve accountability for the user.In practical applications,shared message requires hierarchical sharing in most cases,in this paper,we present a message security hierarchy ABE scheme for this scenario.Firstly,attributes were grouped and weighted according to the importance of attributes,and then an access structure based on a threshold tree was constructed according to attribute weight.This method saved the computing time for decryption while ensuring security and on-demand access to information for users.In addition,with the help of computing power in the cloud,two-step decryption was used to complete the access,which relieved the computing and storage burden on the client side.Finally,we simulated and tested the scheme based on CP-ABE,and selected different security levels to test its performance.The security proof and the experimental simulation result showthat the proposed scheme has high efficiency and good performance,and the solution implements hierarchical access to the shared message.

Seismic Attribute Gradient Analysis and Reservoir Configuration Study of Shallow Water Delta Reservoir in Huanghekou Sag

The geological conditions of shallow offshore delta oil reservoirs are complex. Under the condition of less well data and larger well spacing, the traditional reservoir configuration method is difficult to solve the detailed study of such reservoirs in offshore oil fields. Based on the comprehensive analysis of the seismic phase, data of well log. The paper identifies criteria of the quaternary configuration boundary in shallow water delta of different types with distributary sand dam is established. At the same time, this paper used sensitive factor to construct the edge detection operator based on the amplitude attribute, characterizing the boundary of sand body thickness mutation or physical property mutation quantitatively, realizing the quantitative characterization of four-stage configuration boundary in the region with no wells or few wells, guiding the efficient development of offshore shallow water delta oilfield, and realizing the increase of storage and production of Bohai oilfield.

Modelling of Active and Latent Attributes Based on Traveler Perspectives: Case of Port City of Douala

A growing stream of study stresses the relevance of subjective elements in understanding the hierarchy of preferences that underpin individual travel behavior. The purpose of this study is to evaluate the impact of various factors on mode choice. To achieve this, a multinomial logit model (MNL) was used to analyze the relationships between mode choice and three classes of attributes;Combined Active and Latent, Active only and Latent only attributes. The data used are derived from surveys in the port city of Douala, Cameroon as a case study. Results stipulated that, the combined attributes model performed better than both active only attributes and latent only attributes models. Likewise, latent only attributes model performed better than active only attributes model. The advantage of modelling all three groups is for better selection of the most relevant attributes, and this is very relevant in understanding travel behavior of individuals and mode choice decisions.

A Neighborhood Rough Set Attribute Reduction Method Based on Attribute Importance

Attribute reduction is a hot topic in rough set research. As an extension of rough sets, neighborhood rough sets can effectively solve the problem of information loss after data discretization. However, traditional greedy-based neighborhood rough set attribute reduction algorithms have a high computational complexity and long processing time. In this paper, a novel attribute reduction algorithm based on attribute importance is proposed. By using conditional information, the attribute reduction problem in neighborhood rough sets is discussed, and the importance of attributes is measured by conditional information gain. The algorithm iteratively removes the attribute with the lowest importance, thus achieving the goal of attribute reduction. Six groups of UCI datasets are selected, and the proposed algorithm SAR is compared with L2-ELM, LapTELM, CTSVM, and TBSVM classifiers. The results demonstrate that SAR can effectively improve the time consumption and accuracy issues in attribute reduction.

Dynamic Time and Location Information in Ciphertext-Policy Attribute-Based Encryption with Multi-Authorization

Due to the mobility of users in an organization,inclusion of dynamic attributes such as time and location becomes the major challenge in Ciphertext-Policy Attribute-Based Encryption(CP-ABE).By considering this challenge;we focus to present dynamic time and location information in CP-ABE with mul-ti-authorization.Atfirst,along with the set of attributes of the users,their corre-sponding location is also embedded.Geohash is used to encode the latitude and longitude of the user’s position.Then,decrypt time period and access time period of users are defined using the new time tree(NTT)structure.The NTT sets the encrypted duration of the encrypted data and the valid access time of the private key on the data user’s private key.Besides,single authorization of attribute authority(AA)is extended as multi authorization for enhancing the effectiveness of key generation.Simulation results depict that the proposed CP-ABE achieves better encryption time,decryption time,security level and memory usage.Namely,encryption time and decryption time of the proposed CP-ABE are reduced to 19%and 16%than that of existing CP-ABE scheme.

Direct hydrocarbon identification in shale oil reservoirs using fluid dispersion attribute based on an extended frequency-dependent seismic inversion scheme

The identification of hydrocarbons using seismic methods is critical in the prediction of shale oil res-ervoirs.However,delineating shales of high oil saturation is challenging owing to the similarity in the elastic properties of oil-and water-bearing shales.The complexity of the organic matter properties associated with kerogen and hydrocarbon further complicates the characterization of shale oil reservoirs using seismic methods.Nevertheless,the inelastic shale properties associated with oil saturation can enable the utilization of velocity dispersion for hydrocarbon identification in shales.In this study,a seismic inversion scheme based on the fluid dispersion attribute was proposed for the estimation of hydrocarbon enrichment.In the proposed approach,the conventional frequency-dependent inversion scheme was extended by incorporating the PP-wave reflection coefficient presented in terms of the effective fluid bulk modulus.A rock physics model for shale oil reservoirs was constructed to describe the relationship between hydrocarbon saturation and shale inelasticity.According to the modeling results,the hydrocarbon sensitivity of the frequency-dependent effective fluid bulk modulus is superior to the traditional compressional wave velocity dispersion of shales.Quantitative analysis of the inversion re-sults based on synthetics also reveals that the proposed approach identifies the oil saturation and related hydrocarbon enrichment better than the above-mentioned conventional approach.Meanwhile,in real data applications,actual drilling results validate the superiority of the proposed fluid dispersion attribute as a useful hydrocarbon indicator in shale oil reservoirs.

Structural attributes,evolution and petroleum geological significances of the Tongnan negative structure in the central Sichuan Basin,SW China

The Tongnan secondary negative structure in central Sichuan Basin has controls and influences on the structural framework and petroleum geological conditions in the Gaoshiti-Moxi area.To clarify the controls and influences,the deformation characteristics,structural attributes and evolution process of the Tongnan negative structure were investigated through a series of qualitative and quantitative methods such as balanced profile restoration,area-depth-strain(ADS)analysis,and structural geometric forward numerical simulation,after comprehensive structural interpretation of high-precision 3D seismic data.The results are obtained in three aspects.First,above and below the P/AnP(Permian/pre-Permian)unconformity,the Tongnan negative structure demonstrates vertical differential structural deformation.It experiences two stages of structural stacking and reworking:extensional depression(from the Sinian Dengying Formation to the Permian),and compressional syncline deformation(after the Jurassic).The multi-phase trishear deformation of the preexisting deep normal faults dominated the extensional depression.The primary depression episodes occurred in the periods from the end of Late Proterozoic to the deposition of the 1st–2nd members of the Dengying Formation,and from the deposition of Lower Cambrian Longwangmiao Formation–Middle–Upper Cambrian until the Ordovician.Second,the multi-stage evolution process of the Tongnan negative structure controlled the oil and gas migration and adjustment and present-day differential gas and water distribution between the Tongnan negative structure and the Gaoshiti and Moxi-Longnüsi structural highs.Third,the Ordovician,which is limitedly distributed in the Tongnan negative structure and is truncated by the P/AnP unconformity on the top,has basic geological conditions for the formation of weathering karst carbonate reservoirs.It is a new petroleum target deserving attention.

Multi-Attribute Couplings-Based Euclidean and Nominal Distances for Unlabeled Nominal Data

Learning unlabeled data is a significant challenge that needs to han-dle complicated relationships between nominal values and attributes.Increas-ingly,recent research on learning value relations within and between attributes has shown significant improvement in clustering and outlier detection,etc.However,typical existing work relies on learning pairwise value relations but weakens or overlooks the direct couplings between multiple attributes.This paper thus proposes two novel and flexible multi-attribute couplings-based distance(MCD)metrics,which learn the multi-attribute couplings and their strengths in nominal data based on information theories:self-information,entropy,and mutual information,for measuring both numerical and nominal distances.MCD enables the application of numerical and nominal clustering methods on nominal data and quantifies the influence of involving and filtering multi-attribute couplings on distance learning and clustering perfor-mance.Substantial experiments evidence the above conclusions on 15 data sets against seven state-of-the-art distance measures with various feature selection methods for both numerical and nominal clustering.

Secured Access Policy in Ciphertext-Policy Attribute-Based Encryption for Cloud Environment

The cloud allows clients to store and share data.Depending on the user’s needs,it is imperative to design an effective access control plan to share the information only with approved users.The user loses control of their data when the data is outsourced to the cloud.Therefore,access control mechanisms will become a significant challenging problem.The Ciphertext-Policy Attribute-Based Encryption(CP-ABE)is an essential solution in which the user can control data access.CP-ABE encrypts the data under a limited access policy after the user sets some access policies.The user can decrypt the data if they satisfy the limited access policy.Although CP-ABE is an effective access control program,the privacy of the policy might be compromised by the attackers.Namely,the attackers can gather important information from plain text policy.To address this issue,the SHA-512 algorithm is presented to create a hash code for the user’s attributes in this paper.Depending on the created hash codes,an access policy will be formed.It leads to protecting the access policy against attacks.The effectiveness of the proposed scheme is assessed based on decryption time,private key generation time,ciphertext generation time,and data verification time.

Quantitative evaluation of gas hydrate reservoir by AVO attributes analysis based on the Brekhovskikh equation

AVO (Amplitude variation with offset) technology is widely used in gas hydrate research. BSR (Bottom simulating reflector), caused by the huge difference in wave impedance between the hydrate reservoir and the underlying free gas reservoir, is the bottom boundary mark of the hydrate reservoir. Analyzing the AVO attributes of BSR can evaluate hydrate reservoirs. However, the Zoeppritz equation which is the theoretical basis of conventional AVO technology has inherent problems: the Zoeppritz equation does not consider the influence of thin layer thickness on reflection coefficients;the approximation of the Zoeppritz equation assumes that the difference of wave impedance between the two sides of the interface is small. These assumptions are not consistent with the occurrence characteristics of natural gas hydrate. The Brekhovskikh equation, which is more suitable for thin-layer reflection coefficient calculation, is used as the theoretical basis for AVO analysis. The reflection coefficients calculated by the Brekhovskikh equation are complex numbers with phase angles. Therefore, attributes of the reflection coefficient and its phase angle changing with offset are used to analyze the hydrate reservoir's porosity, saturation, and thickness. Finally, the random forest algorithm is used to predict the reservoir porosity, hydrate saturation, and thickness of the hydrate reservoir. In the synthetic data, the inversion results based on the four attributes of the Brekhovskikh equation are better than the conventional inversion results based on the two attributes of Zoeppritz, and the thickness can be accurately predicted. The proposed method also achieves good results in the application of Blake Ridge data. According to the method proposed in this paper, the hydrate reservoir in the area has a high porosity (more than 50%), and a medium saturation (between 10% and 20%). The thickness is mainly between 200m and 300m. It is consistent with the previous results obtained by velocity analysis.

Fusing Supervised and Unsupervised Measures for Attribute Reduction

It is well-known that attribute reduction is a crucial action of rough set.The significant characteristic of attribute reduction is that it can reduce the dimensions of data with clear semantic explanations.Normally,the learning performance of attributes in derived reduct is much more crucial.Since related measures of rough set dominate the whole process of identifying qualified attributes and deriving reduct,those measures may have a direct impact on the performance of selected attributes in reduct.However,most previous researches about attribute reduction take measures related to either supervised perspective or unsupervised perspective,which are insufficient to identify attributes with superior learning performance,such as stability and accuracy.In order to improve the classification stability and classification accuracy of reduct,in this paper,a novel measure is proposed based on the fusion of supervised and unsupervised perspectives:(1)in terms of supervised perspective,approximation quality is helpful in quantitatively characterizing the relationship between attributes and labels;(2)in terms of unsupervised perspective,conditional entropy is helpful in quantitatively describing the internal structure of data itself.In order to prove the effectiveness of the proposed measure,18 University of CaliforniaIrvine(UCI)datasets and 2 Yale face datasets have been employed in the comparative experiments.Finally,the experimental results show that the proposed measure does well in selecting attributes which can provide distinguished classification stabilities and classification accuracies.

Two-Layer Information Granulation:Mapping-Equivalence Neighborhood Rough Set and Its Attribute Reduction

Attribute reduction,as one of the essential applications of the rough set,has attracted extensive attention from scholars.Information granulation is a key step of attribute reduction,and its efficiency has a significant impact on the overall efficiency of attribute reduction.The information granulation of the existing neighborhood rough set models is usually a single layer,and the construction of each information granule needs to search all the samples in the universe,which is inefficient.To fill such gap,a new neighborhood rough set model is proposed,which aims to improve the efficiency of attribute reduction by means of two-layer information granulation.The first layer of information granulation constructs a mapping-equivalence relation that divides the universe into multiple mutually independent mapping-equivalence classes.The second layer of information granulation views each mapping-equivalence class as a sub-universe and then performs neighborhood informa-tion granulation.A model named mapping-equivalence neighborhood rough set model is derived from the strategy of two-layer information granulation.Experimental results show that compared with other neighborhood rough set models,this model can effectively improve the efficiency of attribute reduction and reduce the uncertainty of the system.The strategy provides a new thinking for the exploration of neighborhood rough set models and the study of attribute reduction acceleration problems.

An Update Method of Decision Implication Canonical Basis on Attribute Granulating

Decision implication is a form of decision knowledge represen-tation,which is able to avoid generating attribute implications that occur between condition attributes and between decision attributes.Compared with other forms of decision knowledge representation,decision implication has a stronger knowledge representation capability.Attribute granularization may facilitate the knowledge extraction of different attribute granularity layers and thus is of application significance.Decision implication canonical basis(DICB)is the most compact set of decision implications,which can efficiently represent all knowledge in the decision context.In order to mine all deci-sion information on decision context under attribute granulating,this paper proposes an updated method of DICB.To this end,the paper reduces the update of DICB to the updates of decision premises after deleting an attribute and after adding granulation attributes of some attributes.Based on this,the paper analyzes the changes of decision premises,examines the properties of decision premises,designs an algorithm for incrementally generating DICB,and verifies its effectiveness through experiments.In real life,by using the updated algorithm of DICB,users may obtain all decision knowledge on decision context after attribute granularization.

A Novel Incremental Attribute Reduction Algorithm Based on Intuitionistic Fuzzy Partition Distance

Attribute reduction,also known as feature selection,for decision information systems is one of the most pivotal issues in machine learning and data mining.Approaches based on the rough set theory and some extensions were proved to be efficient for dealing with the problemof attribute reduction.Unfortunately,the intuitionistic fuzzy sets based methods have not received much interest,while these methods are well-known as a very powerful approach to noisy decision tables,i.e.,data tables with the low initial classification accuracy.Therefore,this paper provides a novel incremental attribute reductionmethod to dealmore effectivelywith noisy decision tables,especially for highdimensional ones.In particular,we define a new reduct and then design an original attribute reduction method based on the distance measure between two intuitionistic fuzzy partitions.It should be noted that the intuitionistic fuzzypartitiondistance iswell-knownas aneffectivemeasure todetermine important attributes.More interestingly,an incremental formula is also developed to quickly compute the intuitionistic fuzzy partition distance in case when the decision table increases in the number of objects.This formula is then applied to construct an incremental attribute reduction algorithm for handling such dynamic tables.Besides,some experiments are conducted on real datasets to show that our method is far superior to the fuzzy rough set based methods in terms of the size of reduct and the classification accuracy.

CoLM^(2)S:Contrastive self‐supervised learning on attributed multiplex graph network with multi‐scale information

Contrastive self‐supervised representation learning on attributed graph networks with Graph Neural Networks has attracted considerable research interest recently.However,there are still two challenges.First,most of the real‐word system are multiple relations,where entities are linked by different types of relations,and each relation is a view of the graph network.Second,the rich multi‐scale information(structure‐level and feature‐level)of the graph network can be seen as self‐supervised signals,which are not fully exploited.A novel contrastive self‐supervised representation learning framework on attributed multiplex graph networks with multi‐scale(named CoLM^(2)S)information is presented in this study.It mainly contains two components:intra‐relation contrast learning and interrelation contrastive learning.Specifically,the contrastive self‐supervised representation learning framework on attributed single‐layer graph networks with multi‐scale information(CoLMS)framework with the graph convolutional network as encoder to capture the intra‐relation information with multi‐scale structure‐level and feature‐level selfsupervised signals is introduced first.The structure‐level information includes the edge structure and sub‐graph structure,and the feature‐level information represents the output of different graph convolutional layer.Second,according to the consensus assumption among inter‐relations,the CoLM^(2)S framework is proposed to jointly learn various graph relations in attributed multiplex graph network to achieve global consensus node embedding.The proposed method can fully distil the graph information.Extensive experiments on unsupervised node clustering and graph visualisation tasks demonstrate the effectiveness of our methods,and it outperforms existing competitive baselines.

Classifying Big Medical Data through Bootstrap Decision Forest Using Penalizing Attributes

Decision forest is a well-renowned machine learning technique to address the detection and prediction problems related to clinical data.But,the tra-ditional decision forest(DF)algorithms have lower classification accuracy and cannot handle high-dimensional feature space effectively.In this work,we pro-pose a bootstrap decision forest using penalizing attributes(BFPA)algorithm to predict heart disease with higher accuracy.This work integrates a significance-based attribute selection(SAS)algorithm with the BFPA classifier to improve the performance of the diagnostic system in identifying cardiac illness.The pro-posed SAS algorithm is used to determine the correlation among attributes and to select the optimum subset of feature space for learning and testing processes.BFPA selects the optimal number of learning and testing data points as well as the density of trees in the forest to realize higher prediction accuracy in classifying imbalanced datasets effectively.The effectiveness of the developed classifier is cautiously verified on the real-world database(i.e.,Heart disease dataset from UCI repository)by relating its enactment with many advanced approaches with respect to the accuracy,sensitivity,specificity,precision,and intersection over-union(IoU).The empirical results demonstrate that the intended classification approach outdoes other approaches with superior enactment regarding the accu-racy,precision,sensitivity,specificity,and IoU of 94.7%,99.2%,90.1%,91.1%,and 90.4%,correspondingly.Additionally,we carry out Wilcoxon’s rank-sum test to determine whether our proposed classifier with feature selection method enables a noteworthy enhancement related to other classifiers or not.From the experimental results,we can conclude that the integration of SAS and BFPA outperforms other classifiers recently reported in the literature.