Skip to main content

Network Classification with Missing Information

  • Conference paper
  • First Online:
Intelligent Systems and Applications (IntelliSys 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 295))

Included in the following conference series:

  • 944 Accesses

Abstract

Demand for effective methods of analyzing networks has emerged with the growth of accessible data, particularly for incomplete networks. Even as means for data collection advance, incomplete information remains a reality for numerous reasons. Data can be obscured by excessive noise. Surveys for information typically contain some non-respondents. In other cases, simple inaccessibility restricts observation. Also, for illicit groups, we are confronted with attempts to conceal important elements or their propagation of false information. In the real-world, it is difficult to determine when the observed network is both accurate and complete. In this paper, we consider a method for classification of incomplete networks. We classify real-world networks into technological, social, information, and biological categories by their structural features using supervised learning techniques. In contrast to the current method of training models with only complete information, we examine the effects of training our classification model with both complete and incomplete network information. This technique enables our model to learn how to recognize and classify other incomplete networks. The representation of incomplete networks at various stages of completeness allows the machine to examine the nuances of incomplete networks. By allowing the machine to study incomplete networks, its ability to recognize and classify other incomplete networks improves drastically. Our method requires minimal computational effort and can accomplish an efficient classification. The results strongly confirm the effectiveness of training a classification model with incomplete network information.

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

References

  1. Barabasi, A.-L.: Network Science. Cambridge University Press, Cambridge (2016)

    MATH  Google Scholar 

  2. Breiman, L.: Random forests. Mach. Learn. 45, 1 (2001). https://doi.org/10.1023/A:1010933404324

    Article  MATH  Google Scholar 

  3. Canning, J.P., et al.: Predicting graph categories from structural properties. CoRR, 1805.02682 (2018). http://arxiv.org/abs/1805.02682

  4. Chia, P.: assessing the robustness of graph statistics for network analysis under incomplete information. Master’s thesis, Department of Operations Analysis, Naval Postgraduate School, Monterey, CA (2018). https://calhoun.nps.edu/handle/10945/58284

  5. Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. US 99(25), 15879–15882 (2002)

    Article  MathSciNet  Google Scholar 

  6. Erdös, P., Rényi, A.: On random graphs. I. Publicationes Mathematicae 6, 290–297 (1959)

    MathSciNet  MATH  Google Scholar 

  7. Garcia-Laencina, P.J., Sancho-Gomez, J.-L., Figueiras-Vidal, A.R.: Pattern classification with missing data: a review. Neural Comput. App. 19(2) (2010). https://link.springer.com/article/10.1007/s00521-009-0295-6

  8. Geng, L., Semerci, M., Yener, B., Zaki, M.J.: Effective graph classification based on topological and label attributes. Stat. Anal. Data Mining 5(4), 265–283 (2012)

    Article  MathSciNet  Google Scholar 

  9. Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using network. In: 7th Python in Science Conference, SciPy, Pasadena, CA (2008). http://conference.scipy.org/proceedings/SciPy2008/paper_2

  10. LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436–444 (2015)

    Article  Google Scholar 

  11. Little, R., Rubin, D.: Statistical Analysis with Missing Data. Wiley (2014). http://ebookcentral.proquest.com/lib/ebook-nps/detail.action?docID=1775204

  12. Murphy, K.P.: Machine Learning: A Probabilistic Perspective. Massachusetts Institute of Technology Press, Cambridge (2012)

    MATH  Google Scholar 

  13. Newman, M.: Networks: An Introduction. Oxford University Press, Oxford (2010)

    Book  Google Scholar 

  14. Pedregosa, F., et al.: Scikit-learn: machine learning in python. Mach. Learn. Res. 12, 2825–2830 (2011)

    MathSciNet  MATH  Google Scholar 

  15. Ripley, B.D.: Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge (1996)

    Book  Google Scholar 

  16. Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In 29th AAAI Conference on A.I., AAAI15, Austin, TX (2015). http://ryanrossi.com/pubs/aaai15-nr.pdf

  17. Sparrow, M.K.: The application of network analysis to criminal intelligence: an assessment of the prospects. Soc. Netw. 13(3), 251–274 (1991)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruriko Yoshida .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yoshida, R., Vu, C. (2022). Network Classification with Missing Information. In: Arai, K. (eds) Intelligent Systems and Applications. IntelliSys 2021. Lecture Notes in Networks and Systems, vol 295. Springer, Cham. https://doi.org/10.1007/978-3-030-82196-8_13

Download citation

Publish with us

Policies and ethics