๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A multistrategy approach to classification learning in databases

โœ Scribed by Chang-Hwan Lee; Dong-Guk Shin

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
478 KB
Volume
31
Category
Article
ISSN
0169-023X

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper proposes a hybrid classiยฎcation learning system for databases that integrates rule induction and lazy learning. For rule induction learning, we use an entropy function based on Hellinger divergence to measure the amount of information each inductive rule contains. For lazy learning, we also use the Hellinger measure to automatically generate attribute weights and to compute similarities between data values of non-numeric data types. Our system has been implemented and tested extensively on a number of well-known machine learning data sets. The performance of our system was favorable compared to those of other well-known classiยฎcation learning techniques based on monostrategic learning methods.

๐Ÿ“œ SIMILAR VOLUMES

A lazy learning approach for building cl
A lazy learning approach for building classification models
โœ Inรฉs M. Galvรกn; Joล› M. Valls; Miguel Garcรญa; Pedro Isasi ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 203 KB

In this paper, we propose a lazy learning strategy for building classification learning models. Instead of learning the models with the whole training data set before observing the new instance, a selection of patterns is made depending on the new query received and a classification model is learnt

A learning approach to the database sele
A learning approach to the database selection problem in the presence of dynamic user interests and database contents
โœ Pooja Bajracharya; Snehasis Mukhopadhyay ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 1021 KB

## Abstract Database Selection is the problem of choosing, from a finite number of databases, the one that contains the most relevant information pertaining to a query. Previous approaches to this problem consisted of deterministic search techniques in conjunction with efficient pruning of search s

A new approach to mining fuzzy databases
A new approach to mining fuzzy databases using nearest neighbor classification by exploiting attribute hierarchies
โœ Supriya Kumar De; P. Radha Krishna ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB

Data classification is a well-organized operation in the field of data mining. This article presents an application of the k-nearest neighbor classification technique for mining a fuzzy database. We consider a data set in which attribute values have certain similarities in nature and analyze the obs

A logic approach to fuzzy relational dat
A logic approach to fuzzy relational databases
โœ M. A. Vila; J. C. Cubero; J. M. Medina; O. Pons ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 595 KB

A new definition of Fuzzy Relational Database is given by using logical concepts. With this definition it is possible to consider several kinds of fuzziness for the database attributes. A Domain Calculus-based query language is also established for the model. It allows us to formulate several types