Support vector machines with example dependent costs

Publikation: Beiträge in ZeitschriftenKonferenzaufsätze in FachzeitschriftenForschungbegutachtet

Standard

Support vector machines with example dependent costs. / Brefeld, Ulf; Geibel, Peter; Wysotzki, Fritz.
in: Lecture Notes in Computer Science, Jahrgang 2837, 01.01.2003, S. 23-34.

Publikation: Beiträge in ZeitschriftenKonferenzaufsätze in FachzeitschriftenForschungbegutachtet

Harvard

APA

Vancouver

Brefeld U, Geibel P, Wysotzki F. Support vector machines with example dependent costs. Lecture Notes in Computer Science. 2003 Jan 1;2837:23-34. doi: 10.1007/978-3-540-39857-8_5

Bibtex

@article{d62c64bc14e24a8ba0fe188cf1dd7589,
title = "Support vector machines with example dependent costs",
abstract = "Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We present a natural cost-sensitive extension of the support vector machine (SVM) and discuss its relation to the Bayes rule. We also derive an approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions.",
keywords = "Informatics, support vector machine, Cost matrix, Soft margin, Support Vector Machines (SVM), Dependent Cost, Business informatics",
author = "Ulf Brefeld and Peter Geibel and Fritz Wysotzki",
year = "2003",
month = jan,
day = "1",
doi = "10.1007/978-3-540-39857-8_5",
language = "English",
volume = "2837",
pages = "23--34",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Science and Business Media Deutschland",

}

RIS

TY - JOUR

T1 - Support vector machines with example dependent costs

AU - Brefeld, Ulf

AU - Geibel, Peter

AU - Wysotzki, Fritz

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We present a natural cost-sensitive extension of the support vector machine (SVM) and discuss its relation to the Bayes rule. We also derive an approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions.

AB - Classical learning algorithms from the fields of artificial neural networks and machine learning, typically, do not take any costs into account or allow only costs depending on the classes of the examples that are used for learning. As an extension of class dependent costs, we consider costs that are example, i.e. feature and class dependent. We present a natural cost-sensitive extension of the support vector machine (SVM) and discuss its relation to the Bayes rule. We also derive an approach for including example dependent costs into an arbitrary cost-insensitive learning algorithm by sampling according to modified probability distributions.

KW - Informatics

KW - support vector machine

KW - Cost matrix

KW - Soft margin

KW - Support Vector Machines (SVM)

KW - Dependent Cost

KW - Business informatics

UR - http://www.scopus.com/inward/record.url?scp=9444295412&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-39857-8_5

DO - 10.1007/978-3-540-39857-8_5

M3 - Conference article in journal

AN - SCOPUS:9444295412

VL - 2837

SP - 23

EP - 34

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

DOI

Zuletzt angesehen

Preise

  1. Transferpreis

Publikationen

  1. Home range size and resource use of breeding and non-breeding white storks along a land use gradient
  2. Class size, student performance and Tiebout bias
  3. Feature Extraction and Aggregation for Predicting the Euro 2016
  4. Ablation Study of a Multimodal Gat Network on Perfect Synthetic and Real-world Data to Investigate the Influence of Language Models in Invoice Recognition
  5. Perfectly nested or significantly nested - an important difference for conservation management
  6. The role of plant biodiversity in modifying the structure and functioning of higher tropic Levels in species-rich forests
  7. Computational modelling of submicron-sized metallic glasses
  8. Determinants and Outcomes of Dual Distribution:
  9. Facing Up to Third Party Liability for Space Activities
  10. Erroneous examples as desirable difficulty
  11. Implementation of Chemometric Tools to Improve Data Mining and Prioritization in LC-HRMS for Nontarget Screening of Organic Micropollutants in Complex Water Matrixes
  12. Deactivation and transformation products in biodegradability testing of ß-lactams amoxicillin and piperacillin
  13. Explaining Disagreement on Interest Rates in a Taylor-Rule Setting
  14. The implications of knowledge hiding at work for recovery after work: A diary study
  15. Fusion of knowledge bases for better navigation of wheeled mobile robotic group with 3D TVS
  16. 2. Advent
  17. Consular Assistance: Rights, Remedies, and Responsibility Comments on the ICJ's Judgment in the LaGrand Case
  18. An Approach for Ex-Post-Facto Analysis of Knowledge Graph-Driven Chatbots – The DBpedia Chatbot
  19. Some results on output algebraic feedback with applications to mechanical systems
  20. EMA Links with Management Systems and Other Stakeholders
  21. The polarity field concept