International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017

RESEARCH ARTICLE OPEN ACCESS

Node Reduction using Similarity Graph Computation Algorithm

in Large Networks
M. Kalarani
PG Scholar
Department of Computer Science and Engineering
PSNA College of Engineering and Technology, Dindigul
Tamil Nadu-India

ABSTRACT
Networks are principally cantered on communication and knowledge transmission. Due to the variability of vertices and edges
have an inclination to growth on large networks. In current days due to the speed of the information mining and large data
analysis, a set of nodes within the community is process identical reasonably knowledge. Keeping in mind the end goal to
interface those noses in a very route or connect nodes that area unit similar in terms of behaviour, data process, and other
activities. Since, it is necessary to interconnect those styles of similar nodes through the routing protocol. The principle target of
this paper is to make the reduction of the network and finding the shortest path supported most similarity cliques on the
information convenience of the data-nodes in massive scale networks. In this project clearly focused on the applying of
the ways of info reduction supported info nodes in massive networks knowledge sets by exploitation knowledge similarity
computation and most similarity inner circle (MSC). Maximum Similarity inner circle algorithmic program is used to search
out out the similar nodes for shortest path routing then finding the optimum shortest path by exploitation the genetic algorithmic
program in a very speedy approach because of the information reduction within the graph and scale back the memory
load within the massive network.
Keywords :- Network Analysis, Similarity Graph Reduction, shortest path analysis, Maximum similarity clique (MSC), Data similarity
computation.

exploration is twofold: First, we need to have the capacity to

I. INTRODUCTION
Systems administration is the demonstration of associating
distinctive preparing devices together with a particular
ultimate objective to share resources. These benefits can be
printers, CDs, records, or even electronic correspondences,
for example, messages and texts. Enormous information'
resembles 'Little information', yet greater. It alludes to high
volume, rapid, or possibly high variety information assets
that require new sorts of dealing with to engage enhanced
essential authority, learning revelation and process
improvement. It is the term generally alluded as huge
datasets because of their volumes. Aside from the sheer
substantial size, these datasets additionally exhibit assorted
qualities, containing data assembled from various social areas,
for example, information gathered from atmosphere sensors,
Transaction records, online networking website posts,
messages on open email servers, and soon..
An answer for the issue is to find a specific sort of
connections among different datasets. Arrange/Graph
theories are for the most part associated for recognizing
draw an undirected chart with every hub signifying one
dataset and weighted edges speaking to their connections
measured in view of their likenesses; Second, since size of
the undirected diagram can be substantial, a chart decrease
Methodology is required keeping in mind the end goal to
rearrange its structure, by blending certain measure of hubs
which are profoundly like each other into one single hub. In
this way, our commitments of this venture are as per the
following:
We introduced the concept of similarity graph along
with an algorithm of similarity graph generation;
We implemented two versions of the algorithm for
finding maximal similarity cliques;
A similarity graph reduction algorithm was
proposed for the purpose of reducing total
number of vertices.
II. RELATED WORKS
A. The improved Dijkstras shortest path algorithm

The most limited way issue exists in assortment of ranges.

Relationship between substances. For instance, the Social
benefits Network Analysis speculation utilizes chart
structures to demonstrate social connections among people.
Thus, we utilized chart structures to demonstrate datasets and
their connections. In particular, our objective of this
A notable most brief way calculation is Dijkstra's,
additionally called "mark calculation" [10]. Dissect comes
to fruition have shown that the " name figuring has the
going with issues: Its leaving framework is reasonable to

ISSN: 2347-8578 www.ijcstjournal.org Page 480

 International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017
undirected graph however deficient to composed chart or
even gets into an immeasurable circle; it has " t tended to
the issue of neighbouring vertices in most restricted way; it
has " t pondered how conceivable it is that various vertices
may secure the " p-lab e in the meantime By tending to
these issues, it has improved the estimation in a general
sense. The test happens demonstrate that the three issues
have been satisfactorily settled.
B. Dual Dijkstra search for paths with different topologies
The Dijkstra look processes the most brief ways from the
begin hub to every single other hub in the diagram. For
every centre point, it registers and stores, slightest cost to
the start center point and the past centre on the perfect way.
By taking after back the past centre, it is possible to deliver
the perfect way. This estimation is useful for making quite
recently the perfect route between any two hubs, and can't
produce other hopeful's ways between the two hubs [3]. The
Dual Dijkstra Search calculation comprises of two stages. In
the underlying stride, for each centre point in the diagram, it
enlist the most constrained path between start a target centre
points that experiences that centre. In the second step, we
select the briefest route in each hemitropic class. These
means are currently portrayed in a few points of interest.
Actualized the DDS calculation in a way organizer to scan
for unmistakable ways in a given arrangement space. The
organizer comprises of the accompanying three stages:
Construct a lattice graph in the configuration space.
Compute step 1 of Dual Dijkstra Search
Compute step 2 of Dual Dijkstra Search
C. A Recursive Shortest Path Routing Algorithm with
application for Wireless Sensor Network Localization
In exploratory outcomes demonstrate that the proposed
technique can moreover be used to viably gage certifiable
partitions between non-neighbouring sensors in multi-
bounce frameworks. It evaluates and ponders the execution
of the proposed reasoning with novel techniques. It has a
recursive computation to gage expels between any two
sensors [4]. The figuring finds all possible mix courses with
the base number of bobs between a sender and a goal centre
point. To find each possible course between two sensors, the
figuring uses a data structure in each sensor that contains
each neighbouring sensor that is at one-skip of detachment.
In the looking for system, each tyke centre point is
broadened proceeding scanning for a goal centre point. n the
occasion that an expanded centre point has no children, the
looking strategy returns back to the parent canter to continue
examining new sensors. Starting their ahead, the estimation
evaluates the path partition of each found course with a
weighted division cross section. Finally, a detachment gage
is enlisted as the mean of all way evacuates.
D. An improvement of the Shortest Path Algorithm
ISSN: 2347-8578 www.ijcstjournal.org
The Dijkstra calculation and its past overhauls, another
change is proposed by considering the occurrence of the
centre points, enhancing the component cross section of
precursor centre point, and including a most short way tree
[5].The count has its good conditions on both reducing the
amount of reiterated operations and examining the most
concise way and the route length from start demonstrate
the different centres by the briefest way tree or by the part
arrange.
E. Shortest Path Search by Extended Dijkstra
Algorithm
The Dijkstra technique is an outstanding calculation for
finding the ideal way in most limited way look issues.
With that strategy, be that as it may, the time requires to
discover tile ideal way turns out to be surprisingly long
when the inquiry extension is wide, so the Dijkstra strategy
is not reasonable for constant issues it propose a system for
getting, in a concise traverse, a way that is as close as
possible to the path got by the Dijkstra method (the perfect
way) [9]. The new method expands the standard Dijkstra
methodology to find a solution for an issue given inside a
foreordained time, for instance, path look in an auto course
structure. The sufficiency of that amplified strategy is
portrayed through at the same time.
F. Finding Maximal Cliques in Massive Networks
The general framework engages maximal internal hover
include to be readied recursively little sub charts of the
information outline, appropriately allowing in-memory
estimation of maximal groups without the costly subjective
plate get to. It show that the course of action of cadres got
by the recursive adjacent estimation is both right (i.e.,
extensively maximal) and complete [7]. The sub diagram to
be readied each time is feasted in light of a course of action
of base vertices that can be clearly refined particular
purposes. It discusses the decision of the base vertices to
totally utilize the available memory in order to point of
confinement I/O cost in static outlines, and for update
upkeep in component graphs. It in like manner applies our
structure to arrange an external memory computation for
most extraordinary internal hover count in a broad diagram.
III. PROPOSED WORK
The proposed work to build up a comparability coterie
is said to be a maximal likeness inner circle on the off
chance that it abuses the essential and adequate states of
being a similitude faction by including one more nearby
vertex and to build up a hereditary calculation for
determining ideal way for vast system. It is prepared to
give perfect and a brisk reaction in huge systems. It
gives better execution inside the inquiry space. Here to
build a most brief way in perspective of closeness
coterie.
Page 481
 International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017
The entire process of the proposed approach is defined in
3 states such as:
Similarity graph reduction
Similarity clique
Maximal similarity clique
Genetic algorithm
Fig 1: System Architecture
A. Proposed Algorithm Description
Dijkstra's calculation is a calculation for finding the most
limited ways between hubs in a chart, which may speak to, for
instance, street systems. The calculation exists in numerous
variations; Dijkstra's unique variation found the briefest way
between two hubs, however a more normal variation settles a
solitary hub as the "source" hub and finds most brief ways
from the source to every other hub in the diagram, creating a
most limited way tree. For a given source hub in the chart, the
calculation finds the most brief way between that hub and
each other.
It can likewise be utilized for finding the briefest ways from
a solitary hub to a solitary goal hub by ceasing the calculation
once the most limited way to the goal hub has been resolved.
Dijkstra's calculation is legitimate for single-source hub and
it gives best outcome for every last way associated with the
source hub. In spite of the fact that it is the most primitive of
briefest way calculation, it proposed the chief thought and
extent of directing conventions.
These conventions for the most part take after an
arrangement of all around dened tenets and directions.
Dijkstra's calculation is for the most part known as the "best
rst seek" calculation and as far as rapid; it is considerably
more valuable than the calculation proposed a while later.
ISSN: 2347-8578 www.ijcstjournal.org
IV. PROPOSED WORK MODEL
Compute the points and calculate the similarity points in a
graph
Compute the new cliques
Compute the maximum similarity cliques
Establish a shortest path
Compare the original graph with reduced graph
V. MODULE DESCRIPTION
A. Compute the points and calculate the similarity
points in a graph
Consider each one of the nodes is as points and that
they have their own knowledge practicality. It is considered
that there area unit N variety of nodes area
unit connected within the network. All the nodes
are performing on a set of information. As indicated by the
data sorts the practicality of the nodes could amendment. For
example a number of the nodes may use medical knowledge,
some of the nodes use social data, therefore then so and then
me of the nodes use applied mathematics knowledge and so on.
As indicated by the data the practicality allotted within
the nodes area unit simply depends on upon the dataset.
A. Compute the new cliques
The new club calculation depicts the path toward
making a summary of new factions in which the new
internal circles don't contain any reiterating vertex. The
estimation first ponders each inward hover in the data
once-over to recognize if there are any reiterating vertices.
In case there do exist repeating vertices, the figuring gives
back the data cadre list; else, it first takes a gander at
similarities for each match of groups recorded in Cliques
and unions reiterating centres into the club having most
outrageous likeness' and a while later it empties internal
circles with only a solitary centre point left and returns a
summary of new cadres. The estimation of closeness
qualities is required in light of the m new hubs.
In the event that there do exist rehashing vertices, the
calculation gives back the information club list; else, it
first looks at similitudes for each match of inner circles
recorded in Cliques and unions rehashing hubs into the
faction having most extreme likenesses and after that it
expels coteries with just a single hub left and returns a
rundown of new coteries.
Page 482
 International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017

Fig 2: Level 1

A. Compute the maximum similarity cliques

The comparability among hubs is acquired by figuring

the separation among hubs. The likeness regard is
commonly institutionalized in the space of [0, 1], with an
estimation of 1 demonstrating undefined and an estimation
of 0 deriving absolutely one of a kind. As a proximity
system, the data structure that stores an undirected graph, a
similarity continuity cross section is the data structure that
stores a comparability outline and the length of a closeness
continuity system is adjusted, the noteworthy resemblance
diagram then can be plotted.
Fig 3: Level 2
The figuring requires two data centres as its data and
yields likeness regard. Specifically, for each property of X
and Y, the estimation first stores a more diminutive credit
cardinality to K, then it forms a quality closeness arrange.
All parts in the framework are then removed into esteem
list. The esteem rundown is sorted with the end goal that
the mean of the top K qualities can be figured.

A. Establish a shortest path

Most limited way on broad outlines won't not be a

straightforward task as there is an extensive measure of
centres and decisions in that chart thusly it requires a lot of
speculation and what's more computational attempts to find
the most concise way. By using Dijkstra " s count to figure
the most restricted route between two center points in a Fig 4: Level 3
diagram has the asymptotic runtime multifaceted nature of
O (m + nlog (n)), where n is the amount of centers and m is
the amount of edges. It will embed the system diagram that will be utilized as
a part of hereditary calculation it will utilize the diminished
chart from SGR the strategy we utilized before along these
lines decreasing the measure of the chart and will help in
giving a superior update in execution astute in Dijkstra's
technique.

ISSN: 2347-8578 www.ijcstjournal.org Page 483

 International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017
Fig 5: Level 4
B. Compare the original graph with reduced graph
The Objective of this experimentation is to enter graph
data and adequately realize diminish on the outline then
figuring the path in light of the decreased diagram that in
perspective of the likeness inner circle prepare. The
lessened diagram demonstrates the productivity can be
expanded. At that point the route toward figuring
similitudes in diagram in view of the definitions and
calculations to yield the decrease chart the closeness is
additionally in light of an edge set to frame the coteries
then in view of this diminishment chart on an extensive
system a way could be resolved from this lessened
chart.
Fig 6: Input graph
ISSN: 2347-8578 www.ijcstjournal.org
Fig 7: Reduced output
VI. CONCLUSION AND FUTURE WORK
Big Data are datasets that have vast volumes and also are
assorted. Since data differences can expand challenges for
data analysis, an answer for this issue is demanded. In this
project, initially proposed a solution for the issue that datasets
and their relationship are demonstrated by a similarity graph,
in which before each segregated dataset now has associations
with its most similar ones. Moreover, it created a similarity
graph reduction algorithm that reduces the aggregate
number of vertices within a similarity graph. Particularly
the algorithm consolidates each vertex including in a maximal
similarity clique into one node.
In future, develop a genetic algorithm to find a shortest path.
It is very useful in deriving optimum path for large network. It
is able to provide ideal and a quick response in large networks.
It gives better performance within the search space and its
tries to eliminate the 0 or infinite values. It reduces the load on
the memory.
REFERENCES
[1] Akkoyunlu. The enumeration of maximal cliques of
large graphs. SIAM J. Comput, 2(1):16, 1973.
[2] Dhruba Ghosh, Sunil Kumar and Paurush Bhulania, A
Novel Solution of Dijkstras Algorithm for Shortest Path
Routing with Polygonal Obstacles in Wireless Networks
Using Fuzzy Mathematics published on Springer India
2016.
[3] Y. Fujita , Nakamura Y, Shiller Z. Dual Dijkstra
search for paths with different topologies in 2003,
Proceedings IEEE international conference on robotics
and automation, ICRA03, vol. 3. New York: IEEE. p.
335964.
[4] Juan Cota-Ruiz, Pablo Rivas-Perea, Member, IEEE,
Ernesto Sifuentes and Rafael Gonzalez-Landaeta A
Recursive Shortest Path Routing Algorithm with
application for Wireless Sensor Network Localization
Published in: IEEE Sensors Journal ( Volume: 16,
Issue:11, June1, 2016 ).
[5] Ji-Xian Xiao, Fang-Ling Lu, an Improvement of the
Shortest Path Algorithm Based on Dijkstra Algorithm.
Page 484
 International Journal of Computer Science Trends and Technology (IJCST) Volume 5 Issue 2, Mar Apr 2017

[6] Jinfeng Du, Naomi Sweeting, David C. Adams and

Muriel Medard Network Reduction for Coded
Multiple-Hop Networks Published in:
Communications (ICC), 2015 IEEE International
Conference.

[7] JAMES CHENG, LINHONG ZHU, Finding Maximal

Cliques in Massive Networks published on ACM
Transactions on Database Systems, Vol. 36, No. 4,
Article 21, Publication date: December 2011.

[8] K. Rohila, P.Gouthami, Vol. 2, Issue 10, October

2014 Priya M Dijkstras Shortest Path Algorithm
for Road Network published on IJIRCCE.

[9] Masato Noto, A Method for tile Shortest Path Search by

Extended Dijkstra Algorithm published on 0-7803-
6583-6/00/$10.00 0 2000 IEEE.

[10] Shu-xi W, Xing-qiu Z, The improved Dijkstras

shortest path algorithm. In: Natural computation
(ICNC), 2011 seventh international conference on,
vol.4. New York: IEEE. p. 231316.

[11] Widhi Yahya1, Achmad Basuki2, Jehn-Ruey Jiang3

Vol. 5, No. 2, April 2015, pp. 289~296 The
Extended Dijkstras-based Load Balancing for Open
Flow Network published on International Journal of
Electrical and Computer Engineering (IJECE).

[12] Xiaojing Z. Digital map format of the car's navigation

product .He nan, Gnss Word of China, 2004, pp.6-9.

[13] Yujia Zhu, Daniel Tylavsky, An optimization based

network reduction method with generator placement
Published in: North American Power Symposium
(NAPS), 2015.

[14] Zhe Zhao , Bin Cui , Wee Hyong Tok , Jiakui

Zhao Efficient Similarity Matching of Time Series
Cliques with Natural Relations Published in:
Data Engineering (ICDE), 2010 IEEE 26th
International Conference.

[15] Z. Zhao, H. Li, and Z. Chen. A novel graph reduction

algorithm to identify structural conicts. In Proceedings
of the 35th Hawaii International Conference on
Systems Sciences, Hawaii, U.S.A., pages 195209,
January 2002.

ISSN: 2347-8578 www.ijcstjournal.org Page 485