Enhancement of fraternal K-median algorithm with CNN for high dropout probabilities to evolve optimal time-complexity

摘要

Machine learning era began to rule almost all the technologies, which influences the improvement of the performance due to its intelligent computing methodologies. Especially the Deep Learning algorithm plays a vital role in computing a human-like decision, which is considered to be the superior breakthrough technology of the century. Deep Learning algorithms generate a massive sum of features which is stacked and learned by many other neurons of the network in the term of links. Links initiated from the input and ends in the output of the network connecting many neurons on its path. The significant limitation of this network is its thirst towards the high computation power. This paper represents a methodology to make the system consume less computation requirement during its training or testing phase. In this process, an effective clustering algorithm (fraternal K-median clustering) is used as the preprocessing strategies, and as the second phase the dropout regularization procedure is implemented (in the Convolutional Neural Network, a type of Deep Learning algorithm) to eliminate most of the insignificant data. The dropout strategies used in the process helps in the improvement of accuracy by making the network overfit the decision of CNN, obtaining state-of-the-art results.