Results 61 to 70 of about 18,390,026 (306)

RSKC: An R Package for a Robust and Sparse K-Means Clustering Algorithm

open access: yesJournal of Statistical Software, 2016
Witten and Tibshirani (2010) proposed an algorithim to simultaneously find clusters and select clustering variables, called sparse K-means (SK-means).
Yumi Kondo   +2 more
doaj   +1 more source

A Novel Active Noise Control Method Based on Variational Mode Decomposition and Gradient Boosting Decision Tree

open access: yesApplied Sciences, 2023
Diversified noise sources pose great challenges in the engineering of an ANC (active noise control) system design. To solve this problem, this paper proposes an ANC method based on VMD (variational mode decomposition) and Ensemble Learning.
Xiaobei Liang   +4 more
doaj   +1 more source

New bounds for $k$-means and information $k$-means

open access: yes, 2021
In this paper, we derive a new dimension-free non-asymptotic upper bound for the quadratic $k$-means excess risk related to the quantization of an i.i.d sample in a separable Hilbert space. We improve the bound of order $\mathcal{O} \bigl( k / \sqrt{n} \bigr)$ of Biau, Devroye and Lugosi, recovering the rate $\sqrt{k/n}$ that has already been proved by
Appert, Gautier, Catoni, Olivier
openaire   +2 more sources

PCA and K-Means decipher genome

open access: yes, 2008
In this paper, we aim to give a tutorial for undergraduate students studying statistical methods and/or bioinformatics. The students will learn how data visualization can help in genomic sequence analysis.
A Zinovyev   +8 more
core   +2 more sources

SimpleMKKM: Simple Multiple Kernel K-Means

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2022
We propose a simple yet effective multiple kernel clustering algorithm, termed simple multiple kernel k-means (SimpleMKKM). It extends the widely used supervised kernel alignment criterion to multi-kernel clustering.
Xinwang Liu
semanticscholar   +1 more source

Communication and Language Profiles of Children Treated for Posterior Fossa Brain Tumors

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Cognitive and language deficits are frequently reported sequelae of posterior fossa brain tumors (PFBT). Typically, delayed onset impedes prompt assessment and early intervention. This has devastating implications for quality of life.
Zara Sved   +4 more
wiley   +1 more source

Stressful Events Reported by Childhood Cancer Survivors and Community Controls From the St. Jude Lifetime (SJLIFE) Cohort: A Mixed Method Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Characterizing stressful events reported by childhood cancer survivors experienced throughout the lifespan may help improve trauma‐informed care relevant to the survivor experience. Methods Participants included 2552 survivors (54% female; 34 years of age) and 469 community controls (62% female; 33 years of age) from the St.
Megan E. Ware   +13 more
wiley   +1 more source

Efficient High-Dimensional Kernel k-Means++ with Random Projection

open access: yesApplied Sciences, 2021
Using random projection, a method to speed up both kernel k-means and centroid initialization with k-means++ is proposed. We approximate the kernel matrix and distances in a lower-dimensional space Rd before the kernel k-means clustering motivated by ...
Jan Y. K. Chan, Alex Po Leung, Yunbo Xie
doaj   +1 more source

Online k-means Clustering

open access: yes, 2019
We study the problem of online clustering where a clustering algorithm has to assign a new point that arrives to one of $k$ clusters. The specific formulation we use is the $k$-means objective: At each time step the algorithm has to maintain a set of k candidate centers and the loss incurred is the squared distance between the new point and the closest
Cohen-Addad, Vincent   +3 more
openaire   +3 more sources

Improved Coresets for Euclidean k-Means

open access: yesNeural Information Processing Systems, 2022
Given a set of n points in d dimensions, the Euclidean k -means problem (resp. the Euclidean k -median problem) consists of finding k centers such that the sum of squared distances (resp.
Vincent Cohen-Addad   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy