TY - GEN
T1 - Attribute -TID method for discovering sequence of attributes
AU - Kumar, Preetham
AU - Ananthanarayana, V. S.
PY - 2012/3/15
Y1 - 2012/3/15
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84858033246
UR - https://www.scopus.com/pages/publications/84858033246#tab=citedBy
U2 - 10.1007/978-3-642-27872-3_49
DO - 10.1007/978-3-642-27872-3_49
M3 - Conference contribution
AN - SCOPUS:84858033246
SN - 9783642278716
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 333
EP - 340
BT - Data Engineering and Management - Second International Conference, ICDEM 2010, Revised Selected Papers
T2 - 2nd International Conference on Data Engineering and Management, ICDEM 2010
Y2 - 29 July 2010 through 31 July 2010
ER -