Results 21 to 30 of about 1,834,948 (246)
On $k$-means for segments and polylines
18 pages, 3 ...
Cabello, S., Giannopoulos, P.
openaire +5 more sources
High-Performance Lightweight Fall Detection with an Improved YOLOv5s Algorithm
The aging population has drastically increased in the past two decades, stimulating the development of devices for healthcare and medical purposes. As one of the leading potential risks, the injuries caused by accidental falls at home are hazardous to ...
Yuanpeng Wang +4 more
doaj +1 more source
The development of a GIS for New Deal Archaeology
I have recently launched an effort to create a GIS of all New Deal-funded archaeological investigations conducted in the 48 states that comprised the USA during the Great Depression (Means 2011).
Bernard K. Means
doaj +1 more source
Two new initialization methods for K-means clustering are proposed. Both proposals are based on applying a divide-and-conquer approach for the K-means‖ type of an initialization strategy. The second proposal also uses multiple lower-dimensional subspaces
Joonas Hämäläinen +2 more
doaj +1 more source
$k$-means clustering of extremes [PDF]
The $k$-means clustering algorithm and its variant, the spherical $k$-means clustering, are among the most important and popular methods in unsupervised learning and pattern detection. In this paper, we explore how the spherical $k$-means algorithm can be applied in the analysis of only the extremal observations from a data set.
Janßen, Anja, Wan, Phyllis
openaire +5 more sources
Over half a century old and showing no signs of aging, k -means remains one of the most popular data processing algorithms. As is well-known, a proper initialization of k -means is crucial for obtaining a good final solution.
Bahman Bahmani +4 more
openaire +2 more sources
Leibniz International Proceedings in Informatics (LIPIcs ...
Grunau, Christoph +2 more
openaire +4 more sources
New Deal archaeology survey and excavation projects across the lower 48 states exhibit considerable geographic variation in their nature and extent. Part of this variation can be linked to strong regional personalities, while other variation depended on ...
Bernard K. Means
doaj +1 more source
Optimized Cartesian K-Means [PDF]
Product quantization-based approaches are effective to encode high-dimensional data points for approximate nearest neighbor search. The space is decomposed into a Cartesian product of low-dimensional subspaces, each of which generates a sub codebook. Data points are encoded as compact binary codes using these sub codebooks, and the distance between two
Jianfeng Wang +5 more
openaire +5 more sources
K-means** - a fast and efficient K-means algorithms
K-means often converges to a local optimum. In improved versions of K-means, k-means++ is well-known for achieving a rather optimum solution with its cluster initialisation strategy and high computational efficiency. Incremental K-means is recognised for its converging to the empirically global optimum but having a high complexity due to its stepping ...
Cuong Duc Nguyen, Trong Hai Duong
openaire +1 more source

