Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2312.01991

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2312.01991 (cs)
[Submitted on 4 Dec 2023 (v1) , last revised 10 Jul 2025 (this version, v4)]

Title: Shapley-Based Data Valuation with Mutual Information: A Key to Modified K-Nearest Neighbors

Title: 基于Shapley值的数据价值评估:互信息在改进的K-最近邻中的关键作用

Authors:Mohammad Ali Vahedifar, Azim Akhtarshenas, Mohammad Mohammadi Rafatpanah, Maryam Sabbaghian
Abstract: The K-Nearest Neighbors (KNN) algorithm is widely used for classification and regression; however, it suffers from limitations, including the equal treatment of all samples. We propose Information-Modified KNN (IM-KNN), a novel approach that leverages Mutual Information ($I$) and Shapley values to assign weighted values to neighbors, thereby bridging the gap in treating all samples with the same value and weight. On average, IM-KNN improves the accuracy, precision, and recall of traditional KNN by 16.80%, 17.08%, and 16.98%, respectively, across 12 benchmark datasets. Experiments on four large-scale datasets further highlight IM-KNN's robustness to noise, imbalanced data, and skewed distributions.
Abstract: K-最近邻(KNN)算法广泛用于分类和回归;然而,它存在一些限制,包括对所有样本一视同仁。 我们提出了信息修改的KNN(IM-KNN),这是一种新方法,利用互信息($I$)和Shapley值为邻居分配加权值,从而弥补了对所有样本赋予相同价值和权重的不足。 在12个基准数据集上,IM-KNN平均将传统KNN的准确性、精确度和召回率分别提高了16.80%、17.08%和16.98%。 在四个大规模数据集上的实验进一步突显了IM-KNN对噪声、不平衡数据和偏态分布的鲁棒性。
Comments: This paper has been accepted for publication in the IEEE Machine Learning and Signal Processing conference (MLSP 2025)
Subjects: Machine Learning (cs.LG) ; Information Theory (cs.IT)
Cite as: arXiv:2312.01991 [cs.LG]
  (or arXiv:2312.01991v4 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2312.01991
arXiv-issued DOI via DataCite

Submission history

From: Mohammad Ali Vahedifar [view email]
[v1] Mon, 4 Dec 2023 16:10:34 UTC (742 KB)
[v2] Tue, 14 May 2024 11:59:30 UTC (747 KB)
[v3] Mon, 7 Jul 2025 15:46:25 UTC (159 KB)
[v4] Thu, 10 Jul 2025 12:18:34 UTC (159 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2023-12
Change to browse by:
cs
cs.IT
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号