Incremental learning in attributenets with dynamic reduct and IQuickReduct

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Incremental learning is becoming more essential in the real world problems in which a decision system is being updated frequently. AttributeNets is a classifier whose representation allows updating the classifier when new data is added incrementally. In this paper the impact of reduct on the performance of AttributeNets as an Incremental Classifier is investigated. This philosophy has been demonstrated by adopting two varieties of reducts, namely dynamic reduct and IQuickReduct. These reducts were used to study the capability of AttributeNets for classification with reduced attributes. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Sai Prasad, P. S. V. S., Hima Bindu, K., & Raghavendra Rao, C. (2011). Incremental learning in attributenets with dynamic reduct and IQuickReduct. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6954 LNAI, pp. 195–200). https://doi.org/10.1007/978-3-642-24425-4_27

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