Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/7411Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kumar, P. | |
| dc.contributor.author | Ananthanarayana, V.S. | |
| dc.date.accessioned | 2020-03-30T09:59:02Z | - |
| dc.date.available | 2020-03-30T09:59:02Z | - |
| dc.date.issued | 2012 | |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, Vol.6411 LNCS, , pp.333-340 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7411 | - |
| dc.description.abstract | The abstraction based algorithms read databases in sequential order and then construct abstraction of the database in memory. Given any database with n attributes, it is possible to read the same in n! ways. These different n! ways lead to abstractions of different sizes. In this paper, for a given a set of transactions D, we find the sequence or order of the attributes in which the database is read, a representation which is compact than PC-tree, can be obtained in the memory. � 2012 Springer-Verlag. | en_US |
| dc.title | Attribute -TID method for discovering sequence of attributes | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.