5 research outputs found

    The Use of Rough Set Theory in Determining the Preferences of the Customers of an Insurance Agency

    Get PDF
    In today’s market environment a fierce competition is being experienced. It can be clearly stated that the businesses that determine the customer profiles well and manufacture related products in accordance with the requests/needs of the customers gain superiority over their rivals. Within this scope, this fact is also an important issue for the companies that are trying to keep up with other competitors in the insurance sector. In this study, this critical problem of EPD which is an agency of Allianz Insurance was solved by using Rough Set Theory (RST) method. Ten condition attributes (i.e. age, gender, etc.) were examined in the study. Decision attribute is the variable of the insurance type which includes individual retirement, health and life insurances. With the method of RST, a set of rules were identified which may help in developing strategies that will bring in new customers to EPD while keeping present ones. The attained results were presented to the executives of EPD. The executives have re-determined their marketing strategies in compliance with these results and exercised these strategies accordingly. Feedbacks from the executives indicated that the RST helps in facilitating the development of marketing strategies based on the characteristics of the customers and determining their profiles. Keywords: Rough set theory, customer’s profile, insurance, decision rule

    New rough set based maximum partitioning attribute algorithm for categorical data clustering

    Get PDF
    Clustering a set of data into homogeneous groups is a fundamental operation in data mining. Recently, consideration has been put on categorical data clustering, where the data set consists of non-numerical attributes. However, implementing several existing categorical clustering algorithms is challenging as some cannot handle uncertainty while others have stability issues. The Rough Set theory (RST) is a mathematical tool for dealing with categorical data and handling uncertainty. It is also used to identify cause-effect relationships in databases as a form of learning and data mining. Therefore, this study aims to address the issues of uncertainty and stability for categorical clustering, and it proposes an improved algorithm centred on RST. The proposed method employed the partitioning measure to calculate the information system's positive and boundary regions of attributes. Firstly, an attributes partitioning method called Positive Region-based Indiscernibility (PRI) was developed to address the uncertainty issue in attribute partitioning for categorical data. The PRI method requires the positive and boundary regions-based partitioning calculation method. Next, to address the computational complexity issue in the clustering process, a clustering attribute selection method called Maximum Mean Partitioning (MMP) is introduced by computing the mean. The MMP method selects the maximum degree of the mean attribute, and the attribute with the maximum mean partitioning value is chosen as the best clustering attribute. The integration of proposed PRI and MMP methods generated a new rough set hybrid clustering algorithm for categorical data clustering algorithm named Maximum Partitioning Attribute (MPA) algorithm. This hybrid algorithm is an all-inclusive solution for uncertainty, computational complexity, cluster purity, and higher accuracy in attribute partitioning and selecting a clustering attribute. The proposed MPA algorithm is compared against the baseline algorithms, namely Maximum Significance Attribute (MSA), Information-Theoretic Dependency Roughness (ITDR), Maximum Indiscernibility Attribute (MIA), and simple classical K-Mean. In addition, seven small data sets from previously utilized research cases and 21 UCI repository and benchmark datasets are used for validation. Finally, the results were presented in tabular and graphical form, showing the proposed MPA algorithm outperforms the baseline algorithms for all data sets. Furthermore, the results showed that the proposed MPA algorithm improves the rough accuracy against MSA, ITDR, and MIA by 54.42%. Hence, the MPA algorithm has reduced the computational complexity compared to MSA, ITDR, and MIA with 77.11% less time and 58.66% minimum iterations. Similarly, a significant percentage improvement, up to 97.35%, was observed for overall purity by the MPA algorithm against MSA, ITDR, and MIA. In addition, the increment up to 34.41% of the overall accuracy of simple K-means by MPA has been obtained. Hence, it is proven that the proposed MPA has given promising solutions to address the categorical data clustering problem

    Web-based Support Systems with Rough Set Analysis

    No full text
    Abstract. Rough sets have been applied to many areas where multiattribute data is needed to be analyzed to acquire knowledge for decision making. Web-based Support Systems (WSS) are a new research area that aims to support human activities and extend human physical limitations of information processing with Web technologies. The applications of rough set analysis for WSS is looked at in this article. In particular, our focus will be on Web-Based Medical Support Systems (WMSS). A WMSS is a support system that integrates medicine practices (diagnosis and surveillance) with computer science and Web technologies. We will explore some of the challenges of using rough sets in a WMSS and detail some of the applications of rough sets in analyzing medical data.
    corecore