Table Based Single Pass Algorithm for Clustering Electronic Documents in 20NewsGroups

T. Jo, Geun-Sik Jo
{"title":"Table Based Single Pass Algorithm for Clustering Electronic Documents in 20NewsGroups","authors":"T. Jo, Geun-Sik Jo","doi":"10.1109/IWSCA.2008.32","DOIUrl":null,"url":null,"abstract":"This research proposes a modified version of single pass algorithm which is specialized for text clustering. Encoding documents into numerical vectors for using the traditional version of single pass algorithm causes the two main problems: huge dimensionality and sparse distribution. Therefore, in order to address the two problems, this research modifies the single pass algorithm into its version where documents are encoded into not numerical vectors but alternative forms. In the proposed version, documents are mapped into tables and a similarity of two documents is computed by comparing their tables with each other. The goal of this research is to improve the performance of single pass algorithm for text clustering by modifying it into the specialized version.","PeriodicalId":425055,"journal":{"name":"2008 IEEE International Workshop on Semantic Computing and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Workshop on Semantic Computing and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSCA.2008.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

This research proposes a modified version of single pass algorithm which is specialized for text clustering. Encoding documents into numerical vectors for using the traditional version of single pass algorithm causes the two main problems: huge dimensionality and sparse distribution. Therefore, in order to address the two problems, this research modifies the single pass algorithm into its version where documents are encoded into not numerical vectors but alternative forms. In the proposed version, documents are mapped into tables and a similarity of two documents is computed by comparing their tables with each other. The goal of this research is to improve the performance of single pass algorithm for text clustering by modifying it into the specialized version.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于表的20个新闻组电子文档聚类单遍算法
本文针对文本聚类问题,提出了一种改进的单遍聚类算法。采用传统的单遍算法将文档编码为数值向量会导致两个主要问题:维数巨大和分布稀疏。因此,为了解决这两个问题,本研究将单遍算法修改为其版本,其中文档不是被编码为数字向量,而是被编码为替代形式。在建议的版本中,将文档映射到表中,并通过相互比较两个文档的表来计算两个文档的相似性。本研究的目的是通过将单遍算法修改为专用版本来提高文本聚类的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic Personalized Summarization Using Non-negative Matrix Factorization and Relevance Measure Semantic Web Service for Freight Management System Enhanced Search Method for Ontology Classification OntoSonomy: Ontology-Based Extension of Folksonomy Performance Evaluation of SVM in Image Segmentation
×
引用
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