Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Mieczyslaw A. Klopotek"'
Autor:
Mieczyslaw A. Klopotek
Publikováno v:
Fundamenta Informaticae. 172:361-377
We prove in this paper that the expected value of the objective function of the $k$-means++ algorithm for samples converges to population expected value. As $k$-means++, for samples, provides with constant factor approximation for $k$-means objective
Autor:
Mieczyslaw A. Klopotek
Publikováno v:
Knowledge and Information Systems. 62:1961-2009
The widely discussed and applied Johnson–Lindenstrauss (JL) Lemma has an existential form saying that for each set of data points Q in n-dimensional space, there exists a transformation f into an $$n'$$n′-dimensional space ($$n'n′
Autor:
Mieczyslaw A. Klopotek
Publikováno v:
Fundamenta Informaticae. 168:25-43
Publikováno v:
Advanced Data Mining and Applications ISBN: 9783030352301
ADMA
ADMA
In a former paper [10] we simplified the proof of a theorem on personalized random walk that is fundamental to graph nodes clustering and generalized it to bipartite graphs for a specific case where the probability of random jump was proportional to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b7524ec08a04c1876c5fe5922ae6f9d
https://doi.org/10.1007/978-3-030-35231-8_17
https://doi.org/10.1007/978-3-030-35231-8_17
Autor:
Mieczyslaw A. Klopotek
In this paper we would like to contest the results of Y. F. Wang, N. Karandikar and J. K. Aggarwal [ Pattern Recognition 24 , 1065–1085 (1991)] raising two fundamental claims. • • A line does not contribute anything to recognition of motion par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::acd42b207dc556338dc6434cde9d6b72
http://arxiv.org/abs/1704.05267
http://arxiv.org/abs/1704.05267
Autor:
Mieczyslaw A. Klopotek
Hidden variables are well known sources of disturbance when recovering belief networks from data based only on measurable variables. Hence models assuming existence of hidden variables are under development. This paper presents a new algorithm "accel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::241270184377c85e5b4996d528b0174e
Autor:
Mieczyslaw A. Klopotek
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319604374
ISMIS
ISMIS
This paper corrects the proof of the Theorem 2 from the Gower’s paper [1, p. 5]. The correction is needed in order to establish the existence of the kernel function used commonly in the kernel trick e.g. for k-means clustering algorithm, on the gro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f951199b9b6ed5203330a2e0b181a0b5
https://doi.org/10.1007/978-3-319-60438-1_10
https://doi.org/10.1007/978-3-319-60438-1_10
Publikováno v:
ENIC
We propose a new version of an algorithm based on Dirichlet boundary for community detection under the assumption of partially pre-labelled community members. We present a complete mathematical derivation of this method from the continuous Dirichlet
Publikováno v:
Studies in Computational Intelligence ISBN: 9783319187808
Challenges in Computational Statistics and Data Mining
Challenges in Computational Statistics and Data Mining
In this paper a novel notion of Bipartite PageRank is introduced and limits of authority flow in bipartite graphs are investigated. As a starting point we simplify the proof of a theorem on personalized random walk in unimodal graphs that is fundamen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29f52a391d2d1ac33705fd11bc92f3eb
https://doi.org/10.1007/978-3-319-18781-5_11
https://doi.org/10.1007/978-3-319-18781-5_11
Autor:
Dariusz Czerski, Krzysztof Ciesielski, Michał Dramiński, Mieczyslaw A. Klopotek, Slawomir T. Wierzchon
Publikováno v:
WI-IAT (2)
In this paper a reflection on the relationships among random-walk-with-back step, lazy walk and traditional Page Rank is made. It is demonstrated that though all of them differ semantically, they still can be computed using the very same algorithm.