首页> 外文会议>International Conference on Computational Science pt.3 >PrefixUnion: Mining Traversal Patterns Efficiently in Virtual Environments
【24h】

PrefixUnion: Mining Traversal Patterns Efficiently in Virtual Environments

机译:prefixunion:在虚拟环境中有效地挖掘遍历模式

获取原文

摘要

Sequential pattern mining is an important data mining problem with broad applications. Especially, it is also an interesting problem in virtual environments. In this paper, we propose a projection-based, sequential pattern-growth approach, called PrefixUnion. Meanwhile, we also introduce the relationships among transactions, views and objects. According to these relationships, we suggest two mining criteria — inter-pattern growth and intra-pattern growth, which utilize these characteristics to offer ordered growth and reduced projected database. As a result, the large-scale VRML models could be accessed more efficiently, allowing for a real-time walk-through in the scene.
机译:顺序模式挖掘是具有广泛应用的重要数据挖掘问题。特别是,它在虚拟环境中也是一个有趣的问题。在本文中,我们提出了一种基于投影的顺序模式 - 生长方法,称为prefixunion。同时,我们还介绍事务,视图和对象之间的关系。根据这些关系,我们建议两个采矿标准 - 模式间的增长和模式增长,利用这些特征来提供有序增长和减少的预计数据库。结果,可以更有效地访问大规模的VRML模型,允许在场景中实时步行。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号