Towards an algebraic framework for querying inductive databases

Authors:
Hong-Cheu Liu;Aditya Ghose;John Zeleznikow
Affiliations:
Department of Computer Science and Mutimedia Design, Diwan University, Madou, Tainan County, Taiwan;School of Computer Science and Software Engineering, University of Wollongong, Wollongong, Australia;School of Information Systems, Victoria University, Melbourne, Vic., Australia
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Year:
2010

Citing 7
Cited 2

C4.5: programs for machine learning

C4.5: programs for machine learning
Algebraic equivalences of nested relational operators

Information Systems
Expressive power of an algebra for data mining

ACM Transactions on Database Systems (TODS)
An inductive database and query language in the relational model

EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An inductive database prototype based on virtual mining views

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A Logic-Based Approach to Mining Inductive Databases

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Towards a general framework for data mining

KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases

On Armstrong-compliant logical query languages

Proceedings of the 4th International Workshop on Logic in Databases
A relational view of pattern discovery

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a theoretical foundation for querying inductive databases, which can accommodate disparate mining tasks. We present a data mining algebra including some essential operations for manipulating data and patterns and illustrate the use of a fix-point operator in a logic-based mining language. We show that the mining algebra has equivalent expressive power as the logic-based paradigm with a fix-point operator.