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.
Chapter PDF
Similar content being viewed by others
Keywords
- Reconstruction Error
- Chebyshev Inequality
- Conformal Prediction
- Transductive Learning
- IEEE Signal Processing Society
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Vovk, V., Gammerman, A., Shafer, G.: Algorithmic learning in a random world. Springer (2005)
Shafer, G., Vovk, V.: A tutorial on conformal prediction. The Journal of Machine Learning Research 9, 371–421 (2008)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient-means clustering algorithm: Analysis and implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 881–892 (2002)
Sinha, S., Horst, G.: Bounded multivariate surfaces on monovariate internal functions. In: IEEE International Conference on Image Processing, pp. 1037–1040. IEEE Signal Processing Society (2011)
Berge, P.O.: A note on a form of tchebycheff’s theorem for two variables. Biometrika 29(3-4), 405 (1938)
Monhor, D., Takemoto, S.: Understanding the concept of outlier and its relevance to the assessment of data quality: Probabilistic background theory. Earth, Planets, and Space 57(11), 1009–1018 (2005)
Chen, X.: A new generalization of chebyshev inequality for random vectors. arXiv:math.ST, 0707(0805v1), 1–5 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Sinha, S. (2012). Online Cluster Approximation via Inequality. In: Iliadis, L., Maglogiannis, I., Papadopoulos, H., Karatzas, K., Sioutas, S. (eds) Artificial Intelligence Applications and Innovations. AIAI 2012. IFIP Advances in Information and Communication Technology, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33412-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-33412-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33411-5
Online ISBN: 978-3-642-33412-2
eBook Packages: Computer ScienceComputer Science (R0)