惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

T
Tailwind CSS Blog
MyScale Blog
MyScale Blog
博客园 - Franky
酷 壳 – CoolShell
酷 壳 – CoolShell
WordPress大学
WordPress大学
有赞技术团队
有赞技术团队
雷峰网
雷峰网
罗磊的独立博客
小众软件
小众软件
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
V
V2EX
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The Cloudflare Blog
Hugging Face - Blog
Hugging Face - Blog
博客园 - 【当耐特】
博客园 - 司徒正美
Last Week in AI
Last Week in AI
月光博客
月光博客
阮一峰的网络日志
阮一峰的网络日志
美团技术团队
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
量子位
宝玉的分享
宝玉的分享

eess.SP updates on arXiv.org

ECG-biometrics-bench: A Unified Framework for Reproducible Benchmarking of ECG Biometrics Physiology-Aware Masked Cross-Modal Reconstruction for Biosignal Representation Learning Towards Improving Speaker Distance Estimation through Generative Impulse Response Augmentation Federated Learning with Hypergradient-based Online Update of Aggregation Weights Soft Graph Diffusion Transformer for MIMO Detection SPLICE: Latent Diffusion over JEPA Embeddings for Conformal Time-Series Inpainting Sequential Inference for Gaussian Processes: A Signal Processing Perspective Statistical Channel Fingerprint Construction for Massive MIMO: A Unified Tensor Learning Framework Recent Advances in mm-Wave and Sub-THz/THz Oscillators for FutureG Technologies Cross-Subject Generalization for EEG Decoding: A Survey of Deep Learning Methods Super-resolution Multi-signal Direction-of-Arrival Estimation by Hankel-structured Sensing and Decomposition Hankel and Toeplitz Rank-1 Decomposition of Arbitrary Matrices with Applications to Signal Direction-of-Arrival Estimation Adaptive Transform Coding for Semantic Compression EdgeSpike: Spiking Neural Networks for Low-Power Autonomous Sensing in Edge IoT Architectures Sparse Graph Learning from Sparse Data via Fiedler Number Maximization A Deep Learning Model for Battery State Prediction towards Intelligent Energy Management Transfer Learning for Tonal Noise Prediction in VRF Units Using Thermodynamic and Vibration Signals EVT-Based Generative AI for Tail-Aware Channel Estimation Monitoring exposure-length variations in submarine power cables using distributed fiber-optic sensing BandRouteNet: An Adaptive Band Routing Neural Network for EEG Artifact Removal Phase-Separated Complex Hilbert PCA on Markerless 3D Pose Estimation Data: A Global Phase Network and Its Extension to a Continuous Field on the Body Surface Selective Correlation Based Knowledge Distillation for Ground Reaction Force Estimation Deep Learning-Enabled Dissolved Oxygen Sensing in Biofouling Environments for Ocean Monitoring Speech Enhancement Based on Drifting Models Robust and Clinically Reliable EEG Biomarkers: A Cross Population Framework for Generalizable Parkinson's Disease Detection An AI-Based Supervisory Measurement Integrity Validation Layer for Cyber-Resilient AC/DC Protection in Inverter-Based Microgrids Explainable AI in Speaker Recognition -- Making Latent Representations Understandable Time-Localized Parametric Decomposition of Respiratory Airflow for Sub-Breath Analysis NAKUL-Med: Spectral-Graph State Space Models with Dynamics Kernels for Medical Signals An Algorithm for On-Sensor Agnostic Detection of Changes in Human Activity for Ultra-Low-Power Applications
Wireless Federated $k$-Means Clustering with Non-coherent...
Alphan Sahin · 2023-08-12 · via eess.SP updates on arXiv.org

In this study, we propose using an over-the-air computation (OAC) scheme for the federated k-means clustering algorithm to reduce the per-round communication latency when it is implemented over a wireless network. The OAC scheme relies on an encoder exploiting the representation of a number in a balanced number system and computes the sum of the updates for the federated k-means via signal superposition property of wireless multiple-access channels non-coherently to eliminate the need for precise phase and time synchronization. Also, a reinitialization method for ineffectively used centroids is proposed to improve the performance of the proposed method for heterogeneous data distribution. For a customer-location clustering scenario, we demonstrate the performance of the proposed algorithm and compare it with the standard k-means clustering. Our results show that the proposed approach performs similarly to the standard k-means while reducing communication latency.