Skip to main content

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

  • 903 Accesses

Abstract

The paper describes a classification algorithm based on the use of the nearest neighbor graph, that is built on the elements of both train and test sets. Process of classification is based on the frequency of elements of each class in the communities detected in the graph. Accuracy of classification for the developed algorithm exceeds accuracy of classification for random forest algorithm and XGBoost on particular datasets.

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

Similar content being viewed by others

References

  1. Breiman L (2001) Random forests. Mach Learn 45(1):5–32. [Online]. https://doi.org/10.1023/A:10109334043242

  2. Chen T, Guestrin C (2016) XGBoost: a scalable tree boosting system. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, ser. KDD ’16. ACM, New York, NY, USA, pp 785–794. [Online] https://doi.org/10.1145/2939672.29397853

  3. Alpaydın E, Kaynak C (1997) Cascading classifiers. Kybernetika 34:369–374

    Google Scholar 

  4. Street WN, Wolberg WH, Mangasarian OL (1993) Nuclear feature extraction for breast tumor diagnosis. In: Acharya RS, Goldgof DB (eds) Biomedical image processing and biomedical visualization. International society for optics and photonics. SPIE, vol 1905, pp 861–870. [Online] https://doi.org/10.1117/12.1486985

  5. Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. [Online] https://doi.org/10.1103/PhysRevE.76.036106

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mikhail Chernoskutov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chernoskutov, M. (2022). Using Graphs for Classification. In: Yang, XS., Sherratt, S., Dey, N., Joshi, A. (eds) Proceedings of Sixth International Congress on Information and Communication Technology. Lecture Notes in Networks and Systems, vol 217. Springer, Singapore. https://doi.org/10.1007/978-981-16-2102-4_67

Download citation

Publish with us

Policies and ethics