.png){kind=icon}
.png){kind=icon}
Return
Pareto-based multi-objective optimization for classification in data mining
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-016-0643-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper explores the possibility of classification based on Pareto multi-objective optimization. The efforts on solving optimization problems using the Pareto-based MOO methodology have gained increasing impetus on comparison of selected constraints. Moreover we have different types of classification problem based on optimization model like single objective optimization, MOO, Pareto optimization and convex optimization. All above techniques fail to generate distinguished class/subclass from existing class based on sensitive data. However, in this regard Pareto-based MOO approach is more powerful and effective in addressing various data mining tasks such as clustering, feature selection, classification, and knowledge extraction. The primary contribution of this paper is to solve such noble classification problem. Our work provides an overview of the existing research on MOO and contribution of Pareto based MOO focusing on classification. Particularly, the entire work deals with association of sub-features for noble classification. Moreover potentially interesting sub-features in MOO for classification are used to strengthen the concept of Pareto based MOO. Experiment has been carried out to validate the theory with different real world data sets which are more sensitive in nature. Finally, experimental results provide effectiveness of the proposed method using sensitive data.
Keywords:
Multi-objective optimization
Pareto optimization
Classification
Data mining
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.1
Papers:
5.0K
Citations:
7.5K
Organization
No organization information available