A new model for the linear 1-dimensional online clustering problem

DOI10.1515/AUSI-2015-0001MaRDI QIDQ2254541zbMATH OpenOpenAlexFDO

Authors András London, Tamás Németh, Áron Pelyhe, Jozsef Nemeth

Publication date 5 February 2015

Published in Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/ausi-2015-0001

zbMATH Keywords

data clusteringlearning algorithmsonline algorithmsreal-time locating systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Recommendations

• An improved lower bound for one-dimensional online unit clustering
• On the online unit clustering problem
• On the Online Unit Clustering Problem
• An algorithm for online \(k\)-means clustering
• Online clustering on the line with square cost variable sized clusters
• A randomized algorithm for online unit clustering
• A Randomized Algorithm for Online Unit Clustering
• Online unit clustering in higher dimensions
• An Improved Algorithm for Online Unit Clustering
• An improved algorithm for online unit clustering

Cites work

• A Randomized Algorithm for Online Unit Clustering
• Dynamic TCP Acknowledgment: Penalizing Long Delays
• scientific article; zbMATH DE number 4033058 (Why is no real title available?)
• scientific article; zbMATH DE number 52589 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• On the Online Unit Clustering Problem
• On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
• On-line analysis of the TCP acknowledgment delay problem
• Online algorithms. The state of the art
• Online clustering on the line with square cost variable sized clusters
• Online clustering with variable sized clusters
• Online data clustering algorithms in an RTLS system
• Online facility location with facility movements
• Parameter learning algorithm for the online data acknowledgment problem

Cited in

(2)

• Online data clustering algorithms in an RTLS system
• An online 2-dimensional clustering problem with variable sized clusters

This page was built for publication: A new model for the linear 1-dimensional online clustering problem

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