Sparse Coding in Modularity Community Detection with Big Data

Article Preview

Abstract:

Community detection in Big data society network is problem we must solve.we use the sparse coding effectively identify implicit in the internal structure of input data and model. In the same tim we use the modularity community detection cover the random structure problem of the real society networks. It was proved feasible by the results of experiment with real society networks.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1653-1656

Citation:

Online since:

November 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] C. Bizer, P. Boncz, M. L. Brodie, and O. Erling: The mean-ingful use of big data: four perspectives–four challenges ACM SIGMOD Record, vol. 40, no. 4, (2012), p.56–60.

DOI: 10.1145/2094114.2094129

Google Scholar

[2] A. Labrinidis and H. Jagadish: Challenges and opportunities with big data Proceedings of the VLDB Endowment, vol. 5, no. 12, (2012) ,. p.2032–(2033).

DOI: 10.14778/2367502.2367572

Google Scholar

[3] S. Lohr: The age of big data New York Times , vol. 11, (2012).

Google Scholar

[4] J. Mervis,: Agencies Rally to Tackle Big Data Science, vol. 336, no. 6077, (2012), p.22.

DOI: 10.1126/science.336.6077.22

Google Scholar

[5] M. Julien, and B. Yu: Supervised feature selection in graphs with path coding penalties and network flows The Journal of Machine Learning Research Vol14, no. 1, (2013), pp.2449-2485.

Google Scholar

[6] V. Divyanshu,G. Baraniuk: Path Thresholding: Asymptotically Tuning-Free High-Dimensional Sparse Regression. preprint (2014).

Google Scholar

[7] V. Divyanshu, G. Baraniuk: When in doubt, SWAP: High-dimensional sparse recovery from correlated measurements Advances in Neural Information Processing Systems. (2013).

Google Scholar

[8] V. Divyanshu, G. Baraniuk: Swapping Variables for High-Dimensional Sparse Regression from Correlated Measurements preprint (2014).

Google Scholar

[9] J. Rodolphe, et al: Proximal methods for sparse hierarchical dictionary learning Proceedings of the 27th International Conference on Machine Learning. (2010).

Google Scholar

[10] M. Julien, et al: Online dictionary learning for sparse coding Proceedings of the 26th Annual International Conference on Machine Learning. ACM, (2009).

Google Scholar

[11] M. Julien, et al: Online learning for matrix factorization and sparse codingThe Journal of Machine Learning Research Vol. 11 (2010), pp.19-60.

Google Scholar

[12] I. Derenyi, G. Palla, and T. Vicsek: Clique percolation in random networks Physical Review Letters, Vol. 94, no. 16 (2005).

DOI: 10.1103/physrevlett.94.160202

Google Scholar

[13] S. Gregory: An algorithm to find overlapping community structure in networks In Knowledge Discovery in Databases, (2007), p.91—102.

DOI: 10.1007/978-3-540-74976-9_12

Google Scholar

[14] A. Lancichinetti, S. Fortunato, and J. Kertesz: Detecting the overlapping and hierarchical community structure of complex networks New J. Phys. (2009).

DOI: 10.1088/1367-2630/11/3/033015

Google Scholar

[15] M. Rosvall and C. T. Bergstrom: Maps of random walks on complex networks reveal community structure Proceedings of the National Academy of Sciences , (2008), p.1118—1123.

DOI: 10.1073/pnas.0706851105

Google Scholar

[16] http: /law. di. unimi. it/index. php.

Google Scholar