HCG: A new algorithm for mining share-frequent patterns

Simple item page
dc.contributor.authorNawapornanan, Chayanan
dc.contributor.authorBoonjing, Veera
dc.date.accessioned2026-08-06T10:08:09Z
dc.date.available2026-08-06T10:08:09Z
dc.date.issued2014-01-01
dc.description.abstractThe paper proposes a new efficient algorithm, named HCG algorithm, to mine share-frequent patterns from an incremental pattern set table knowledge called PSTable. The PSTable stores all non redundant patterns with their count information by a single database scan A transaction newly added to the database can be incrementally added to the PSTable. The new algorithm efficiently discovers all share-frequent patterns from the PSTable by generating candidates from only high share atomic patterns. Its correctness is assured by the downward closure property. The experiment results on dense and sparse datasets show that the proposed algorithm is more efficient than existing algorithms in terms of both execution time and number of candidates.
dc.identifier.citation2014 International Computer Science and Engineering Conference Icsec 2014, 398-402, 2014
dc.identifier.doi10.1109/ICSEC.2014.6978230
dc.identifier.other2-s2.0-84942856226
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/5294
dc.source2014 International Computer Science and Engineering Conference Icsec 2014
dc.subjectData mining
dc.subjectFrequent pattern mining
dc.subjectShare-frequent patterns mining
dc.titleHCG: A new algorithm for mining share-frequent patterns
dc.typeConference Paper

Files

Collections

Research