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.
Author supplied keywords
Cite
CITATION STYLE
Kumar, P., & Ananthanarayana, V. S. (2012). Attribute -TID method for discovering sequence of attributes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6411 LNCS, pp. 333–340). https://doi.org/10.1007/978-3-642-27872-3_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
