Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Mieczysław Kłopotek"'
Publikováno v:
TASK Quarterly, Vol 25, Iss 3 (2021)
This paper investigates the relationship between various types of spectral clustering methods and their kinship to relaxed versions of graph cut methods. This predominantly analytical study exploits the closed (or nearly closed) form of eigenvalues a
Externí odkaz:
https://doaj.org/article/005e8302ab2b4fd8a9c9fadef39a3026
Publikováno v:
Annals of computer science and information systems, Vol 8, Pp 533-540 (2016)
Externí odkaz:
https://doaj.org/article/1c64734ab0bc4ba299f8e868abe90a35
Publikováno v:
Machine Learning.
This paper performs an investigation of Kleinberg’s axioms (from both an intuitive and formal standpoint) as they relate to the well-known k-mean clustering method. The axioms, as well as a novel variations thereof, are analyzed in Euclidean space.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9156ae9cbfbf0a8bafdfaa1259742564
https://doi.org/10.1007/s10994-023-06308-x
https://doi.org/10.1007/s10994-023-06308-x
Development of new algorithms in the area of machine learning, especially clustering, comparative studies of such algorithms as well as testing according to software engineering principles requires availability of labeled data sets. While standard be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1d24443409ffc611fbd9e7299b599bf4
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031165634
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f637c794cd2ef232be43c26ce318f50a
https://doi.org/10.1007/978-3-031-16564-1_25
https://doi.org/10.1007/978-3-031-16564-1_25
Autor:
Mieczysław Kłopotek
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031165634
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c581236ed8943472b47576816149891d
https://doi.org/10.1007/978-3-031-16564-1_30
https://doi.org/10.1007/978-3-031-16564-1_30
This book provides the reader with a basic understanding of the formal concepts of the cluster, clustering, partition, cluster analysis etc. The book explains feature-based, graph-based and spectral clustering methods and discusses their formal simi
In this chapter, scalable and parallelized method for cluster analysis based on random walks is presented. The aim of the algorithm introduced in this chapter is to detect dense sub graphs (clusters) and sparse sub graphs (bridges) which are responsi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2da894edf98845f1dce055c22cb0c53
https://doi.org/10.4018/978-1-5225-2814-2.ch014
https://doi.org/10.4018/978-1-5225-2814-2.ch014
This volume contains articles accepted for presentation during The Intelligent Information Systems Symposium I1S'2000 which was held in Bystra, Poland, on June 12-16, 2000. This is ninth, in the order, symposium organized by the Institute of Computer