Zobrazeno 1 - 10
of 15
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:
Lecture Notes in Computer Science ISBN: 9783030594909
ISMIS
ISMIS
Kleinberg introduced an axiomatic system for clustering functions. Out of three axioms, he proposed two (scale invariance and consistency) are concerned with data transformations that should produce the same clustering under the same clustering funct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a275608e85a6f5d9ea574dc97de942b
https://doi.org/10.1007/978-3-030-59491-6_33
https://doi.org/10.1007/978-3-030-59491-6_33
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
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
Publikováno v:
ENIC
In this paper scalable and parallelized method for cluster analysis based on random walks is presented. The aim of the algorithm introduced in this paper is to detect dense sub graphs (clusters) and sparse sub graphs (bridges) which are responsible f
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.
Publikováno v:
Journal of Intelligent Information Systems. 9:157-180
Valuation-Based System (VBS for short) can represent knowledge in different domains including probability theory, Dempster-Shafer theory and possibility theory. More recent studies show that the framework of VBS is also appropriate for representing a