Cited By
View all- Borisovsky P(2024)A Parallel “Go with the Winners” Algorithm for Some Scheduling ProblemsJournal of Applied and Industrial Mathematics10.1134/S199047892304001417:4(687-697)Online publication date: 16-Feb-2024
In this paper we present a new method for finding frequent patterns from tree-structured data, where a frequent pattern means a subgraph which frequently occurs in a given tree-structured data. We make use of a data compression method called TGCA ...
Mining frequent patterns is an important task for knowledge discovery, which discovers the groups of items appearing always together excess of a user specified threshold. A famous algorithm for mining frequent patterns is FP-Growth which constructs a ...
Mining frequent patterns is to discover the groups of items appearing always together excess of a user specified threshold. Many approaches have been proposed for mining frequent pattern. However, either the search space or memory space is huge, such ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in