GUIDELINES FOR PREPARING THE PROJECT REPORT & SAMPLE DOC

 The project report should be submitted in A4 size.

 Number of copies to be submitted: Four [Library copy, Department copy,
Guide copy, Personal copy (for each individual student)].
 The certificate should consists of names and registration numbers of all team
members for the above four copies.
 The dissertation shall be properly bound, using Rexene of black color.
 Bond paper (A4 size) should be used for the preparation of the project report.
Typing should be done on one side of the paper with font size 12 of Times New
Roman. Line spacing must be 1.5.
 Heading should be Times New Roman, Font size 14 and Bold.
 Subheadings should be Times New Roman, Font size 12 and Bold.
 Should not underline the heading/subheadings and should not put colons
(: ) in headings or subheadings.
 The layout should provide a margin of 4 cm on the left, 3 cm on the top and
bottom and 2 cm on the right. Left margin space 4 cm, Top and Bottom margin
space 3 cm and Right margin space 2 cm.
 The page numbers should be indicated at the bottom-middle of each page.
 Figure headings should be at the bottom of the figure and represented by Fig. 1
(Ex- Fig. 1 Flow chart of proposed CGWO model).
 Table headings should be at the top of the table and represented by Table 1.
(Ex- Table 4. Proposed CGWO algorithm )
 Figure name and Table name must be Times New Roman with Font size 10.
 Abstract should not exceed more than one page.
 Number of Keywords should not exceed 10.
 Keywords must be present after abstract only.
 Certificate page must be as per given format.
 Follow Harvard format for Reference section.
 Arrangements of Chapters
1. Introduction
[Overview of this Research, Importance of choosing the particular domain (ex-
why ML), Importance of Optimization (context specific), Supervised vs Un-
supervised Learning, No Free Lunch theorem]
1.1 Motivation
1.2 Outline of the Thesis
2. Literature Survey/Review of Literature
3. Basic preliminaries
3.1 Framework of GWO
3.2 Overview of Chaos
3.3 ………
4. Methodology
4.1 Multilayer Perceptron
4.2 Benchmark Data Sets and its preparation
4.3 Experimentation settings
4.4 …………
5. Improved Chaos based GWO for Feature Selection and Data
Classification
5.1 Problem statement
5.2 Proposed method
6. Result Discussion/ Outcome Analysis
6.1 Complexity Analysis
6.2 Convergence Analysis
6.3 Statistical Significance
6.4……….
7. Social Implications
8. Conclusion and Future Scope
List of Publications
References
 A Project Report
on

A FRAMEWORK FOR
CLUSTERING CATEGORICAL DATA

Submitted in partial fulfillment of the requirements for the award of the degree of

BACHELOR OF TECHNOLOGY
IN
INFORMATION TECHNOLOGY

Submitted by

P. Anitha (16A51A1222)
P. Anitha (16A51A1222) P. Anitha (16A51A1222)
P. Anitha (16A51A1222) P. Anitha (16A51A1222)

Under the esteemed Guidance of

Dr. B. V. Ramana, M.Tech, Ph.D.
Professor & HOD

Department of Information Technology

ADITYA INSTITUTE OF TECHNOLOGYAND MANAGEMENT, TEKKALI
(An Autonomous Institution)
(Affiliated to JNTUK, Kakinada, Approved by AICTE, Accredited by NBA & NAAC, New Delhi)

2016-2020
 A Project Report
on

A FRAMEWORK FOR
CLUSTERING CATEGORICAL DATA

Submitted in partial fulfillment of the requirements for the award of the degree of

BACHELOR OF TECHNOLOGY
IN
INFORMATION TECHNOLOGY

Submitted by

P. Anitha (16A51A1222)
P. Anitha (16A51A1222) P. Anitha (16A51A1222)
P. Anitha (16A51A1222) P. Anitha (16A51A1222)

Under the esteemed Guidance of

Dr. B. V. Ramana, M.Tech, Ph.D.
Professor & HOD

Department of Information Technology

ADITYA INSTITUTE OF TECHNOLOGYAND MANAGEMENT, TEKKALI
(An Autonomous Institution)
(Affiliated to JNTUK, Kakinada, Approved by AICTE, Accredited by NBA & NAAC, New Delhi)

2016-2020
 Approved by AICTE, New Delhi
Affiliated to JNTU Kakinada
Accredited by NBA (UG: CSE,ECE,EEE,ME ,CE & IT)
Accredited by NAAC(UGC) with A+ Grade
Recognised by UGC Under Section 2(f) & 12(B)
TEQIP Participated College
Recognised by Scientific & Industrial Research Organisation(SIRO)

CERTIFICATE

This is to certify that the work embodied in this project entitled “YOUR

PROJECT TITLE” being submitted by J. Manikanth (15A5A1222), J. Manikanth

(15A5A1222), J. Manikanth (15A5A1222), J. Manikanth (15A5A1222) and J.

Manikanth (15A5A1222) in partial fulfillment for the award of the degree of Bachelor

of Technology in Information Technology carried out by them under my supervision.

The results embodied in this project report have not been submitted to any other

University or Institute for the award of any Degree or Diploma.

GUIDE HEAD OF THE DEPARTMENT

Sri. Nibedan Panda Dr. B.V.Ramanna
Asst. Professor Professor & HOD,
Department of IT
 DECLARATION

We do hereby declare that the work embodied in this project entitled “YOUR

PROJECT TITLE” is the outcome of research work carried out by us under the direct

supervision of Dr. B V Ramanna, Professor & HOD, Department of Information

Technology, Aditya Institute of Technology and Management, Tekkali, affiliated to

JNTUK, Kakinada, for the award of the degree of Bachelor of Technology in

Information Technology during the period 2019-20. The work is original and has not

been submitted elsewhere for award of any other degree or diploma.

Project Associates

P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
 ACKNOWLEDGEMENTS

This project was impossible without the people who supported us and believed us.

We would like to express our sincere heartfelt gratitude to our honorable, esteemed
supervisor Dr. B. V. Ramana, Professor and Head, Department of Information
Technology (IT), Aditya Institute of Technology and Management (AITAM), Tekkali,
affiliated to JNTUK, Kakinada, for his kind and valuable guidance for the completion
of the project work. His consistent support and intellectual guidance inspired us to
innovate new ideas. I am glad to work under his supervision.

We are grateful to Sri. Nibedan Panda, Professor, Department of Information

Technology, Aditya Institute of Technology and Management, Tekkali, affiliated to
JNTUK, Kakinada, for his excellent support during our work. We are also thankful to
Mr. #### and Mr. ####, Asst. Professor, Department of IT, AITAM, Tekkali, for
providing us support and advice in preparing our project work.

We thank all our friends and classmates for their love and support. Last, but not least
we would like to thank our parents for supporting us to complete our bachelor’s degree
in all ways.

Project Associates
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
P. Anitha (16A51A1222)
 Vision of the Department

Create high-quality engineering professionals through research, innovation and

teamwork for Information Technology services with outstanding faculty, facilities and
education.

Mission of the Department

M1: Information Technology program dedicates itself to provide students with a set of
skills, knowledge and attitude that will permit its graduates to succeed and thrive as
successful information technologists.
M2: Enhance overall personality development which includes innovative thinking,
team work, entrepreneur skills, communication skills, employability skills and ethical
conduct.
M3: Ensuring effective teaching–learning process to provide in-depth knowledge of
interdisciplinary areas.
M4: Providing industry interactions through consultancy and sponsored research for
the societal needs.

Program Educational Objectives (PEOs)

PEO1: Acquire the ability of technical competence in analyzing, designing and

developing to create novel products in their field.

PEO2: Attain skills in pursuing higher education, doing research or resuming

entrepreneurial strivings.

PEO3: Possess leadership qualities, nourish ethical responsibilities and cherish with
communication skills.

PEO4: Enrich lifelong learning with technical savvy and promote the progressive
societal needs
 PROGRAM OUTCOMES (POs)

Engineering Graduates will be able to

PO1. ENGINEERING KNOWLEDGE: Apply the knowledge of mathematics, science,
engineering fundamentals, and an engineering specialization to the solution of complex
engineering problems.
PO2. PROBLEM ANALYSIS: Identify, formulate, review research literature, and analyze
complex engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
PO3. DESIGN/DEVELOPMENT OF SOLUTIONS: Design solutions for complex engineering
problems and design system components or processes that meet the specified needs with
appropriate consideration for the public health and safety, and the cultural, societal, and
environmental considerations.
PO4. CONDUCT INVESTIGATIONS OF COMPLEX PROBLEMS: Use research-based
knowledge and research methods including design of experiments, analysis and interpretation
of data, and synthesis of the information to provide valid conclusions.
PO5. MODERN TOOL USAGE: Create, select, and apply appropriate techniques, resources,
and modern engineering and IT tools including prediction and modeling to complex
engineering activities with an understanding of the limitations.
PO6. THE ENGINEER AND SOCIETY: Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and cultural issues and the consequent
responsibilities relevant to the professional engineering practice.
PO7. ENVIRONMENT AND SUSTAINABILITY: Understand the impact of the professional
engineering solutions in societal and environmental contexts, and demonstrate the knowledge
of, and need for sustainable development.
PO8. ETHICS: Apply ethical principles and commit to professional ethics and responsibilities
and norms of the engineering practice.
PO9. INDIVIDUAL AND TEAM WORK: Function effectively as an individual, and as a
member or leader in diverse teams, and in multidisciplinary settings.
PO10. COMMUNICATION: Communicate effectively on complex engineering activities with
the engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give and
receive clear instructions.
PO11. PROJECT MANAGEMENT AND FINANCE: Demonstrate knowledge and
understanding of the engineering and management principles and apply these to one’s own
work, as a member and leader in a team, to manage projects and in multidisciplinary
environments.
PO12. LIFE-LONG LEARNING: Recognize the need for, and have the preparation and ability
to engage in independent and life-long learning in the broadest context of technological change.
 PROGRAM SPECIFIC OUTCOMES (PSOs)

By the completion of Information Technology program the student will be able to

PSO1: Execute the mathematical foundations, algorithmic principles of engineering to
identify, formulate, design and investigate the intricate problems of Information
Technology.
PSO2: Comprehend the principles and applications of the software and hardware
facets of computer systems.
PSO3: Apply knowledge in various domains to identify research gaps and provide
solutions.

Articulation Matrix of Mapping the Project with POs and PSOs

PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

CO
1 2 3 4 5 6 7 8 9 10 11 12 1 2 2

PROJ
2 2 2 3 3 1 1 1 3 3 3 1 1 1 1
.TOT

Note: Enter Correlation levels 1, 2 or 3 as defined below:

1: Slight (Low)
2: Moderate (Medium)
3: Substantial (High)
 ABSTRACT

Spotted Hyena Optimizer (SHO) is a recently developed swarm based algorithm in the
field of metaheuristic research, for solving realistic engineering design constraint and
unconstrained difficulties. To resolve complicated non-linear physical world tasks, at
times SHO reveals deprived performance concerning to explorative strength. So to
enhance the explorative strength along with exploitation in the search region an attempt
has been made by proposing the enhanced version of classical SHO. The suggested
method is designated as STS-SHO. In STS-SHO, a new evolutionary technique named
as Space Transformation Search Technique (STS) has been incorporated with original
SHO. The suggested method has been assessed by IEEE CEC 2017 benchmark
problems. The efficacy of the said method has been proven by using standard measures
like: given performance metrics in CEC 2017, complexity analysis, convergence
analysis and statistical implications. Further as real world application, the said
algorithm has been applied to train Pi-Sigma neural network (PSNN) by means of 13
benchmark datasets considered from UCI depository. From the paper it can be
concluded that the suggested method STS-SHO is an effective and trustworthy
algorithm, which has the ability to resolve real life optimization complications.

Keywords Spotted Hyena Optimizer (SHO), Space Transformation Technique (STS),

Swarm Intelligence, Metaheuristic Algorithm, Optimization, Higher Order Neural
Network (HONN), Classification
 TABLE OF CONTENTS
Certificate I
Declaration II
Acknowledgement III
Vision, Mission and PEOs IV
POs V
PSOs and Mapping of POs & PSOs VI
Abstract VII
1. Introduction 1
1.1 Motivation 10
1.2 Outline of the Thesis 11
2. Literature Review
3. Basic Preliminaries
3.1 Framework of GWO
3.2 Overview of Chaos
3.3 ………..
4 Methodology
4.1 Multilayer Perceptron
4.2 Benchmark Data Sets and its preparation
4.3 Experimentation settings
4.4 ……………
5 Improved Chaos based GWO for Feature Selection and Data Classification
5.1 Problem statement
5.2 Proposed method
6 Result Discussion/ Outcome Analysis
6.1 Complexity Analysis
6.2 Convergence Analysis
6.3 Statistical Significance
6.4 ……….
7 Social Implications
8 Conclusion and Future Scope
List of Publications
References
 Chapter 1

1 INTRODUCTION

Optimization is the process of finding all potential outcomes within a fixed search
space and picking the best optimal solution depending upon certain initial conditions
and input parameters. At present optimization technique predominantly used across all
engineering and science disciplines such as chemical engineering [1], engineering
design [2], information system [3] and operation and supply chain management [4] etc.
The problems associated with such fields are convoluted in nature and hard to optimize.
This is the foundation for development of diverse meta-heuristic algorithms to find out
optimal solutions. To generate optimal solution for a specific problem one of the
popular technique available in the literature is deterministic technique or gradient based
methods. This method belongs to supervised training category. The limitation of such
method includes (i) poor attainment of global optima accurately, (ii) slow convergence
rate, and (iii) dependencies on the input parameters are very high. Therefore to deal
with the difficulties faced by the deterministic methods and the gradual increase in
complexities of real life problems many nature inspired meta-heuristic algorithms will
be evolved. This type of optimization algorithms are also termed as stochastic
optimization. The advantages of stochastic based algorithms are to find global optima
by successfully avoiding local optima trap and can deal with increased complexity of
the problem. The widespread acceptance of this approach is due to free from problem
dependencies and involved randomness in choosing initial parameters as well as finding
method of solutions.

The meta-heuristic algorithms broadly classified into two categories such as single
solution based algorithm and population based algorithm. In single solution based
approach one candidate solution is chosen from set of all possible solutions. The chosen
candidate solution undergoes repeated iteration for evaluation till desired optimized
result achieved. Merit of this type of approach is its faster rate of execution due to less
involved complexities with the process. However, the demerit associated with this type
of algorithm is that it may suffer from local optima trap, which results in failure to
attain global optima. Some popular methods which falls to this category available in the
literature are Hill climbing [5], Tabu search [6], Iterated local search [7], Simulated
annealing [8] and Guided local search [9] etc. On the contrary the population based
approach considers all possible candidate solutions instead of a single candidate
solution. In this perspective, the objective function tries to assess the correctness of
each and every candidate solution and guide towards attaining optimal result. Broadly
this population based method again subdivided into two categories such as evolutionary
algorithms and swarm based algorithms. Evolutionary algorithms follow the
mechanism which is inspired by biological evolution. The biological evolution process
involves four operators such as random-selection, reproduction, recombination and
mutation. By using these operators the evolution process will be carried out. The
objective function decides the effectiveness of each of the candidate solution. Some of
the important examples of evolutionary approach available in literature are Genetic
algorithm [10], Genetic programming [11], Differential evolution (DE) [12], Scatter
search [13], Memetic algorithm [14], Evolutionary programming [15] and Evolutionary
strategy [16]. Second category of population based algorithm is the swarm based
algorithm which is evolved by the social behavior and implementing the swarming
behavior of various creatures from nature such as birds, ants, crows, grey wolves, bees,
hyenas, whales and salps. This type of approach is popular among researchers due to its
wide range of applications, comparatively easy to understand and implement. The wide
acceptance of this type of algorithm is its ability to solve many complex real world day
to day life optimization problems and higher efficacy. Popular algorithms widely used
in the literature are Particle swarm optimization (PSO) [17], Ant colony optimization
[18], Ant lion optimization [19], Whale optimization [20], Grey wolf optimization [21],
Spotted hyena optimization [22], Artificial bee colony [23] and Bat algorithm [24] etc.
Day by day many algorithms are evolved with a motivation to perform in specific real
life problems as a specific algorithm cannot give good result for all algorithms. In this
direction, there is an important development regarding these meta-heuristic algorithms
is the No Free Lunch (NFL) theorem [25]. The NFL is one of the most interesting
progresses for stochastic algorithms, which is the main cause of evolvement of new
such kind of algorithms each year. According to NFL theorem all the optimization
algorithms behave equally over the given function list.
References
1. Panda, N. and Majhi, S.K., 2020. Improved spotted hyena optimizer with space
transformational search for training pi-sigma higher order neural network.
Computational Intelligence, 36(1), pp.320-350.
2. Panda, N. and Majhi, S.K., 2019. Improved Salp Swarm Algorithm with Space
Transformation Search for Training Neural Network. Arabian Journal for
Science and Engineering, pp.1-19.