Towards shortest path identification on large networks

The use of Big Data in today’s world has become a necessity due to the massive number of technologies developed recently that keeps on providing us with data such as sensors, surveillance system and even smart phones and smart wearable devices they all tend to produce a lot of information that need to be analyzed and studied in details to provide us with some insight to what these data represent. In this paper we focus on the application of the techniques of data reduction based on data nodes in large networks datasets by computing data similarity computation, maximum similarity clique (MSC) and then finding the shortest path in a quick manner due to the data reduction in the graph. As the number of vertices and edges tend to increase on large networks the aim of this article is to make the reduction of the network that will cause an impact on calculating the shortest path for a faster analysis in a shortest time.

[1]  Steven Dubowsky,et al.  On computing the global time-optimal motions of robotic manipulators in the presence of obstacles , 1991, IEEE Trans. Robotics Autom..

[2]  Jose Luis Esteves dos Santos,et al.  A New Shortest Paths Ranking Algorithm , 1999 .

[3]  Andrew V. Goldberg,et al.  The Shortest Path Problem , 2009 .

[4]  Justin Zhan,et al.  Statistical Modeling and Scalable, Interactive Visualization of Large Scale Big Data Networks , 2014 .

[5]  Masato Noto,et al.  A method for the shortest path search by extended Dijkstra algorithm , 2000, Smc 2000 conference proceedings. 2000 ieee international conference on systems, man and cybernetics. 'cybernetics evolving to systems, humans, organizations, and their complex interactions' (cat. no.0.

[6]  Václav Snásel,et al.  Social Network Reduction Based on Stability , 2010, 2010 International Conference on Computational Aspects of Social Networks.

[7]  Justin Zhijun Zhan,et al.  Towards Network Reduction on Big Data , 2013, 2013 International Conference on Social Computing.

[8]  Hao Lin,et al.  A novel graph reduction algorithm to identify structural conflicts , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[9]  Shu-xi Wang,et al.  The improved Dijkstra's shortest path algorithm , 2011, 2011 Seventh International Conference on Natural Computation.

[10]  Shahnaz Ali,et al.  A study of oropharyngeal parasites infection in doves and domestic pigeons in some villages of Garmian -Iraqi Kurdistan region , 2017 .

[11]  Michael Eagle,et al.  An Algorithm for Reducing the Complexity of Interaction Networks , 2013, EDM.

[12]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[13]  Zvi Shiller,et al.  Dual Dijkstra Search for paths with different topologies , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[14]  Vipin Kumar,et al.  Similarity Measures for Categorical Data: A Comparative Evaluation , 2008, SDM.

[15]  J. Harding,et al.  Sociometry, experimental method and the science of society: An approach to a new political orientation. , 1952 .

[16]  James Tuttle,et al.  A Partnership Framework for Geospatial Data Preservation in North Carolina , 2009, Libr. Trends.

[17]  Gerhard Weikum,et al.  Fast and accurate estimation of shortest paths in large graphs , 2010, CIKM.

[18]  Jeffrey Xu Yu,et al.  Finding maximal cliques in massive networks , 2011, TODS.

[19]  Novica Nosovic,et al.  Dijkstra's shortest path algorithm serial and parallel execution performance analysis , 2012, 2012 Proceedings of the 35th International Convention MIPRO.

[20]  Fang-Ling Lu,et al.  An improvement of the shortest path algorithm based on Dijkstra algorithm , 2010, 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE).

[21]  Miklós Bartha,et al.  A Depth-first Algorithm to Reduce Graphs in Linear Time , 2009, 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[22]  Liu Jiping,et al.  An Algorithm of Shortest Path Based on Dijkstra for Huge Data , 2009, 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery.