A novel greedy approach for Compact Pattern Tree

dc.contributor.author	Rani, K. Swarupa
dc.date.accessioned	2022-03-27T05:50:58Z
dc.date.available	2022-03-27T05:50:58Z
dc.date.issued	2016-05-26
dc.description.abstract	Organization of transactional data is one of the important steps in Knowledge Discovery. Compact Pattern Tree (CPTree) organization of the data is apt for the FP-Tree, CAN-Tree, CATS-Tree etc., Construction of CPTree has been dealt within two phase method. This paper exploits the transactional data representation in a structured form using one of the data structures for subsequent representation of a transaction. A novel counting based algorithm inspired by Hungarian Method for assignment problem and subsequently the reduct computational method by Johnson Algorithm in Rough Sets has been proposed and demonstrated. The performance evaluation of the proposed method is compared with conventional two phase method on datasets of UCI learning repository.
dc.identifier.citation	2016 International Conference on Computer Communication and Informatics, ICCCI 2016
dc.identifier.uri	10.1109/ICCCI.2016.7479976
dc.identifier.uri	http://ieeexplore.ieee.org/document/7479976/
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8293
dc.subject	Big Data
dc.subject	Boolean Matrix
dc.subject	CPTree
dc.title	A novel greedy approach for Compact Pattern Tree
dc.type	Conference Proceeding. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1