Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/7280
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAnanthanarayana, V.S.-
dc.date.accessioned2020-03-30T09:58:45Z-
dc.date.available2020-03-30T09:58:45Z-
dc.date.issued2011-
dc.identifier.citationCommunications in Computer and Information Science, 2011, Vol.154 CCIS, , pp.91-100en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7280-
dc.description.abstractToday, we have a large collection of data that is organized in the form of a set of relations which is partitioned into several databases. There could be implicit associations among various parts of this data. In this paper, we give a scheme for retrieving these associations using the notion of dominant entity. We propose a scheme for mining for dominant entity based association rules (DEBARs) which is not constrained to look for co-occurrence of values in tuples. We show the importance of such a mining activity by taking a practical example called personalized mining. We introduce a novel structure called multi-database domain link network (MDLN) which can be used to generate DEBARs between the values of attributes belonging to different databases. We show that MDLN structure is compact and this property of MDLN structure permit it to be used for mining vary large size databases. Experimental results reveal the efficiency of the proposed scheme. � 2011 Springer-Verlag Berlin Heidelberg.en_US
dc.titleAn efficient mining of dominant entity based association rules in multi-databasesen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
7280.pdf195.87 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.