Zobrazeno 1 - 5
of 5
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:
Fundamenta Informaticae. 168:25-43
Publikováno v:
Fundamenta Informaticae. 139:229-248
Latency of user-based and item-based recommenders is evaluated. The two algorithms can deliver high quality predictions in dynamically changing environments. However, their response time depends not only on the size, but also on the structure of unde
Autor:
Mieczyslaw A. Klopotek
This paper investigates the application of consensus clustering and meta-clustering to the set of all possible partitions of a data set. We show that when using a "complement" of Rand Index as a measure of cluster similarity, the total-separation par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::772c2207d9b005d2228d704215629928
Publikováno v:
Fundamenta Informaticae. 30:359-371
In the literature, the optimization problem to identify a set of composite hypotheses H, which will yield the k largest P(H|S e) where a composite hypothesis is an instantiation of all the nodes in the network except the evidence nodes [17] is of sig