TY - GEN
T1 - CoCoST
T2 - 9th IEEE International Conference on Data Mining, ICDM 2009
AU - Li, Liyun
AU - Topkara, Umut
AU - Coskun, Baris
AU - Memon, Nasir
PY - 2009
Y1 - 2009
N2 - Computational cost of classification is as important as accuracy in on-line classification systems. The computational cost is usually dominated by the cost of computing implicit features of the raw input data. Very few efforts have been made to design classifiers which perform effectively with limited computational power; instead, feature selection is usually employed as a pre-processing step to reduce the cost of running traditional classifiers. We present CoCoST, a novel and effective approach for building classifiers which achieve state-of- the-art classification accuracy, while keeping the expected computational cost of classification low, even without feature selection. CoCost employs a wide range of novel cost-aware decision trees, each of which is tuned to specialize in classifying instances from a subset of the input space, and judiciously consults them depending on the input instance in accordance with a cost-aware meta-classifier. Experimental results on a network flow detection application show that, our approach can achieve better accuracy than classifiers such as SVM and random forests, while achieving 75%-90% reduction in the computational costs.
AB - Computational cost of classification is as important as accuracy in on-line classification systems. The computational cost is usually dominated by the cost of computing implicit features of the raw input data. Very few efforts have been made to design classifiers which perform effectively with limited computational power; instead, feature selection is usually employed as a pre-processing step to reduce the cost of running traditional classifiers. We present CoCoST, a novel and effective approach for building classifiers which achieve state-of- the-art classification accuracy, while keeping the expected computational cost of classification low, even without feature selection. CoCost employs a wide range of novel cost-aware decision trees, each of which is tuned to specialize in classifying instances from a subset of the input space, and judiciously consults them depending on the input instance in accordance with a cost-aware meta-classifier. Experimental results on a network flow detection application show that, our approach can achieve better accuracy than classifiers such as SVM and random forests, while achieving 75%-90% reduction in the computational costs.
KW - Cost efficient decision tree
KW - Inverse-boosting
KW - Meta-classifier
KW - Suppressed cost
UR - http://www.scopus.com/inward/record.url?scp=77951173680&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951173680&partnerID=8YFLogxK
U2 - 10.1109/ICDM.2009.46
DO - 10.1109/ICDM.2009.46
M3 - Conference contribution
AN - SCOPUS:77951173680
SN - 9780769538952
T3 - Proceedings - IEEE International Conference on Data Mining, ICDM
SP - 268
EP - 277
BT - ICDM 2009 - The 9th IEEE International Conference on Data Mining
Y2 - 6 December 2009 through 9 December 2009
ER -