Cloud Data Analysis Service With Efficient In Large Scale Social Networks

N.Naveen Kumar


Social network analysis in various methods on basis an amount computation of feature extraction process has to a great extent to separate into constituent parts of social network. The Feature Extraction Process (FEP) suffers from serious computational and communication skews. The data dependency graph of FEPs may be known only at execution time and changes dynamically. It not only makes it hard to evaluate each task’s load, but also leaves some computers underutilized after the convergence of most features in early iterations. In Social network analysis put to practical use to pull structure relating to human an interacting population of various kinds of individuals Social network analysis directs highly effective in variety of scientific domains. The intension of involving straggler-having act to draw closer, SAE, to give assistance to the identification function of serving in the cloud. a important challenge to effective information analysis is the computation and conversation skew (i.E., load imbalance) among desktops prompted through humanity’s team behaviour (e.G., bandwagon influence). Natural load balancing procedures either require gigantic effort to re- balance masses on the nodes, or cannot good cope with stragglers. On this paper, we recommend a general straggler-aware execution method, SAE, to aid the evaluation carrier within the cloud. It presents a novel computational decomposition procedure that causes straggling function extraction tactics into more excellent-grained sub strategies, that are then allotted over clusters of computers for parallel execution.


Z. Song and N. Roussopoulos, “K-nearest neighbor search for moving query point,” Lecture Notes in Computer Science, vol. 2121, pp. 79–96, July 2001.

X. Yu, K. Q. Pu, and N. Koudas, “Monitoring k-nearest neighbor queries over moving objects,” in Proceedings of the 21st International Conference on Data Engineering. IEEE, 2005, pp. 631–642.

T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, “An efficient k-means clustering algorithm: Analysis and implementation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881–892, July 2002.

L. Di Stefano and A. Bulgarelli, “A simple and efficient connected components labeling algorithm,” in Proceedings of the International Conference on Image Analysis and Processing. IEEE, 1999, pp. 322–327.

E. Deelman, G. Singh, M.-H. Su, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, G. B. Berriman, J. Good et al., “Pegasus: A framework for mapping complex scientific workflows onto distributed systems,” Scientific Programming, vol. 13, no. 3, pp. 219–237, January 2006.

L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, March 1953.

D. Liben-Nowell and J. Kleinberg, “The link prediction problem for social networks,” in Proceedings of the 12th international conference on Information and knowledge management. ACM, 2003, pp. 556–559.

S. Baluja, R. Seth, D. Sivakumar, Y. Jing, J. Yagnik, S. Kumar, D. Ravichandran, and M. Aly, “Video suggestion and discovery for youtube: taking random walks through the view graph,” in Proceedings of the 17th international conference on World Wide Web. ACM, 2008, pp. 895–904.

S. Brin and L. Page, “The anatomy of a large-scale hypertextual web search engine,” Computer networks and ISDN systems, vol. 30, no. 1, pp. 107–117, April 1998

Full Text: PDF [Full Text]


  • There are currently no refbacks.

Copyright © 2013, All rights reserved.|

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at