【作者】 潘瑾； 严勇； 王晨； 方晨； 汪卫； 施伯乐；

【机构】 复旦大学计算机与信息技术系；

【摘要】 <正>1引言在数据集中挖掘频繁模式是数据挖掘研究的关键环节之一。在过去,很多的努力都集中在原子数据的挖掘上。然而,现实世界中许多实体之间总会保持着千丝万缕的关系。如何获得这些关系的频繁模式,更多还原

【Abstract】 With the development of internet,frequent pattern mining generalizes to more complex patterns like tree mining and graph mining.Such application arises in complex domains like bioinformatics,Web mining,etc. Based or.the concept of"frequent sequences first,frequent structures later",we present a novel algorithm,named Chopper,to discover frequent structures from labeled ordered trees.We compare its performance with TreeMinerV based on Apriori.The result shows that our algorithm can do the job better especially when the tree size is large and the support is small.更多还原