Abstract
The ultimate goal of classification algorithms is to achieve the best possible classification performance for the problem at hand. Most often, classification performance is obtained by assessing some accuracy criterion using the test set, \(T.\) Therefore, an effective classification in \(T.\) As discussed, it is often hard to approximate the target function defined over inputs in \(T,\) using a single mapping function. The key insight is to produce a specifically designed function, \(f^{x_i}_{S},\) which approximates the target function at each input \(x_i\in T.\) Thus, a natural way to improve classification in \(T,\) on a demand-driven basis. In this case, particular characteristics of each input in \(T\) may be taken into account while predicting the corresponding output. The expected result is a set of multiple mapping functions, where each function \(f^{x_i}_{S}\) is likely to perform particularly accurate predictions for input \(x_i\in{T},\) no matter the (possible poor) performance in predicting outputs for other inputs .
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Usefulness is defined in Sect. 3.2.
References
Amsler, R.: Application of citation-based automatic classification. Technical report, The University of Texas at Austin, Linguistics Research Center (1972)
Baralis, E., Chiusano, S., Garza, P.: On support thresholds in associative classification. In: Proceedings of the Symposium on Applied Computing (SAC), pp. 553–558. ACM Press (2004)
Calado, P., Cristo, M., Moura, E., Ziviani, N., Ribeiro-Neto, B., Gonçalves, M.: Combining link-based and content-based methods for web document classification. In: Proceedings of the Conference on Information and Knowledge Management (CIKM), pp. 394–401. ACM Press (2003)
Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines, 2001. Available at http://www.csie.ntu.edu.tw/∼cjlin/papers/libsvm.pdf
Fayyad, U., Irani, K.: Multi interval discretization of continuous-valued attributes for classification learning. In: Proceeding of the International Joint Conference on Artificial Intelligence (IJCAI). pp. 1022–1027 (1993)
Joachims, T., Cristianini, N., Shawe-Taylor, J.: Composite kernels for hypertext categorisation. In: Proceeding of the International Conference on Machine Learning (ICML), pp. 250–257. ACM Press (2001)
Kohavi, R., Sommerfield, D., Dougherty, J.: Data mining using MLC++: A machine learning library in C++. In: Tools with Artificial Intelligence, pp. 234–245 (1996)
Li, J., Dong, G., Ramamohanarao, K., Wong, L.: Deeps: A new instance-based lazy discovery and classification system. Mach. Learn. 54(2), pp. 99–124 (2004)
Veloso, A.., Meira, W., Jr., Zaki, M.J.: Lazy associative classification. In: Proceeding of the International Conference on Data Mining (ICDM), pp. 645–654. IEEE Computer Society (2006)
Yang, Y., Slattery, S., Ghani, R. A study of approaches to hypertext categorization. J. Intell. Inf. Syst. 18(2–3), 219–241(2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Adriano Veloso
About this chapter
Cite this chapter
Veloso, A., Meira, W. (2011). Demand-Driven Associative Classification. In: Demand-Driven Associative Classification. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-525-5_4
Download citation
DOI: https://doi.org/10.1007/978-0-85729-525-5_4
Published:
Publisher Name: Springer, London
Print ISBN: 978-0-85729-524-8
Online ISBN: 978-0-85729-525-5
eBook Packages: Computer ScienceComputer Science (R0)