• Home
  • Search
  • A Hybrid Algorithm for Web Document Clustering Based on Frequent Term Sets and k-Means
  • Cite Icon13
  • https://doi.org/10.1007/978-3-540-72909-9_20Copy DOI Icon

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

  • Jun 16, 2007
  • Le Wang +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In order to conquer the major challenges of current web document clustering, i.e. huge volume of documents, high dimensional process and understandability of the cluster, we propose a simple hybrid algorithm (SHDC) based on top-k frequent term sets and k-means. Top-k frequent term sets are used to produce k initial means, which are regarded as initial clusters and further refined by k-means. The final optimal clustering is returned by k-means while the understandable description of clustering is provided by k frequent term sets. Experimental results on two public datasets indicate that SHDC outperforms other two representative clustering algorithms (the farthest first k-means and random initial k-means) both on efficiency and effectiveness.

Similar Papers
  • Research Article
  • Citations24

Feature Extension for Short Text Categorization Using Frequent Term Sets

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

A Study on Text Clustering Algorithms Based on Frequent Term Sets

  • Jan 01, 2005
  • Xiangwei Liu +1
  • Conference Article
  • Citations8

The research of text clustering algorithms based on frequent term sets

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

Short Text Feature Extension Based on Improved Frequent Term Sets

  • Jan 01, 2016
  • Huifang Ma +4
  • Conference Article
  • Citations2

Study on frequent term set-based hierarchical clustering algorithm

  • Jul 01, 2011
  • Huiying Wang +1
  • Research Article
  • Citations55

A method of two-stage clustering learning based on improved DBSCAN and density peak algorithm

  • Jan 06, 2021
  • Computer Communications
  • Mingyang Li +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
  • Citations15

Feature Selection Algorithm Based on Association Rules

  • Feb 01, 2019
  • Journal of Physics: Conference Series
  • Yi Qu +2
  • Research Article
  • Citations13

An Optimized k-means Algorithm Based on Information Entropy

  • Jun 04, 2021
  • The Computer Journal
  • Meiling Liu +4
  • Research Article

The Roots of Old Chinese (review)

  • Dec 01, 2001
  • Language
  • Gonzalo Rubio
  • Research Article

Assimilation to /r/ in English initial consonant clusters

  • Jan 01, 2006
  • English Today
  • Herbert F W Stahlke
  • Conference Article
  • Citations3

Multi-factor Influenced Integrated Driving Behavior Clustering Analysis Evaluation Model

  • Aug 01, 2019
  • Shaojie Liu +2
  • Conference Article
  • Citations4

Symmetric Non-negative Matrix Factorization Based Link Partition Method for Overlapping Community Detection

  • Oct 01, 2015
  • Xiang Zhang +5
  • Book Chapter
  • Citations1

EStream: Online Mining of Frequent Sets with Precise Error Guarantee

  • Jan 01, 2006
  • Xuan Hong Dang +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.