Abstract
In many problems, we need to classify items, that is, we need to predict some characteristic of an item based on several parameters of the item. Classifications are usually done by classifiers. After being trained on some sample data, these classifiers can be used to classify new data. Section 17.1 describes decision trees, which were frequently used in the nineties by artificial intelligence experts to classify data because they can be easily implemented, and they provide an explanation of the classification. Section 17.2 describes support vector machines, which are increasingly popular classification tools because of the high accuracy of their classifications.
Many challenging applications also require the reuse of the old classifiers to derive a new classifier. Section 17.3 describes the classification integration problem, while Section 17.4 describes the reclassification problem. Section 17.5 discusses data integration via wrappers. Section 17.6 summarizes data fusion. Finally, Section 17.7 discusses the trust management approach to computer security. Constraint databases are helpful in solving all of these problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this chapter
Cite this chapter
Revesz, P. (2010). Data Integration. In: Introduction to Databases. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84996-095-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-84996-095-3_17
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84996-094-6
Online ISBN: 978-1-84996-095-3
eBook Packages: Computer ScienceComputer Science (R0)