Algorithms for clustering clickstream data

DOI10.1016/J.IPL.2008.12.011zbMATH Open1191.68234OpenAlexW2138332801MaRDI QIDQ976126FDOQ976126

Authors: Panagiotis Antonellis, Christos Makris, Nikos Tsirakis 

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.011

Recommendations

• Model-based biclustering of clickstream data
• Data stream clustering
• Arbitrary shape cluster algorithm for clustering data stream
• Optimal algorithm of data streams clustering on sliding window model
• CLUSTERING WEB VISITORS BY BAST, ROBUST AND CONVERGENT ALGORITHMS

zbMATH Keywords

data miningdatabasesclustering algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Database theory (68P15)

Cites Work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)

Cited In (6)

• Online data clustering algorithms in an RTLS system
• Model-based biclustering of clickstream data
• An EM-based algorithm for web mining massive data sets
• Efficient streaming text clustering
• Title not available (Why is that?)
• Collaborative clustering of XML documents

Uses Software

• AS 136

This page was built for publication: Algorithms for clustering clickstream data

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