Institution
Rajasthan Technical University
Education•Kota, Rajasthan, India•
About: Rajasthan Technical University is a(n) education organization based out in Kota, Rajasthan, India. It is known for research contribution in the topic(s): Photovoltaic system & PID controller. The organization has 716 authors who have published 1084 publication(s) receiving 4530 citation(s). The organization is also known as: RTU.
Papers
More filters
[...]
TL;DR: A hybridization of ABC and DE algorithms to develop a more efficient meta-heuristic algorithm than ABC andDE is proposed and results indicate that HABCDE would be a competitive algorithm in the field of meta- heuristics.
Abstract: Artificial Bee Colony (ABC) and Differential Evolution (DE) are two very popular and efficient meta-heuristic algorithms. However, both algorithms have been applied to various science and engineering optimization problems, extensively, the algorithms suffer from premature convergence, unbalanced exploration-exploitation, and sometimes slow convergence speed. Hybridization of ABC and DE may provide a platform for developing a meta-heuristic algorithm with better convergence speed and a better balance between exploration and exploitation capabilities. This paper proposes a hybridization of ABC and DE algorithms to develop a more efficient meta-heuristic algorithm than ABC and DE. In the proposed hybrid algorithm, Hybrid Artificial Bee Colony with Differential Evolution (HABCDE), the onlooker bee phase of ABC is inspired from DE. Employed bee phase is modified by employing the concept of the best individual while scout bee phase has also been modified for higher exploration. The proposed HABCDE has been tested over 20 test problems and 4 real-world optimization problems. The performance of HABCDE is compared with the basic version of ABC and DE. The results are also compared with state-of-the-art algorithms, namely Covariance Matrix Adaptation Evolution Strategy (CMA-ES), Particle Swarm Optimization (PSO), Biogeography Based Optimization (BBO) and Spider Monkey Optimization (SMO) to establish the superiority of the proposed algorithm. For further validation of the proposed hybridization, the experimental results are also compared with other hybrid versions of ABC and DE, namely ABC-DE, DE-BCO and HDABCA and with modified ABC algorithms, namely Best-So-Far ABC (BSFABC), Gbest guided ABC (GABC) and modified ABC (MABC). Results indicate that HABCDE would be a competitive algorithm in the field of meta-heuristics.
101 citations
[...]
TL;DR: In this paper, a hybrid numerical scheme based on the homotopy analysis transform method (HATM) was proposed to examine the fractional model of nonlinear wave-like equations having variable coefficients, which narrated the evolution of stochastic systems.
Abstract: In this work, we aim to present a hybrid numerical scheme based on the homotopy analysis transform method (HATM) to examine the fractional model of nonlinear wave-like equations having variable coefficients, which narrate the evolution of stochastic systems. The wave-like equation models the erratic motions of small particles that are dipped in fluids and fluctuations of the stochastic behavior of exchange rates. The uniqueness and existence of HATM solution have also been discussed. Some numerical examples are given to establish the accurateness and effectiveness of the suggested scheme. Furthermore, we show that the proposed computational approach can give much better approximation than perturbation and Adomain decomposition method, which are the special cases of HATM. The result exhibits that the HATM is very productive, straight out and computationally very attractive.
82 citations
[...]
TL;DR: This paper introduces a novel exponential spider monkey optimization which is employed to fix the significant features from high dimensional set of features generated by SPAM and demonstrates that the selected features by Exponential SMO effectively increase the classification reliability of the classifier in comparison to the considered feature selection approaches.
Abstract: Agriculture is one of the prime sources of economy and a large community is involved in cropping various plants based on the environmental conditions. However, a number of challenges are faced by the farmers including different diseases of plants. The detection and prevention of plant diseases are the serious concern and should be treated well on time for increasing the productivity. Therefore, an automated plant disease detection system can be more beneficial for monitoring the plants. Generally, the most diseases may be detected and classified from the symptoms appeared on the leaves. For the same, extraction of relevant features plays an important role. A number of methods exists to generate high dimensional features to be used in plant disease classification problem such as SPAM, CHEN, LIU, and many more. However, generated features also include unrelated and inessential features that lead to degradation in performance and computational efficiency of a classification problem. Therefore, the choice of notable features from the high dimensional feature set is required to increase the computational efficiency and accuracy of a classifier. This paper introduces a novel exponential spider monkey optimization which is employed to fix the significant features from high dimensional set of features generated by SPAM. Furthermore, the selected features are fed to support vector machine for classification of plants into diseased plants and healthy plants using some important characteristics of the leaves. The experimental outcomes illustrate that the selected features by Exponential SMO effectively increase the classification reliability of the classifier in comparison to the considered feature selection approaches.
51 citations
[...]
TL;DR: The evaluation of the results shows that LSTM is able to outperform traditional machine learning methods for detection of spam with a considerable margin.
Abstract: Classifying spam is a topic of ongoing research in the area of natural language processing, especially with the increase in the usage of the Internet for social networking. This has given rise to the increase in spam activity by the spammers who try to take commercial or non-commercial advantage by sending the spam messages. In this paper, we have implemented an evolving area of technique known as deep learning technique. A special architecture known as Long Short Term Memory (LSTM), a variant of the Recursive Neural Network (RNN) is used for spam classification. It has an ability to learn abstract features unlike traditional classifiers, where the features are hand-crafted. Before using the LSTM for classification task, the text is converted into semantic word vectors with the help of word2vec, WordNet and ConceptNet. The classification results are compared with the benchmark classifiers like SVM, Naive Bayes, ANN, k-NN and Random Forest. Two corpuses are used for comparison of results: SMS Spam Collection dataset and Twitter dataset. The results are evaluated using metrics like Accuracy and F measure. The evaluation of the results shows that LSTM is able to outperform traditional machine learning methods for detection of spam with a considerable margin.
45 citations
[...]
TL;DR: In this article, the authors derived the solution of the fractional kinetic equation involving generalized Bessel function of first kind and generalized Struve function of the first kind in terms of a generalized Borschtein function.
Abstract: In recent paper Dinesh Kumar et al developed a generalized fractional kinetic equation involving generalized Bessel function of first kind The object of this paper is to derive the solution of the fractional kinetic equation involving generalized Struve function of the first kind The results obtained in terms of generalized Struve function of first kind are rather general in nature and can easily construct various known and new fractional kinetic equations
44 citations
Authors
Showing all 716 results
Name | H-index | Papers | Citations |
---|---|---|---|
Dinesh Kumar | 69 | 1333 | 24342 |
Seema Agarwal | 52 | 309 | 12325 |
Vikas Bansal | 43 | 184 | 23455 |
Rajeev Gupta | 33 | 231 | 3704 |
Harish Sharma | 24 | 139 | 1963 |
Basant Agarwal | 21 | 66 | 1386 |
Ajay Verma | 20 | 189 | 1554 |
Sunil Dutt Purohit | 20 | 94 | 1228 |
Durga Prasad Mohapatra | 18 | 186 | 1293 |
Prashant K. Jamwal | 17 | 62 | 1267 |
Dhanesh Kumar Sambariya | 16 | 49 | 693 |
Girish Parmar | 14 | 82 | 665 |
Vikas Bansal | 13 | 17 | 1015 |
Sandeep Kumar Parashar | 13 | 22 | 339 |
Mithilesh Kumar | 12 | 103 | 734 |