Another problem is previous frequent subgraph mining algorithms treat graphs uniformly while graphs have different importance actually.

• 传统的频繁子图挖掘方法对满足最小支持度阈值的子图同等对待，但在真实数据库中不同的子图往往具有不同的重要程度。