Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Mieczyslaw A. Klopotek"'
Publikováno v:
Computer Information Systems and Industrial Management ISBN: 9783030476786
CISIM
CISIM
The paper investigates several notions of graph Laplacians and graph kernels from the perspective of understanding the graph clustering via the graph embedding into an Euclidean space. We propose hereby a unified view of spectral graph clustering and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b23f7745ad3297ef01437caa3f0e520
https://doi.org/10.1007/978-3-030-47679-3_40
https://doi.org/10.1007/978-3-030-47679-3_40
Publikováno v:
IFIP Advances in Information and Communication Technology ISBN: 9783030491604
AIAI (1)
AIAI (1)
We present a novel justification why k-means clusters should be (hyper)ball-shaped ones. We show that the clusters must be ball-shaped to attain motion-consistency. If clusters are ball-shaped, one can derive conditions under which two clusters attai
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d825b5e5c328b68f7acc13a9112f10ce
https://doi.org/10.1007/978-3-030-49161-1_10
https://doi.org/10.1007/978-3-030-49161-1_10
Publikováno v:
Machine Learning, Optimization, and Data Science ISBN: 9783030375980
LOD
LOD
With Kleinberg’s axiomatic system for clustering, a discussion has been initiated, what kind of properties clustering algorithms should have and have not. As Ackerman et al. pointed out, the static properties studied by Kleinberg and other are not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b312a5fbc4e7686c88594906cbb8a96
https://doi.org/10.1007/978-3-030-37599-7_22
https://doi.org/10.1007/978-3-030-37599-7_22
Publikováno v:
Studies in Big Data ISBN: 9783319693071
While Chap. 2 presented the broadness of the spectrum of clustering methods, this chapter focusses on clustering of objects that are embedded in some metric space and gives an insight into the potential variations of clustering algorithms driven by p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d2905e7d5eb7d51a1159acb56a4a8c3
https://doi.org/10.1007/978-3-319-69308-8_3
https://doi.org/10.1007/978-3-319-69308-8_3
Autor:
Mieczyslaw A. Klopotek
We define the notion of a well-clusterable data set combining the point of view of the objective of $k$-means clustering algorithm (minimising the centric spread of data elements) and common sense (clusters shall be separated by gaps). We identify co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::288fe38bb79237de83897cd726a29bcb
http://arxiv.org/abs/1704.07139
http://arxiv.org/abs/1704.07139
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
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