Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Denisiuk, Aleksandera; * | Grabowski, Michałb
Affiliations: [a] University of Warmia and Mazury in Olsztyn and Faculty of Mathematics and Computer Science, Poland. [email protected] | [b] Warsaw School of Computer Science, Poland. [email protected]
Correspondence: [*] Address for correspondence: University of Warmia and Mazury in Olsztyn Poland.
Abstract: In this article we propose a new clustering algorithm for combinations of continuous and nominal data. The proposed algorithm is based on embedding of the nominal data into the unit sphere with a quadrance metrics, and adaptation of the general k-means clustering algorithm for the embedding data. It is also shown that the distortion of new embedding with respect to the Hamming metrics is less than that of other considered possibilities. A series of numerical experiments on real and synthetic datasets show that the proposed algorithm provide a comparable alternative to other clustering algorithms for combinations of continuous and nominal data.
DOI: 10.3233/FI-2017-1538
Journal: Fundamenta Informaticae, vol. 153, no. 3, pp. 221-233, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]