Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity

Geweniger T, Schleif F-M, Hasenfuss A, Hammer B, Villmann T (2008)
In: ICONIP 2008. Köppen M, Kasabov NK, Coghill GG (Eds);Berlin, Heidelberg: Springer: 61-69.

Conference Paper | Published | English

No fulltext has been uploaded

Author
; ; ; ;
Editor
Köppen, Mario ; Kasabov, Nikola K. ; Coghill, George G.
Publishing Year
Conference
ICONIP 2008
PUB-ID

Cite this

Geweniger T, Schleif F-M, Hasenfuss A, Hammer B, Villmann T. Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity. In: Köppen M, Kasabov NK, Coghill GG, eds. ICONIP 2008. Berlin, Heidelberg: Springer; 2008: 61-69.
Geweniger, T., Schleif, F. - M., Hasenfuss, A., Hammer, B., & Villmann, T. (2008). Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity. In M. Köppen, N. K. Kasabov, & G. G. Coghill (Eds.), ICONIP 2008 (pp. 61-69). Berlin, Heidelberg: Springer.
Geweniger, T., Schleif, F. - M., Hasenfuss, A., Hammer, B., and Villmann, T. (2008). “Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity” in ICONIP 2008, ed. M. Köppen, N. K. Kasabov, and G. G. Coghill (Berlin, Heidelberg: Springer), 61-69.
Geweniger, T., et al., 2008. Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity. In M. Köppen, N. K. Kasabov, & G. G. Coghill, eds. ICONIP 2008. Berlin, Heidelberg: Springer, pp. 61-69.
T. Geweniger, et al., “Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity”, ICONIP 2008, M. Köppen, N.K. Kasabov, and G.G. Coghill, eds., Berlin, Heidelberg: Springer, 2008, pp.61-69.
Geweniger, T., Schleif, F.-M., Hasenfuss, A., Hammer, B., Villmann, T.: Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity. In: Köppen, M., Kasabov, N.K., and Coghill, G.G. (eds.) ICONIP 2008. p. 61-69. Springer, Berlin, Heidelberg (2008).
Geweniger, T., Schleif, Frank-Michael, Hasenfuss, A., Hammer, Barbara, and Villmann, T. “Comparison of cluster algorithms for the analysis of text data using Kolmogorov complexity”. ICONIP 2008. Ed. Mario Köppen, Nikola K. Kasabov, and George G. Coghill. Berlin, Heidelberg: Springer, 2008. 61-69.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar