.png){kind=icon}
Return
Permutation-invariant linear classifiers
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-024-06561-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Invariant concept classes form the backbone of classification algorithms immune to specific data transformations, ensuring consistent predictions regardless of these alterations. However, this robustness can come at the cost of limited access to the original sample information, potentially impacting generalization performance. This study introduces an addition to these classes-the permutation-invariant linear classifiers. Distinguished by their structural characteristics, permutation-invariant linear classifiers are unaffected by permutations on feature vectors, a property not guaranteed by other non-constant linear classifiers. The study characterizes this new concept class, highlighting its constant capacity, independent of input dimensionality. In practical assessments using linear support vector machines, the permutation-invariant classifiers exhibit superior performance in permutation experiments on artificial datasets and real mutation profiles. Interestingly, they outperform general linear classifiers not only in permutation experiments but also in permutation-free settings, surpassing unconstrained counterparts. Additionally, findings from real mutation profiles support the significance of tumor mutational burden as a biomarker.
Keywords:
Permutation invariance
Linear classifiers
Concept classes
Tumor mutational burden
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
Cited Papers
ShareSaveGenetic Factors of the Disease Course After Sepsis: Rare Deleterious Variants Are Predictive.png)
EBIOMEDICINE
OAAI
EBIOMEDICINEIF10.8
OAAIShareSaveShareSaveAnalysis of 100,000 human cancer genomes reveals the landscape of tumor mutational burdenGENOME MEDICINEOAAI
GENOME MEDICINEIF11.2
OAAIShareSaveShareSaveShareSaveShareSave
View more