SavedAdd your journal

Journals / Hacettepe Journal of Mathematics and Statistics / 2017 / Cilt: 46 - Sayı: 3

A single pairwise model for classi cation using online learning with kernels

Engin TAŞ
Pages
547–557
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Performances of the pairwise setting andthe direct setting are compared in two problems from different domains.Results indicate that the pairwise setting outperforms the direct settingsigniffcantly.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Any binary or multi-class classiffcation problem can be transformedinto a pairwise prediction problem.
📊
Key Findings & Data:Performances of the pairwise setting andthe direct setting are compared in two problems from different domains.Results indicate that the pairwise setting outperforms the direct settingsigniffcantly.
💡
Conclusion & Impact:Result indicatethat this single pairwise model achieved competitive classiffcation rateseven in large-scaled datasets with higher dimensionality.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Any binary or multi-class classiffcation problem can be transformedinto a pairwise prediction problem. This expands the data and bringsan advantage of learning from a richer set of examples, in the expenseof increasing costs when the data is in higher dimensions. Therefore,this study proposes to adopt an online support vector machine to workwith pairs of examples. This modiffed algorithm is suitable for largedata sets due to its online nature and it can also handle the sparsitystructure existing in the data. Performances of the pairwise setting andthe direct setting are compared in two problems from different domains.Results indicate that the pairwise setting outperforms the direct settingsigniffcantly. Furthermore, a general framework is designed to use thispairwise approach in a multi-class classiffcation task. Result indicatethat this single pairwise model achieved competitive classiffcation rateseven in large-scaled datasets with higher dimensionality.

🔖

Cite This Article

TAŞ, E. (2022). A single pairwise model for classi cation using online learning with kernels. Hacettepe Journal of Mathematics and Statistics, Cilt: 46 - Sayı: 3, 547–557. https://ajindex.com/articles/529902

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (10)

  1. Rifkin, R. and Klautau, A. (2004). In defense of one-vs-all classiffcation. Journal of machine learning research, volume 5, pages 101-141.
  2. Xu, W. (2011). Towards optimal one pass large scale learning with averaged stochastic gradient descent. arXiv preprint arXiv:1107.2490. Weston, J. and Watkins, C. (1999). Support vector machines for multi-class pattern recognition. In Proceedings of the seventh European symposium on artiffcial neural networks, volume 4, pages 219-224. von Mering, C., Krause, R., Snel, B., Cornell, M., Oliver, S. G., Fields, S., and Bork, P. (2002). Comparative assessment of large-scale data sets of proteinprotein interactions. Nature, 417(6887), 399-403.
  3. Vert, J.-P., Qiu, J., and Noble, W. (2007). A new pairwise kernel for biological network inference with support vector machines. BMC Bioinformatics, 8(Suppl 10), S8. Vert, J.-P. and Kanehisa, M. (2003). Graph-driven features extraction from microarray data using diffusion kernels and kernel cca. Advances in Neural Information Processing System, 5, 1425-1432.
  4. Shalev-Shwartz, S., Singer, Y., and Srebro, N. (2007). Pegasos: Primal estimated subgradient solver for svm. In Proceedings of the 24th international conference on Machine learning, pages 807-814.
  5. ACM. Schölkopf, B. and Smola, A. (2001). Learning with kernels: Support vector machines, regularization, optimization, and beyond. MIT press. Rosenblatt, F. (1958). The perceptron: a probabilistic model for information storage and organization in the brain. Psychological review, 65(6), 386. Platt, J. C. (1999). 12 fast training of support vector machines using sequential minimal optimization. Oyama, S. and Manning, C. D. (2004). Using feature conjunctions across examples for learning pairwise classiffers. In 15th European Conference on Machine Learning (ECML2004). URL http://ilpubs.stanford.edu:8090/767/.
  6. Minsky, M. and Seymour, P. (1969).
  7. Perceptrons. Mayoraz, E. and Alpaydin, E. (1999). Support vector machines for multi-class classiffcation. Engineering Applications of Bio-Inspired Artiffcial Neural Networks, pages 833-842.
  8. Li, Y. and Long, P. (2002). The relaxed online maximum margin algorithm. Machine Learning, 46(1), 361-387.
  9. Kashima, H., Oyama, S., Yamanishi, Y., and Tsuda, K. (2009). On Pairwise Kernels: An Effcient Alternative and Generalization Analysis. In Proceedings of the 13th Paciffc-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD '09, pages 1030-1037,
  10. Berlin, Heidelberg, 2009. Springer-Verlag. ISBN