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

DB-HReduction: A data preprocessing algorithm for data mining applications

โœ Scribed by Xiaohua Hu


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
574 KB
Volume
16
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis


Data preprocessing

is an important and critical step in the data mining process and it has a huge impact on the SUCCESS of a data mining project.

In this paper, we present an algorithm DB-HFkduction, which discretiaes or eliminates numeric attributes and generalizes or eliminates symbolic attributes very efficiently and effectively. This algorithm greatly decreases the number of attributes and tuplea of the data set and improves the accuracy and decreases the running time of the data mining algorithms in the later stage.


๐Ÿ“œ SIMILAR VOLUMES


A co-training algorithm for multi-view d
โœ Mark Culp; George Michailidis ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 385 KB

## Abstract In several scientific applications, data are generated from two or more diverse sources (views) with the goal of predicting an outcome of interest. Often it is the case that the outcome is not associated with any single view. However, the synergy of all measurements from each view may y

LICRA: A replicated-data management algo
โœ Rushed Kanawati ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1023 KB

Replicated data consistency is a key issue in the design of distributed real time groupware applications. In this paper, we propose a new protocol to cope with this problem. The proposed algorithm guarantees an optimal response time while ensuring data consistency at system quiescence. The originali