.png){kind=icon}
返回
An efficient clustering algorithm for patterns placement in walkthrough system
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-005-4364-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Mining of sequential patterns in walkthrough systems is an interesting data mining problem. It can be envisioned as a tool for forecasting and prediction of the future behavior of user's traversal patterns. In the past, how to display the object faster in the next time were their concerns. They seldom consider the problem of access times of objects in the storage systems. In this paper, we will consider this problem and solve this by clustering. Clustering methodology is particularly appropriate for the exploration of interrelationships among objects to reduce the access times of objects. We record the user's path as log-data and store it in database. After a certain period of time, we will process the log-data database for user traversal paths and find out their characteristics, which will be utilized to determine the optimal physical organization of those VRML objects on disks. Meanwhile, we also introduce the relationships among transactions, views and objects. According to these relationships, we suggest the clustering criteria--inter-pattern similarity, which utilize these characteristics to distribute the objects into the appropriate clusters. As a result, the large-scale VRML models could be accessed more efficiently, allowing for a real-time walk-through in the scene.
Keyword:
walkthrough system
co-occurence
clustering
sequential patterns
access time
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容