Efficient streaming text clustering

DOI10.1016/J.NEUNET.2005.06.008zbMATH Open1077.68814OpenAlexW2014615172WikidataQ51376433 ScholiaQ51376433MaRDI QIDQ2568028FDOQ2568028

Authors: Shi Zhong 

Publication date: 7 October 2005

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2005.06.008

Recommendations

• Optimal algorithm of data streams clustering on sliding window model
• scientific article; zbMATH DE number 1901216
• Algorithms for clustering clickstream data
• scientific article; zbMATH DE number 6874937
• StreamKM++: a clustering algorithm for data streams

zbMATH Keywords

competitive learningtext clusteringspherical \(k\)-meansstreaming clustering

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• 10.1162/153244303321897735
• Empirical and theoretical comparisons of selected criterion functions for document clustering
• Concept decompositions for large sparse text data using clustering
• 10.1162/1532443041827943

Cited In (6)

• Title not available (Why is that?)
• Dynamic clustering forest: an ensemble framework to efficiently classify textual data stream with concept drift
• Title not available (Why is that?)
• Streaming data clustering using cooperative particle swarm optimization
• Streaming Embeddings with Slack
• Optimal algorithm of data streams clustering on sliding window model

Uses Software

• Bow

This page was built for publication: Efficient streaming text clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568028)