• Home
  • Search
  • Study on frequent term set-based hierarchical clustering algorithm
  • Cite Icon2
  • https://doi.org/10.1109/fskd.2011.6019686Copy DOI Icon

Study on frequent term set-based hierarchical clustering algorithm

  • Jul 1, 2011
  • Huiying Wang +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper, we present a text-clustering algorithm of Frequent Term Set-based Clustering (FTSC), which uses frequent term sets for texts clustering. This algorithm can reduce the dimensionality of the text data efficiently, thus it can improve accurate rate and running speed of the clustering algorithm. The results of clustering texts by the FTSC algorithm cannot reflect the overlap of texts' classes. Based on the FTSC algorithm, its improved algorithm-Frequent Term Set-based Hierarchical Clustering algorithm (FTSHC) is given. This algorithm can determine the overlap of texts' classes by the overlap of frequent words sets, and provide an understandable description of the discovered clusters by the frequent terms sets. The experiment results prove that FTSC and FTSHC algorithms are more efficient than K-Means algorithm in the performance of clustering.

Similar Papers
  • Conference Article
  • Citations8

The research of text clustering algorithms based on frequent term sets

  • Jan 01, 2005
  • Xiang-Wei Liu +2
  • Book Chapter
  • Citations14

A Study on Text Clustering Algorithms Based on Frequent Term Sets

  • Jan 01, 2005
  • Xiangwei Liu +1
  • Book Chapter
  • Citations3

Short Text Feature Extension Based on Improved Frequent Term Sets

  • Jan 01, 2016
  • Huifang Ma +4
  • Research Article
  • Citations24

Feature Extension for Short Text Categorization Using Frequent Term Sets

  • Jan 01, 2014
  • Procedia Computer Science
  • Yuan Man
  • Book Chapter
  • Citations13

A Hybrid Algorithm for Web Document Clustering Based on Frequent Term Sets and k-Means

  • Jun 16, 2007
  • Le Wang +3
  • Book Chapter
  • Citations5

An Integrated Approach and Framework for Document Clustering Using Graph Based Association Rule Mining

  • Jan 01, 2014
  • D S Rajput +2
  • Research Article
  • Citations145

Multi-Instance Learning Based Web Mining

  • Mar 01, 2005
  • Applied Intelligence
  • Zhi-Hua Zhou +2
  • Research Article
  • Citations10

NDPD: an improved initial centroid method of partitional clustering for big data mining

  • Aug 23, 2022
  • Journal of Advances in Management Research
  • Kamlesh Kumar Pandey +1
  • PDF
  • Research Article
  • Citations45

Topic Modeling Technique for Text Mining Over Biomedical Text Corpora Through Hybrid Inverse Documents Frequency and Fuzzy K-Means Clustering

  • Jan 01, 2019
  • IEEE Access
  • Junaid Rashid +6
  • Book Chapter
  • Citations16

Term Frequency by Inverse Document Frequency

  • Aug 29, 2011
  • SpringerReference
  • Utkarsh Sharma +2
  • Conference Article

A Boltzmann theory based dynamic agglomerative hierarchical clustering

  • Dec 01, 2009
  • Gang Li +3
  • Conference Article
  • Citations58

K-means clustering versus validation measures

  • Aug 20, 2006
  • Hui Xiong +2
  • Research Article

Comparison of Clustering Algorithms on Air Quality Substances in Peninsular Malaysia

  • Jan 26, 2018
  • Journal of Computing Research and Innovation
  • Sitti Sufiah Atirah Rosly +2
  • Research Article
  • Citations16

Unsupervised text feature selection approach based on improved Prairie dog algorithm for the text clustering

  • Jan 01, 2025
  • Jordanian Journal of Informatics and Computing
  • Mohammad Alshinwan +3
  • Conference Article
  • Citations3

Text Retrieval analysis based on Deep Learning

  • Jan 01, 2015
  • Kai Liu +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.