Paper
12 April 2004 Mining multiple table databases with multiple minimum support constraints
Nita Mital, Naveen Kumar, Vasudha Bhatnagar
Author Affiliations +
Abstract
Most of the current data mining algorithms handle databases consisting of a single table. Recently few algorithms are proposed that mine data stored in multiple tables for association rules. The classical association rule mining implicitly assumes that all items in the data are of the same nature and/or have similar frequencies in the data. In real life applications this is not the case. So use of only one minimum support value for the whole database may not be sufficient. If minimum support is set high the rules that involve infrequent items will not be found and if minimum support is set very low then this may result in flood of rules. In this paper we present a technique that can allow a user to specify multiple minimum supports to take care of the natures of items and their varied frequencies in multiple-table database environment. We discuss previous approaches that partly address the related issues to present a couple of algorithms to address the issue of multiple support constraints in multiple table environment.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nita Mital, Naveen Kumar, and Vasudha Bhatnagar "Mining multiple table databases with multiple minimum support constraints", Proc. SPIE 5433, Data Mining and Knowledge Discovery: Theory, Tools, and Technology VI, (12 April 2004); https://doi.org/10.1117/12.541757
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Mining

Data mining

Floods

RELATED CONTENT


Back to Top