Finding pareto-front membership functions in fuzzy data mining

10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Transactions with quantitative values are commonly seen in real-world applications. Fuzzy mining algorithms have thus been developed recently to induce linguistic knowledge from quantitative databases. In fuzzy data mining, the membership functions have a critical influence on the final mining results. How to effectively decide the membership functions in fuzzy data mining thus becomes very important. In the past, we proposed a fuzzy mining approach based on the Multi-Objective Genetic Algorithm (MOGA) to find the Pareto front of the desired membership functions. In this paper, we adopt a more sophisticated multi-objective approach, the SPEA2, to find the appropriate sets of membership functions for fuzzy data mining. Two objective functions are used to find the Pareto front. The first one is the suitability of membership functions and the second one is the total number of large 1-itemsets derived. Experimental comparisons of the proposed and the previous approaches are also made to show the effectiveness of the proposed approach in finding the Pareto-front membership functions. © 2012, Copyright the authors.

Cite

CITATION STYLE

APA

Chen, C. H., Hong, T. P., & Tseng, V. S. (2012). Finding pareto-front membership functions in fuzzy data mining. International Journal of Computational Intelligence Systems, 5(2), 343–354. https://doi.org/10.1080/18756891.2012.685314

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free