.png){kind=icon}
.png){kind=icon}
Return
An agent model for rough classifiers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.08.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a new agent-based approach in rough set classification theory. In data mining, the rough set technique is one classification technique. It generates rules from a large database and has mechanisms to handle noise and uncertainty in data. However, producing a rough classification model or rough classifier is computationally expensive, especially in its reduct computation phase: this is an NP-hard problem. These problems have brought about the generation of large amount of rules and high processing time. We solve these problems by embedding an agent-based algorithm within the rough modelling framework. In this study, the classifiers are based on creating agents within the main modelling processes such as reduct computation, rules generation and attribute projections. Four main agents are introduced: the interaction agent, weighted agent, reduction agent and default agent. We propose a heuristic for the default agent to control its searching activity. Experiments show that the proposed method significantly reduces the running time and the number of rules while maintaining the same classification accuracy. (C) 2010 Elsevier B.V. All rights reserved.
Keywords:
Agent models
Reduction
Agent's interaction
Default rules
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W