An Approach to Clustering of Text Documents Using Graph Mining Techniques

Author:

Rao Bapuji1,Mishra Brojo Kishore2ORCID

Affiliation:

1. BPUT, Rourkela, India

2. Department of Information Technology, C. V. Raman College of Engineering, Bhubaneswar, India

Abstract

This paper introduces a new approach of clustering of text documents based on a set of words using graph mining techniques. The proposed approach clusters (groups) those text documents having searched successfully for the given set of words from a set of given text documents. The document-word relation can be represented as a bi-partite graph. All the clustering of text documents is represented as sub-graphs. Further, the paper proposes an algorithm for clustering of text documents for a given set of words. It is an automated system and requires minimal human interaction for the clustering of text documents. The algorithm has been implemented using C++ programming language and observed satisfactory results.

Publisher

IGI Global

Subject

General Medicine

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

1. Evolutionary Local Search Algorithm for the biclustering of gene expression data based on biological knowledge;Applied Soft Computing;2021-06

2. N-Clustering of Text Documents Using Graph Mining Techniques;Encyclopedia of Information Science and Technology, Fifth Edition;2021

3. A Novel History-driven Artificial Bee Colony Algorithm for Data Clustering;Applied Soft Computing;2018-10

4. An Optimal Data Placement Strategy for Improving System Performance of Massive Data Applications Using Graph Clustering;International Journal of Ambient Computing and Intelligence;2018-07

5. Social Structure Discovery Using Genetic Algorithm;International Journal of Applied Metaheuristic Computing;2017-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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