1. Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7–9, 2007, pp. 1027–1035, 2007
2. Lecture Notes in Computer Science;H Bay,2006
3. Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inf. Syst. 16(4), 387–400 (1991)
4. Burrows, M. and Wheeler, D.J.: A block sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, SRC-RR-124:1–18 (1994)
5. Lecture Notes in Computer Science;M Calonder,2010