A Novel Framework for Aggloramative Performance of Quantifiability Learning

  ijett-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2013 by IJETT Journal
Volume-4 Issue-10                      
Year of Publication : 2013
Authors : N.R.Hareesh , Karuna Arava

MLA 

N.R.Hareesh , Karuna Arava. "A Novel Framework for Aggloramative Performance of Quantifiability Learning". International Journal of Engineering Trends and Technology (IJETT). V4(10):4400-4403 Oct 2013. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group.

Abstract

There is more scalability of individual in present social media. If we want to know similar behaviour of the individuals in the social media that study is known as collective behaviour study. This is more complexity that the information of a individual over more scalability of the social media. So we introduced a process to retrieve the behaviour of an individual and it includes incremental clustering and the naives Bayesian classification on the social media for retrieving the information. It gives good results on social media data and makes computational operations easier and easily comparative to the information of an individual.

References

[1] L. Tang and H. Liu, “Toward predicting collective behavior via social dimension extraction,” IEEE Intelligent Systems, vol. 25, pp. 19–25, 2010.
[2] ——, “Relational learning via latent social dimensions,” in KDD ’09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM, 2009, pp. 817–826.
[3] M. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Physical Review E (Statistical, Nonlinear, and Soft Matter Physics), vol. 74, no. 3, 2006. [Online]. Available: http://dx.doi.org/10.1103/PhysRevE.74.036104
[4] L. Tang and H. Liu, “Scalable learning of collective behaviour based on sparse social dimensions,” in CIKM ’09: Proceeding of the 18th ACM conference on Information and knowledge management. New York, NY, USA: ACM, 2009, pp. 1107–1116.
[5] P. Singla and M. Richardson, “Yes, there is a correlation: - from social networks to personal behavior on the web,” in WWW ’08: Proceeding of the 17th international conference on World Wide Web. New York, NY, USA: ACM, 2008, pp. 655–664.
[6] M. McPherson, L. Smith-Lovin, and J. M. Cook, “Birds of a feather: Homophily in social networks,” Annual Review of Sociology, vol. 27, pp. 415–444, 2001.
[7] A. T. Fiore and J. S. Donath, “Homophily in online dating: when do you like someone like yourself?” in CHI ’05: CHI ’05 extended abstracts on Human factors in computing systems. New York, NY, USA: ACM, 2005, pp. 1371–1374.
[8] H. W. Lauw, J. C. Shafer, R. Agrawal, and A. Ntoulas, “Homophily in the digital world: A LiveJournal case study,” IEEE Internet Computing, vol. 14, pp. 15–23, 2010.
[9] S. A. Macskassy and F. Provost, “Classification in networked data: A toolkit and a univariate case study,” J. Mach. Learn. Res., vol. 8, pp. 935–983, 2007.
[10] X. Zhu, “Semi-supervised learning literature survey,” 2006. [Online]. Available: http://pages.cs.wisc.edu/∼jerryzhu/pub/ssl survey 12 9 2006.pdf
[11] L. Getoor and B. Taskar, Eds., Introduction to Statistical Relational Learning. The MIT Press, 2007.
[12] X. Zhu, Z. Ghahramani, and J. Lafferty, “Semi-supervised learning using gaussian fields and harmonic functions,” in ICML, 2003.
[13] S. White and P. Smyth, “A spectral clustering approach to finding communities in graphs,” in SDM, 2005.
[14] M. Newman, “Power laws, Pareto distributions and Zipf’s law,” Contemporary physics, vol. 46, no. 5, pp. 323–352, 2005.
[15] F. Harary and R. Norman, “Some properties of line digraphs,” Rendiconti del Circolo Matematico di Palermo, vol. 9, no. 2, pp. 161–168, 1960.
[16] T. Evans and R. Lambiotte, “Line graphs, link partitions, and overlapping communities,” Physical Review E, vol. 80, no. 1, p. 16105, 2009.
[17] Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, “Link communities reveal multi-scale complexity in networks,” 2009.[Online]. Available: http://www.citebase.org/abstract?id=oai: arXiv.org:0903.3178
[18] R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin, “LIBLINEAR: A library for large linear classification,” Journal of Machine Learning Research, vol. 9, pp. 1871–1874, 2008.