Complexity Approximation of Classification Task for Large Dataset Ensemble Artificial Neural Networks
| Autor: | Nazirah Abd Hamid, Mumtazimah Mohamad, Yazid Mohd Saman |
|---|---|
| Rok vydání: | 2019 |
| Předmět: | |
| Zdroj: | Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015) ISBN: 9789811317972 DaEng |
| DOI: | 10.1007/978-981-13-1799-6_21 |
| Popis: | In this paper, operational and complexity analysis model for ensemble Artificial Neural Networks (ANN) multiple classifiers are investigated. The main idea behind this, is lie on large dataset classification complexity and burden are to be moderated by using partitioning for parallel tasks and combining them to enhance the capability of a classifier. The complexity of the single ANN and ensemble ANN are obtained from the estimates of upper bounds of converged functional error with the partitioning of dataset. The estimates derived using Apriori method shows that the use of an ensemble ANN with different approach is feasible where such problem with a high number of inputs and classes can be solved with time complexity of \( {\text{O}}\left( {{\text{n}}^{\text{k}} } \right) \) for some \( {\text{k}} \), which is a type of polynomial. This result is in line with the importance of good performance achieved by diversity rule applied with the use of reordering technique. As a conclusion, an ensemble heterogeneous ANN classifier is practical and relevance to theoretical and experimental of combiners for ensemble ANN classifier systems for large dataset. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|