Skip to Main content Skip to Navigation
Conference papers

Online Cluster Approximation via Inequality

Abstract : Given an example-feature set, representing the information context present in a dataset, is it possible to reconstruct the information context in the form of clusters to a certain degree of compromise, if the examples are processed randomly without repetition in a sequential online manner? A general transductive inductive learning strategy which uses constraint based multivariate Chebyshev inequality is proposed. Theoretical convergence in the reconstruction error to a finite value with increasing number of (a) processed examples and (b) generated clusters, respectively, is shown. Upper bounds for these error rates are also proved. Nonparametric estimates of these error from a sample of random sequences of example set, empirically point to a stable number of clusters.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Tuesday, May 16, 2017 - 9:16:46 AM
Last modification on : Thursday, March 5, 2020 - 5:41:42 PM
Long-term archiving on: : Friday, August 18, 2017 - 12:29:39 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Shriprakash Sinha. Online Cluster Approximation via Inequality. 8th International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2012, Halkidiki, Greece. pp.176-181, ⟨10.1007/978-3-642-33412-2_18⟩. ⟨hal-01523048⟩



Record views


Files downloads