Querying inductive databases A case study on the MINE RULE operator.pdfVIP

下载本文档

1
0
约2.63万字
约 10页
2017-04-05 发布于江苏
举报
版权申诉

Querying inductive databases A case study on the MINE RULE operator.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Querying inductive databases A case study on the MINE RULE operator

Querying Inductive Databases:a Case Study on the MINE RULE Operator?Jean-Francois Boulicaut??, Mika Klemettinen, and Heikki MannilaUniversity of Helsinki, Department of Computer ScienceP.O. Box 26, FIN{00014 University of Helsinki, Finlande-mail:fboulicau,mklemett,mannilag@cs.helsinki.Abstract. Knowledge discovery in databases (KDD) is a process thatcan include steps like forming the data set, data transformations, dis-covery of patterns, searching for exceptions to a pattern, zooming ona subset of the data, and postprocessing some patterns. We describe acomprehensive framework in which all these steps can be carried out bymeans of queries over an inductive database. An inductive database isa database that in addition to data also contains intensionally denedgeneralizations about the data. We formalize this concept: an inductivedatabase consists of a normal database together with a subset of pat-terns from a class of patterns, and an evaluation function that tells howthe patterns occur in the data. Then, looking for potential query lan-guages built on top of SQL, we consider the research on the MINE RULEoperator by Meo, Psaila and Ceri. It is a serious step towards an imple-mentation framework for inductive databases, though it addresses onlythe association rule mining problem. Perspectives are then discussed.1 IntroductionData mining sets new challenges to database technology and new concepts andmethods are needed for general purpose query languages [9]. A possible approachis to formulate a data mining task as locating interesting sentences from a givenlogic that are true in the database. Then the task of the user/analyst can beviewed as querying this set, the so-called theory of the database. Formally, givena language L of sentences (or patterns), the theory of the database r with respectto L and a selection predicate q is the set Th(r;L; q) = f 2 L j q(r; )g: Thepredicate q indicates whether a sentence of the language is interesting. Thisdenition is quite g