Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/80824
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu, Q.-
dc.contributor.authorShi, P.-
dc.contributor.authorHu, Z.-
dc.date.issued2013-
dc.identifier.citationICIC Express Letters, Part B: Applications, 2013; 4(1):121-128-
dc.identifier.issn2185-2766-
dc.identifier.urihttp://hdl.handle.net/2440/80824-
dc.description.abstractEfficient mining of Strong Jumping Emerging Patterns (SJEPs) is useful for constructing accurate classifiers. The method for mining SJEPs based on a contrast pattern tree structure (CP-Tree) has been demonstrated to perform extremely well for a low-dimensional dataset. In the method, a large number of non-minimal JEPs are generated during the mining process. So, it is unable to handle higher-dimensional attributes. In this paper, we propose a novel pattern pruning technique that dramatically reduces the search space. The CP-tree method is greatly improved by the proposed pattern pruning technique. Experiments are performed on two high-dimensional cancer datasets. Compared with the original CP-tree algorithm, the results show that the improved CP-tree algorithm is substantially faster, and able to handle higher-dimensional attributes.-
dc.description.statementofresponsibilityQuanzhong Liu, Peng Shi and Zhengguo Hu-
dc.language.isoen-
dc.publisherICIC International-
dc.rightsCopyright status unknown-
dc.source.urihttp://www.ijicic.org/elb-4(1).htm-
dc.subjectCP-tree-
dc.subjectData mining-
dc.subjectPattern pruning-
dc.subjectSJEPs-
dc.titleFast algorithms for mining Strong Jumping Emerging Patterns using the contrast pattern tree-
dc.typeJournal article-
pubs.publication-statusPublished-
dc.identifier.orcidShi, P. [0000-0001-8218-586X]-
Appears in Collections:Aurora harvest 4
Electrical and Electronic Engineering publications

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.