Shikha Agrawal

Dr. Shikha Agrawal


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
SAShikha Agrawal
Shikha Agrawal
JAJitendra Agrawal
Jitendra Agrawal
In the present world huge amounts of data are stored and transferred from one location to another. The data when transferred or stored is primed exposed to attack. Although various techniques or applications are available to protect data, loopholes exist. Thus to analyze data and to determine various kind of attack data mining techniques have emerged to make it less vulnerable. Anomaly detection uses these data mining techniques to detect the surprising behaviour hidden within data increasing the chances of being intruded or attacked. Various hybrid approaches have also been made in order to detect known and unknown attacks more accurately. This paper reviews various data mining techniques for anomaly detection to provide better understanding among the existing techniques that may help interested researchers to work future in this direction

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
UKUzma Khan
Uzma Khan
SAShikha Agrawal
Shikha Agrawal
SSSanjay Silakari
Sanjay Silakari
VANETs enable wireless communication among vehicles and vehicle to infrastructure. Its main objective is to render safety, comfort and convenience on the road. VANET is different from ad-hoc networks due to its unique characteristics. However, because of lack of infrastructure and centralized administration, it becomes vulnerable to misbehaviors. This greatly threatens different aspects of VANET's security. VANET being such a useful network must provide adequate security measures for secure communication. The proposed algorithm DMN-Detection of Malicious Nodes in VANETs improves DMV Algorithm in terms of effective selection of verifiers for detection of malicious nodes and hence improves the network performance

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
SAShikha Agrawal
Shikha Agrawal
JAJitendra Agrawal
Jitendra Agrawal
Cancer is a dreadful disease. Millions of people died every year because of this disease. It is very essential for medical practitioners to opt a proper treatment for cancer patients. Therefore cancer cells should be identified correctly. Neural networks are currently a burning research area in medical science, especially in the areas of cardiology, radiology, oncology, urology and etc. In this paper, we are surveying various neural network technologies for classification of cancer. The main aim of this survey in medical diagnostics is to guide researchers to develop most cost effective and user friendly systems, processes and approaches for clinicians

18 August 2016
Verified
Conference Paper
Closed access
YDYogesh Dhote
Yogesh Dhote
SAShikha Agrawal
Shikha Agrawal
ADAnjana Jayant Deen
Anjana Jayant Deen
Feature selection technique has a great importance in Internet traffic classification. Machine learning (ML) algorithms have been generally applied in novel traffic classification. In this paper we provide an overview of three major approaches to classify different categories of Internet traffic: Port based approach, Payload based approach, Statistical-based approach. This paper also explain feature selection algorithms, which are classified into 3 methods: Filter method, Wrapper method, Embedded Method along with their benefits and limitations and also provides an overview of some of the feature selection technique present in literature. The aim of the survey gives a brief idea about feature selection techniques which can be applied to many machine learning algorithms to avoid problems like class imbalance, concept drift, low efficiency, and low classification rate etc.


1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
JAJitendra Agrawal
Jitendra Agrawal
SAShikha Agrawal
Shikha Agrawal
The graph coloring problem is one of the combinatorial optimization problems. Although many heuristics and metaheuristics algorithm were developed to solve graph coloring problem but they have some limitations in one way or another. In case of tabu search, the algorithm becomes slow, if the tabu list is big. This is because lots of memory to keep the list and also a lot of time to travel through the list, is needed in each step of the algorithm. Simulated annealing has a big handicap when applied to graph coloring problem because there are lots of neighboring states that have the same energy value. The problem with ant colony optimization is that the number of ants that must be checked is n times bigger than other algorithms. Therefore, there will be a need of a large amount of memory and the computational time of this algorithm can be very large. A swarm intelligence based technique called as particle swarm optimization is therefore employed to solve the graph coloring problem. Particle swarm optimization is simple and powerful technique but its main drawback is its ability of being trapped in the local optimum. Therefore, to overcome this, an efficient Acceleration based Particle Swarm Optimization (APSO) is introduced in this paper. Empirical study of the proposed APSO algorithm is performed on the second DIMACS challenge benchmarks. The APSO results are compared with the standard PSO algorithm and experimental results validates the superiority of the proposed APSO