f-Slip: An Efficient Privacy-Preserving Data Publishing Framework for 1: M Microdata with Multiple Sensitive Attributes.

Privacy of the individuals plays a vital role when a dataset is disclosed in public. Privacy-preserving data publishing is a process of releasing the anonymized dataset for various purposes of analysis and research. The data to be published contain several sensitive attributes such as diseases, salary, symptoms, etc. Earlier, researchers have dealt with datasets considering it would contain only one record for an individual [1:1 dataset], which is uncompromising in various applications. Later, many researchers concentrate on the dataset, where an individual has multiple records [1:M dataset]. In the paper, a model f-slip was proposed that can address the various attacks such as Background Knowledge (bk) attack, Multiple Sensitive attribute correlation attack (MSAcorr), Quasi-identifier correlation attack(QIcorr), Non-membership correlation attack(NMcorr) and Membership correlation attack(Mcorr) in 1:M dataset and the solutions for the attacks. In f -slip, the anatomization was performed to divide the table into two subtables consisting of i) quasi-identifier and ii) sensitive attributes. The correlation of sensitive attributes is computed to anonymize the sensitive attributes without breaking the linking relationship. Further, the quasi-identifier table was divided and k-anonymity was implemented on it. An efficient anonymization technique, frequency-slicing (f-slicing), was also developed to anonymize the sensitive attributes. The f -slip model is consistent as the number of records increases. Extensive experiments were performed on a real-world dataset Informs and proved that the f -slip model outstrips the state-of-the-art techniques in terms of utility loss, efficiency and also acquires an optimal balance between privacy and utility.

Class center-based firefly algorithm for handling missing data

A significant advancement that occurs during the data cleaning stage is estimating missing data. Studies have shown that improper data handling leads to inaccurate analysis. Furthermore, most studies indicate the occurrence of missing data irrespective of the correlation between attributes. However, an adaptive search procedure helps to determine the estimates of the missing data when correlations between attributes are considered in the process. Firefly Algorithm (FA) implements an adaptive search procedure in the imputation of the missing data by determining the estimated value closest to others' value. Therefore, this study proposes a class center-based adaptive approach model for retrieving missing data by considering the attribute correlation in the imputation process (C3-FA). The result showed that the class center-based firefly algorithm (FA) is an efficient technique for obtaining the actual value in handling missing data with the Pearson correlation coefficient (r) and root mean squared error (RMSE) close to 1 and 0, respectively. In addition, the proposed method has the ability to maintain the true distribution of data values. This is indicated by the Kolmogorov–Smirnov test, which stated that the value of DKS for most attributes in the dataset is generally closer to 0. Furthermore, the accuracy evaluation results using three classifiers showed that the proposed method produces good accuracy.

Class Center-Based Firefly Algorithm for Handling Missing Data

A significant advancement that occurs during the data cleaning stage is estimating missing data. Studies have shown that improper data handling leads to inaccurate analysis. Furthermore, most studies indicate the occurrence of missing data irrespective of the correlation between attributes . However, an adaptive search procedure helps to determine the estimates of the missing data when correlations between attributes are considered in the process. Firefly Algorithm (FA) implements an adaptive search procedure in the imputation of the missing data by determining the estimated value closest to others' value. Therefore, this study proposes a class center-based adaptive approach model for retrieving missing data by considering the attribute correlation in the imputation process (C3-FA). The result showed that the class center-based firefly algorithm (FA) is an efficient technique for obtaining the actual value in handling missing data with the Pearson correlation coefficient ( r ) and root mean squared error (RMSE) close to 1 and 0, respectively. In addition, the proposed method has the ability to maintain the true distribution of data values. This is indicated by the Kolmogorov–Smirnov test, which stated that the value of DKS for most attributes in the dataset is generally closer to 0. Furthermore, the accuracy evaluation results using three classifiers showed that the proposed method produces good accuracy.

Intuitionistic fuzzy three-way formal concept analysis based attribute correlation degree

As an important expanded of the classical formal concept, the three-way formal concept analysis integrates more information with the three-way decision theory. However, to the best of our knowledge, few scholars have studied the intuitionistic fuzzy three-way formal concept analysis. This paper proposes an intuitionistic fuzzy three-way formal concept analysis model based on the attribute correlation degree. To achieve this, we comprehensively analyze the composition of attribute correlation degree in the intuitionistic fuzzy environment, and introduce the corresponding calculation methods for different situations, as well as prove the related properties. Furthermore, we investigate the intuitionistic fuzzy three-way concept lattice ((IF3WCL) of object-induced and attribute-induced. Then, the relationship between the IF3WCL and the positive, negative and boundary domains in the three-way decision are discussed. In addition, considering the final decision problem of boundary objects, the secondary decision strategy of boundary objects is obtained for IF3WCL. Finally, a numerical example of multinational company investment illustrates the effectiveness of the proposed model. In this paper, we systematically study the IF3WCL, and give a quantitative analysis method of formal concept decision along with its connection with three-way decision, which provides new ideas for the related research.

Generalized q-ROF TODIM Decision-Making Method Considering Attribute Correlation

Aiming at solving the problem of q-ROF fuzzy multi-attribute decision-making with attribute relevance, a generalized q-ROF TODIM decision-making method considering attribute correlation is proposed in this paper. According to the generalized TODIM decision method, the profit or loss values of each scheme relative to other schemes are calculated, and the idea of Choquet integral is used to integrate the income or loss values of all attributes of the scheme in the case of attribute association, the overall perceived dominance of each scheme is calculated, and the alternative schemes are ranked according to the overall perceived dominance of the scheme. Finally, combined with an example, the influence of parameter changed on the decision-making results is analyzed, and the feasibility and effectiveness of the method are verified.

COMPARISON OF TWO METHODS FOR GENERATING THE COALITIONS OF CLASSIFIERS AND TWO METHODS FOR REDUCING DIMENSIONALITY IN A DISPERSED DECISION-MAKING SYSTEM

In this paper, we consider a system in which knowledge in a dispersed form is available. In the system local classifiers are combined into coalitions. Two methods of combining classifiers in coalitions are discussed in this paper — with a hierarchical agglomeration algorithm and with Pawlak’s conflict model. The purpose of this paper is to apply methods for reducing dimensionality in these two approaches. Two methods of attribute reduction are considered — based on the rough set theory and based on attribute correlation with decision class. The most important conclusions formulated in the paper are as follows. The use of attribute selection method improves the quality of classification of the dispersed system. Better results are generated by the system with a hierarchical agglomeration algorithm.