arXiv:1805.10206
공식 코드 · Papers with Code
On the Estimation of Entropy in the FastICA Algorithm
원문 초록
The fastICA method is a popular dimension reduction technique used to reveal patterns in data. Here we show both theoretically and in practice that the approximations used in fastICA can result in patterns not being successfully recognised. We demonstrate this problem using a two-dimensional example where a clear structure is immediately visible to the naked eye, but where the projection chosen by fastICA fails to reveal this structure. This implies that care is needed when applying fastICA. We discuss how the problem arises and how it is intrinsically connected to the approximations that form the basis of the computational efficiency of fastICA.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lightweight Model for Poultry Disease Detection from Fecal Images Using Multi-Color Space Feature Optimization and Machine Learning
Efficient Malware Detection with Optimized Learning on High-Dimensional Features
Hard Negative Mining for Domain-Specific Retrieval in Enterprise Systems
From Roots to Rewards: Dynamic Tree Reasoning with RL
DCR: Quantifying Data Contamination in LLMs Evaluation
U-RWKV: Lightweight medical image segmentation with direction-adaptive RWKV
토론
이 논문과 연결된 포럼 글이 아직 없습니다.