Return
Cost-Sensitive Online Classification
DOI:10.1109/TKDE.2013.157.png)
Abstract
En 中文
Both cost-sensitive classification and online learning have been extensively studied in data mining and machine learning communities, respectively. However, very limited study addresses an important intersecting problem, that is, Cost-Sensitive Online Classification. In this paper, we formally study this problem, and propose a new framework for Cost-Sensitive Online Classification by directly optimizing cost-sensitive measures using online gradient descent techniques. Specifically, we propose two novel cost-sensitive online classification algorithms, which are designed to directly optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. We analyze the theoretical bounds of the cost-sensitive measures made by the proposed algorithms, and extensively examine their empirical performance on a variety of cost-sensitive online classification tasks. Finally, we demonstrate the application of the proposed technique for solving several online anomaly detection tasks, showing that the proposed technique could be a highly efficient and effective tool to tackle cost-sensitive online classification tasks in various application domains.
Keywords:
Cost-sensitive classification
online learning
online gradient descent
online anomaly detection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
Cited Papers
MACHINE LEARNING TECHNIQUES TO DIAGNOSE BREAST-CANCER FROM IMAGE-PROCESSED NUCLEAR FEATURES OF FINE-NEEDLE ASPIRATES
CANCER LETTERS
IF10.1
Arsenic removal from aqueous solutions by adsorption using novel MIL-53(Fe) as a highly efficient adsorbent
RSC Advances
IF0

