Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  embedding theorem
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
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.
EN
Many authors studied families XG of complex valued functions, which are holomorphic in bounded complete n-circular domains G⊂Cn and fulfill some geometric conditions. The above functions were applied later to research families of locally biholomorphic mappings in Cn. In this paper we consider a problem of inclusions between a few of such families XG and families MKG, k=2, 3, …, which are defined by applying a function decomposition with respect to the group of kth roots of unity.
3
Content available remote En embedding theorem for unbounded convex sets in a Banach space
EN
Let V be a closed convex cone and Cv be a space of nonempty closed convex subsets of a Banach space such that their Hausdorff distance form the cone V is finite. In this paper we embed the space Cv isometrically and isomorphically into a Banach space.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.