Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Mining maximal frequent subtrees remains at a preliminary state compared to the fruitful achievements in mining frequent subtrees. Thus, most of them are fundamentally complicated and this causes computational problems. ,  present a conceptually simple, yet effective approach based on lists structures. The beneficial effect of the proposed approach is that it not only gets rid of the process for infrequent tree pruning, but also eliminates totally the problem of candidate subtrees generation. As far as  know, this is the first algorithm that discovers maximal frequent subtrees without any subtree generation.
['Juryon Paik', 'Junghyun Nam', 'J. H. Hwang', 'Ung Mo Kim']
I am writing a research paper on a idea Mining maximal frequent subtrees with lists-based pattern-growth method
[{"from": "human", "value": "I am writing a research paper on a idea Mining maximal frequent subtrees with lists-based pattern-growth method"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Mining maximal frequent subtrees remains at a preliminary state compared to the fruitful achievements in mining frequent subtrees. Thus, most of them are fundamentally complicated and this causes computational problems. ,  present a conceptually simple, yet effective approach based on lists structures. The beneficial effect of the proposed approach is that it not only gets rid of the process for infrequent tree pruning, but also eliminates totally the problem of candidate subtrees generation. As far as  know, this is the first algorithm that discovers maximal frequent subtrees without any subtree generation."}]