Skip to main content

GSCS – Graph Stream Classification with Side Information

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2015)

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

Included in the following conference series:

  • 2786 Accesses

Abstract

With the popularity of applications like Internet, sensor network and social network, which generate graph data in stream form, graph stream classification has become an important problem. Many applications are generating side information associated with graph stream, such as terms and keywords in authorship graph of research papers or IP addresses and time spent on browsing in web click graph of Internet users. Although side information associated with each graph object contains semantically relevant information to the graph structure and can contribute much to improve the accuracy of graph classification process, none of the existing graph stream classification techniques consider side information. In this paper, we have proposed an approach, Graph Stream Classification with Side information (GSCS), which incorporates side information along with graph structure by increasing the dimension of the feature space of the data for building a better graph stream classification model. Empirical analysis by experimentation on two real life data sets is provided to depict the advantage of incorporating side information in the graph stream classification process to outperform the state of the art approaches. It is also evident from the experimental results that GSCS is robust enough to be used in classifying graphs in form of stream.

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 39.99
Price excludes VAT (USA)
  • Available as 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Google scholar. Website http://scholar.google.com/ (last access: March 27, 2015)

  2. Dblp: computer science bibliography. Website http://dblp.uni-trier.de/ (last access: March 27, 2015)

  3. Aggarwal, C.C.: On classification of graph streams. In: SDM 2011, pp. 652–663 (2011)

    Google Scholar 

  4. Samiullah, M., Ahmed, C.F., Nishi, M.A., Fariha, A., Abdullah, S.M., Islam, M.R.: Correlation mining in graph databases with a new measure. In: Ishikawa, Y., Li, J., Wang, W., Zhang, R., Zhang, W. (eds.) APWeb 2013. LNCS, vol. 7808, pp. 88–95. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Wang, Z., Tan, Y., Zhang, M.: Graph-based recommendation on social networks. In: APWeb 2010, pp. 116–122 (2010)

    Google Scholar 

  6. Chi, L., Li, B., Zhu, X.: Fast graph stream classification using discriminative clique hashing. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol. 7818, pp. 225–236. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Li, B., Zhu, X., Chi, L., Zhang, C.: Nested subtree hash kernels for large-scale graph classification over streams. In: ICDM 2012, pp. 399–408 (2012)

    Google Scholar 

  8. Guo, T., Chi, L., Zhu, X.: Graph hashing and factorization for fast graph stream classification. In: CIKM 2013, pp. 1607–1612 (2013)

    Google Scholar 

  9. Yu, P.S., Zhao, Y.: On graph stream clustering with side information. In: SIAM, pp. 139–150 (2013)

    Google Scholar 

  10. Soufiani, H.A., Airoldi, E.: Graphlet decomposition of a weighted network. In: AISTATS 2012, pp. 54–63 (2012)

    Google Scholar 

  11. Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph (algorithm 457). Commun. ACM 16(9), 575–576 (1973)

    Article  MATH  Google Scholar 

  12. Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques. In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 161–170. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3(1), 23–28 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  14. Cora data set. Website http://people.cs.umass.edu/~mccallum/data.html (last access: March 27, 2015)

  15. Imdb - internet movie database. Website http://www.imdb.com (last access: March 27, 2015)

  16. Sokolova, M., Lapalme, G.: A systematic analysis of performance measures for classification tasks. Inf. Process. Manage. 45(4), 427–437 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amit Mandal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mandal, A., Hasan, M., Fariha, A., Ahmed, C.F. (2015). GSCS – Graph Stream Classification with Side Information. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25255-1_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25254-4

  • Online ISBN: 978-3-319-25255-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics