Parametric Decomposition of Sample Space for Classification
Lal, S., Kulkarni, P., Singh, A.
Journal of Intelligent Systems · 2010
doi:10.1515/jisys.2010.19.2.163 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In classification task training, sample size and high feature dimensionality enhance the computational complexity of algorithms.Therefore, many algorithms tend to work with reduced feature set and hence ignore contribution of all relevant parameters.This paper presents an Incremental, Simple, Efficient and Accurate (I-SEA) algorithm to consider contribution of all available relevant parameters while keeping the computational complexity and accuracy within acceptable limits.I-SEA partitions the training sample space during the preprocessing stage as part of learning.Partitioning is done based on parameter values, taking one at a time, resulting into equivalent classes with respect to the parameter.During classification, these sets are selected based on parameter values of the test case and the result is collated.The algorithm supports incremental learning at a cost of O(m).The average case complexity of classification is O(m (Iog 2 nf).
Abstract licence: CC BY-NC-ND
References10
10 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.