Abstract

We are given a large population database that contains information about population instances. The population is known to comprise of m groups, but the population instances are not labeled with the group identification. Also given is a population sample (much smaller than the population but representative of it) in which the group labels of the instances are known. We present an interval classifier (IC) which generates a classification function for each group that can be used to efficiently retrieve all instances of the specified group from the population database. To allow IC to be embedded in interactive loops to answer adhoc queries about attributes with missing values, IC has been designed to be efficient in the generation of classification functions. Preliminary experimental results indicate that IC not only has retrieval and classifier generation efficiency advantages, but also compares favorably in the classification accuracy with current tree classifiers, such as ID3, which we...

Keywords

Computer scienceVery large databasePopulationCopyingNoticeClassifier (UML)Data miningPermissionDatabaseInformation retrievalArtificial intelligence

Related Publications

Publication Info

Year
1992
Type
article
Pages
560-573
Citations
266
Access
Closed

External Links

Citation Metrics

266
OpenAlex

Cite This

Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imieliński et al. (1992). An Interval Classifier for Database Mining Applications. , 560-573.