Online Cluster Approximation via Inequality - Artificial Intelligence Applications and Innovations - Part II (AIAI 2012) Access content directly
Conference Papers Year : 2012

Online Cluster Approximation via Inequality

Shriprakash Sinha
  • Function : Author
  • PersonId : 1008233


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.
Fichier principal
Vignette du fichier
978-3-642-33412-2_18_Chapter.pdf (360.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01523048 , version 1 (16-05-2017)





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⟩
72 View
36 Download



Gmail Facebook Twitter LinkedIn More