Skip to main content

A Graph Clustering Algorithm for Citation Networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9932))

Abstract

In this paper, we propose a novel network clustering algorithm, called CPSCAN for detecting the communities of citation network based on the temporal feature. Firstly, with combining temporal interval and citation path, a structural similarity model and a clustering algorithm is proposed. Then we propose a new modularity for measuring the quality of clustering on citation network. In empirical evaluation, we compare our method with existing methods on real world datasets. The experimental results demonstrates our algorithm has better performance on citation network than others methods.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)

    Article  Google Scholar 

  2. Shiokawa, H., Fujiwara, Y., Onizuka, M.: SCAN ++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. PVLDB 8(11), 1178–1189 (2015)

    Google Scholar 

  3. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. U.S.A. 99, 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  4. Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: Scan: a structural clustering algorithm for networks. In: Proceedings 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824–833 (2007)

    Google Scholar 

  5. Lim, S., Ryu, S., Kwon, S., Jung, K., Lee, J.G.: LinkSCAN∗: Overlapping Community Detection Using the Link-Space Transformation. In: ICDE (2014)

    Google Scholar 

Download references

Acknowledgment

The National Natural Science Foundation of China under Grant No. 61402213, 61472070, the Fundamental Research Funds for the Central Universities No. N150408001-3, N150404013

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tiezheng Nie .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhang, B., Nie, T., Shen, D., Kou, Y., Yu, G., Zhou, Z. (2016). A Graph Clustering Algorithm for Citation Networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45817-5_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45816-8

  • Online ISBN: 978-3-319-45817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics