Constructing and visualizing topic forests for text streams

Takayasu Fushimi, T. Satoh
{"title":"Constructing and visualizing topic forests for text streams","authors":"Takayasu Fushimi, T. Satoh","doi":"10.1145/3106426.3106455","DOIUrl":null,"url":null,"abstract":"A great deal of such texts as news and blog articles, web pages, and scientific literature are posted on the web as time goes by, and are generally called time-series documents or text streams. For each document, some strongly or weakly relevant texts exist. Although such relevance is represented as citations among scientific literatures, trackback among blog articles, hyperlinks among Wikipedia articles or web pages and so on, the relevance among news articles is not always clearly specified. One easy way to build a similarity network is by calculating the similarity among news articles and making links among similar articles; however, adding information about the posted times of articles to a similarity network is difficult. To overcome this problem, we propose a framework that consists of two parts: 1) tree structures called Topic Forests and 2) their visualization. Topic Forests are constructed by semantically and temporally linking cohesive texts while preserving their posted order. We provide effective access for users to text streams by embedding Topic Forests over the polar coordinates with a technique called Polar Coordinate Embedding. From experimental evaluations using the actual text streams of news articles, we confirm that Topic Forests semantically and temporally maintain cohesiveness, and Polar Coordinate Embedding achieves effective accessibility.","PeriodicalId":20685,"journal":{"name":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3106426.3106455","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

A great deal of such texts as news and blog articles, web pages, and scientific literature are posted on the web as time goes by, and are generally called time-series documents or text streams. For each document, some strongly or weakly relevant texts exist. Although such relevance is represented as citations among scientific literatures, trackback among blog articles, hyperlinks among Wikipedia articles or web pages and so on, the relevance among news articles is not always clearly specified. One easy way to build a similarity network is by calculating the similarity among news articles and making links among similar articles; however, adding information about the posted times of articles to a similarity network is difficult. To overcome this problem, we propose a framework that consists of two parts: 1) tree structures called Topic Forests and 2) their visualization. Topic Forests are constructed by semantically and temporally linking cohesive texts while preserving their posted order. We provide effective access for users to text streams by embedding Topic Forests over the polar coordinates with a technique called Polar Coordinate Embedding. From experimental evaluations using the actual text streams of news articles, we confirm that Topic Forests semantically and temporally maintain cohesiveness, and Polar Coordinate Embedding achieves effective accessibility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为文本流构建和可视化主题森林
大量的文本,如新闻和博客文章、网页和科学文献,随着时间的推移被发布在网络上,通常被称为时间序列文档或文本流。对于每个文档,存在一些强相关或弱相关的文本。虽然这种相关性表现为科学文献之间的引用、博客文章之间的追溯、维基百科文章或网页之间的超链接等,但新闻文章之间的相关性并不总是明确规定的。建立相似网络的一个简单方法是计算新闻文章之间的相似度,并在相似的文章之间建立链接;然而,在相似网络中添加关于文章发布时间的信息是困难的。为了克服这个问题,我们提出了一个由两部分组成的框架:1)称为主题森林的树结构和2)它们的可视化。主题森林是通过语义上和时间上连接内聚文本,同时保持其发布顺序来构建的。我们使用一种称为极坐标嵌入的技术在极坐标上嵌入主题森林,为用户提供对文本流的有效访问。通过对实际新闻文本流的实验评估,我们证实了主题森林在语义和时间上保持了内聚性,极坐标嵌入实现了有效的可达性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
WIMS 2020: The 10th International Conference on Web Intelligence, Mining and Semantics, Biarritz, France, June 30 - July 3, 2020 A deep learning approach for web service interactions Partial sums-based P-Rank computation in information networks Mining ordinal data under human response uncertainty Haste makes waste: a case to favour voting bots
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1