A novel self‐organising clustering model for time‐event documents

Author:

Hung Chihli,Wermter Stefan

Abstract

PurposeThe purpose of this paper is to examine neural document clustering techniques, e.g. self‐organising map (SOM) or growing neural gas (GNG), usually assume that textual information is stationary on the quantity.Design/methodology/approachThe authors propose a novel dynamic adaptive self‐organising hybrid (DASH) model, which adapts to time‐event news collections not only to the neural topological structure but also to its main parameters in a non‐stationary environment. Based on features of a time‐event news collection in a non‐stationary environment, they review the main current neural clustering models. The main deficiency is a need of pre‐definition of the thresholds of unit‐growing and unit‐pruning. Thus, the dynamic adaptive self‐organising hybrid (DASH) model is designed for a non‐stationary environment.FindingsThe paper compares DASH with SOM and GNG based on an artificial jumping corner data set and a real world Reuters news collection. According to the experimental results, the DASH model is more effective than SOM and GNG for time‐event document clustering.Practical implicationsA real world environment is dynamic. This paper provides an approach to present news clustering in a non‐stationary environment.Originality/valueText clustering in a non‐stationary environment is a novel concept. The paper demonstrates DASH, which can deal with a real world data set in a non‐stationary environment.

Publisher

Emerald

Subject

Library and Information Sciences,Computer Science Applications

Reference25 articles.

1. Ahrns, I., Bruske, J. and Sommer, G. (1995), “On‐line learning with dynamic cell structures”, Proceedings of ICANN‐95, the International Conference on Artificial Neural Networks, pp. 141‐6.

2. Blackmore, J. and Miikkulainen, R. (1993), “Incremental grid growing: encoding high‐dimensional structure into a two‐dimensional feature map”, Proceedings of the IEEE International Conference on Neural Networks (ICNN'93).

3. Chakrabarti, S. (2000), “Data mining for hypertext: a tutorial survey”, ACM Special Interest Group on Knowledge Discovery and Data Mining (SIGKDD) Explorations, Vol. 1 No. 2, pp. 1‐11.

4. Chang, C.‐C. and Chen, R.‐S. (2006), “Using data mining technology to solve classification problems – a case study of campus digital library”, The Electronic Library, Vol. 24 No. 3, pp. 307‐21.

5. Chen, A.‐P. and Chen, C.‐C. (2006), “A new efficient approach for data clustering in electronic library using ant colony clustering algorithm”, The Electronic Library, Vol. 24 No. 4, pp. 548‐59.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3