Current studentsExisting staffContact us
 

Towards an algebraic framework for querying inductive databases

Simple item page
dc.contributor.authorLiu, H.C.
dc.contributor.authorGhose, A.
dc.contributor.authorZeleznikow, J.
dc.contributor.conferenceInternational Conference on Database Systems for Advanced Applications DASFAA 2010 (1 Apr 2010 - 4 Apr 2010 : Japan)
dc.date.issued2010
dc.description.abstractIn 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 fixpoint operator.
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, pp.306-312
dc.identifier.doi10.1007/978-3-642-12098-5_24
dc.identifier.isbn9783642120978
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttps://hdl.handle.net/1959.8/152159
dc.language.isoen
dc.publisherSpringer
dc.publisher.placeGermany
dc.relation.ispartofseries5982
dc.rightsCopyright 2010 Springer
dc.source.urihttps://doi.org/10.1007/978-3-642-12098-5_24
dc.subjectalgebraic framework
dc.subjectexpressive power
dc.subjectfixpoints
dc.subjectinductive database
dc.subjectmining tasks
dc.subjecttheoretical foundations
dc.titleTowards an algebraic framework for querying inductive databases
dc.typeConference paper
pubs.publication-statusPublished
ror.mmsid9915910505501831

Files

Collections