Metraipolis › archive › dc_d3ecde2c6975

Unsupervised Feature Selection Using Local Intrinsic Dimensionality -- Extended Version — arXiv:2610.40736

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40736
License (as archived)
CC0-1.0
Archived
2026-11-03T05:40:29.212Z
SHA-256 of the archived text
c9653228f95e81016ecd727818a45cf94d62414e2d60a9286f10420e69689210
Stable URL of this page
https://metraipolis.com/documento/dc_d3ecde2c6975

How to cite

Unsupervised Feature Selection Using Local Intrinsic Dimensionality -- Extended Version — arXiv:2610.40736 — arXiv (en), https://arxiv.org/abs/2610.40736 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d3ecde2c6975 (Metraipolis archive dc_d3ecde2c6975, sha256 c9653228f95e81016ecd727818a45cf94d62414e2d60a9286f10420e69689210)
BibTeX
@misc{dcd3ecde2c6975,
  title = {Unsupervised Feature Selection Using Local Intrinsic Dimensionality -- Extended Version — arXiv:2610.40736},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40736},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d3ecde2c6975; sha256 c9653228f95e81016ecd727818a45cf94d62414e2d60a9286f10420e69689210},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40736. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

High dimensionality degrades both the efficiency and the effectiveness of learning algorithms, and in many applications no class labels are available to guide dimensionality reduction. This paper proposes LIDFS, an unsupervised feature selection method based on Local Intrinsic Dimensionality (LID). The method builds on the formal equivalence between LID and the indiscriminability of distance measures. The data matrix is transposed so that each feature is treated as a point, and the LID of each feature is estimated by maximum likelihood from the distances to its $k$ nearest neighboring features. Features with lower LID exhibit greater local discriminability and receive higher importance scores. A refinement step then retains one representative per feature neighborhood and demotes locally redundant features. The result is a complete ranking from which any number of features can be selected without rerunning the procedure. LIDFS does not use any information about labels or the number of classes, and runs in $\mathcal{O}(d^2 n)$ time for $n$ instances and $d$ features. LIDFS is compared with classic and state-of-the-art methods and a random baseline on 23 high-dimensional datasets, the classic benchmark collection. The evaluation uses classification accuracy and AUC with five downstream classifiers, as well as clustering accuracy and normalized mutual information, over both full and aggressive selection ranges. LIDFS ranks first in the supervised evaluations and first or tied second in the clustering-based evaluations. It belongs to the top statistical group together with methods that require the number of classes, and it runs faster than its closest competitor. Several recent methods, by contrast, fail to outperform the random baseline. A sensitivity analysis shows that small neighborhood sizes yield the best results.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.40736 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:25:42.932Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).