Skip to main content

Characteristics of the Group Interest Network

  • Conference paper
Numerical Analysis and Its Applications (NAA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5434))

Included in the following conference series:

  • 1788 Accesses

Abstract

By studying the behavior characteristics visiting world wide web of the specifically campus group, this paper constructed dynamic group interest network, which was a para-bipartite graph. The time features that the group user visited world-wide-web had been observed, the topological structure had been discussed. The degree exponents had been drafted for the one week data. Although the users’ visiting time is random and their surfing pages were different but the interests of a majority of the campus group were accordant. The results indicate that the incoming degree distribution of the group interest network follows power law. And the group interest spectrum was basically steady. The visiting behavior of the campus group had their special disciplinarian.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Nets to the Internet and the WWW. Oxford Univ. Press, Oxford (2003)

    Book  MATH  Google Scholar 

  3. Pastor-Satorras, R., Vespignani, A.: Evolution and Structure of the Internet: a Statistical Physics Approach. Cambridge Univ. Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  4. Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. Amaral, L.A.N., Ottino, J.M.: Complex networks-augmenting the framework for the study of complex systems. Eur. Phys. J. B 38, 147–162 (2004)

    Article  Google Scholar 

  6. Erdös, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–61 (1960)

    MathSciNet  MATH  Google Scholar 

  7. Watts, D.J., Strogatz, S.H.: Collective dynamics of ’small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  8. Albert, R., Jeong, H., Barabási, A.L.: Diameter of the World Wide Web. Nature 401, 130–131 (1999)

    Article  Google Scholar 

  9. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. Comput. Commun. Rev. 29, 251–262 (1999)

    Article  MATH  Google Scholar 

  10. Newman, M.E.J.: Scientific collaboration networks: I. Network construction and fundamental results. Phys. Rev. E 64, 016131 (2001)

    Google Scholar 

  11. Newman, M.E.J.: Scientific collaboration networks: II. Shortest paths, weighted networks, and centrality. Phys. Rev. E 64, 016132 (2001)

    Google Scholar 

  12. Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 98, 404–409 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Albert, R., Jeong, H., Barabási, A.-L.: Error and attack tolerance of complex networks. Nature 406, 378 (2000)

    Article  Google Scholar 

  14. China Internet Network Information Center: Statistical Reports on the Internet Development in China (2007) (in Chinese), http://www.cnnic.cn/html/Dir/2007/01/22/4395.htm

  15. Li, Y.P.: Sunshine information–conflict-free share structure. China engineering science 2, 24–27 (2000)

    MathSciNet  Google Scholar 

  16. Li, Y.P.: Construct Broad-Storage grid. Computer world 37 (2005) (in Chinese)

    Google Scholar 

  17. Lin, H.F., Yang, Y.S.: The representation and update mechanism for user profile. Journal of computer research and development 39, 843–847 (2002) (in Chinese)

    Google Scholar 

  18. Lei, Y.S., Gan, R.C., Du, D.: A framework of adaptive vertical website based on user preferences. Computer Engineering 31, 18–20 (2005) (in Chinese)

    Google Scholar 

  19. Chen, J.L.: User’s interest model based on data cube. Journal of Gulin university of technology 25, 84–88 (2005) (in Chinese)

    Google Scholar 

  20. Hu, Y.H., Zhao, H.J., Lu, H.R., Wang, H.J.: Research on extracting patterns from web user behavior. Computer Engineering and Design 27, 3416–3418 (2006) (in Chinese)

    Google Scholar 

  21. Sun, T.L., Yang, F.Q.: An approach of building and updating user interest profile according to the implicit feedback. Journal of northeast normal university 35, 99–104 (2003) (in Chinese)

    Google Scholar 

  22. Zhao, Y.C., Fu, G.Y., Zhu, Z.Y.: User interest mining of combining web content and behavior analysis. Computer Engineering 31, 93–94 (2005) (in Chinese)

    Google Scholar 

  23. Xu, K., Cui, Z.M.: User profile model based on user search histories. Computer technology and development 16, 18–20 (2006) (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, N. (2009). Characteristics of the Group Interest Network. In: Margenov, S., Vulkov, L.G., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2008. Lecture Notes in Computer Science, vol 5434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00464-3_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00464-3_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00463-6

  • Online ISBN: 978-3-642-00464-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics