Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/7404
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Vanahalli, M.K. | |
dc.contributor.author | Patil, N. | |
dc.date.accessioned | 2020-03-30T09:59:01Z | - |
dc.date.available | 2020-03-30T09:59:01Z | - |
dc.date.issued | 2017 | |
dc.identifier.citation | 2016 IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics Engineering, UPCON 2016, 2017, Vol., , pp.258-263 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7404 | - |
dc.description.abstract | Bioinformatics has contributed to a different form of datasets called as high dimensional datasets. The high dimensional datasets are characterized by a large number of features and a small number of samples. The traditional algorithms expend most of the running time in mining large number of small and mid-size items which does not enclose valuable and significant information. The recent research focused on mining large cardinality itemsets called as colossal itemsets which are significant to many applications, especially in the field of bioinformatics. The existing frequent colossal itemset mining algorithms are unsuccessful in discovering complete set of significant frequent colossal itemsets. The mined colossal itemsets from existing algorithms provide erroneous support information which affects association analysis. Mining significant frequent colossal itemsets with accurate support information helps in attaining a high-level accuracy of association analysis. The proposed work highlights a novel pre-processing technique and bottom-up row enumeration algorithm to mine significant frequent colossal itemsets with accurate support information. A novel pre-processing technique efficiently utilizes minimum support threshold and minimum cardinality threshold to prune irrelevant samples and features. The experiment results demonstrate that the proposed algorithm has high accuracy over existing algorithms. Performance study indicates the efficiency of the pre-processing technique. � 2016 IEEE. | en_US |
dc.title | Association analysis of significant frequent colossal itemsets mined from high dimensional datasets | 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.