SSC: Clustering Of Turkish Texts By Spectral Graph Partitioning

Authors : Taner UÇKAN, Cengiz HARK, Ali KARCİ

Pages : 1433-1444

Doi:10.2339/politeknik.684558

View : 38 | Download : 10

Publication Date : 2021-12-01

Article Type : Research Paper

Abstract :There is growing interest in studies on text classification as a result of the exponential increase in the amount of data available. Many studies have been conducted in the field of text clustering, using different approaches. This study introduces Spectral Sentence Clustering insert ignore into journalissuearticles values(SSC); for text clustering problems, which is an unsupervised method based on graph-partitioning. The study explains how the proposed model proposed can be used in natural language applications to successfully cluster texts. A spectral graph theory method is used to partition the graph into non-intersecting sub-graphs, and an unsupervised and efficient solution is offered for the text clustering problem by providing a physical representation of the texts. Finally, tests have been conducted demonstrating that SSC can be successfully used for text categorization. A clustering success rate of 97.08% was achieved in tests conducted using the TTC-3600 dataset, which contains open-access unstructured Turkish texts, classified into categories. The SSC model proposed performed better compared to a popular k-means clustering algorithm.
Keywords : Graph partitioning, spectral graph theory, binary text clustering, text categorization, text mining

ORIGINAL ARTICLE URL