Prioritizing Nodes in Hierarchical Visualizations with the Tree Cut Model

google(2014)

引用 2|浏览8
暂无评分
摘要
We report on the development of a novel technique to select relevant nodes for presentation in hierarchical visualizations. It adapts the Tree Cut Model to the problem of determining the uneven deepest relevant level in a hierarchy, using it as a criterion for filtering data items. In a case study using Docuburst, we demonstrate how this technique can help creating better overviews of data by reducing visual clutter while highlighting relevant data.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要