• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    SIAM International Conference on Data Mining

    SIAM International Conference on Data Mining

    ConferenceCCF 数据库/数据挖掘/内容检索 B

    年发文量

    研究主题

    论文(4131)

    排序
    1Blue Sky: Reducing Performance Gap Between Commercial and Open-Source LLMs.
    Adithya Kulkarni,Mohna Chakraborty
    2025引用:1
    引用
    AI阅读
    加入学术空间
    2Label Shift Estimation with Incremental Prior Update.
    Yunrui Zhang,Gustavo Batista, Salil S. Kanhere

    An assumption often made in supervised learning is that the training and testing sets have the same label distribution. However, in real-life scenarios, this assumption rarely holds. For example, medical diagnosis result distributions change over time and across locations; fraud detection models must adapt as patterns of fraudulent activity shift; the category distribution of social media posts changes based on trending topics and user demographics. In the task of label shift estimation, the goal is to estimate the changing label distribution p_t(y) in the testing set, assuming the likelihood p(x|y) does not change, implying no concept drift. In this paper, we propose a new approach for post-hoc label shift estimation, unlike previous methods that perform moment matching with confusion matrix estimated from a validation set or maximize the likelihood of the new data with an expectation-maximization algorithm. We aim to incrementally update the prior on each sample, adjusting each posterior for more accurate label shift estimation. The proposed method is based on intuitive assumptions on classifiers that are generally true for modern probabilistic classifiers. The proposed method relies on a weaker notion of calibration compared to other methods. As a post-hoc approach for label shift estimation, the proposed method is versatile and can be applied to any black-box probabilistic classifier. Experiments on CIFAR-10 and MNIST show that the proposed method consistently outperforms the current state-of-the-art maximum likelihood-based methods under different calibrations and varying intensities of label shift.

    2025引用:1
    引用
    AI阅读
    加入学术空间
    3Differentially Private Associative Co-clustering.
    Elena Battaglia,Ruggero G. Pensa
    2025
    引用
    AI阅读
    加入学术空间
    4AutoSTDiff: Autoregressive Spatio-Temporal Denoising Diffusion Model for Asynchronous Trajectory Generation.
    Rongchao Xu,Zhiqing Hong,Guang Wang
    2025引用:4
    引用
    AI阅读
    加入学术空间
    5Language Models Are Explorers for Join Discovery on Data Lakes.
    Yaohua Wang,Bolin Ding,Rong Zhu,Haibin Wang,Zhijian Ma,Jingren Zhou
    2025
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 4131 篇论文

    高被引作者

    作者引用发文
    Jiawei Han572635
    Eamonn Keogh552627
    Philip S. Yu447777
    Christos Faloutsos372235
    Chris H. Q. Ding34949
    Charu Aggarwal325443
    Vipin Kumar314636
    Huan Liu273828
    Martin Ester26527
    Arindam Banerjee264018

    高产作者

    作者引用发文
    Philip S. Yu447777
    Charu Aggarwal325443
    zhong hong da jian78140
    Vipin Kumar314636
    Christos Faloutsos372235
    Jiawei Han572635
    jun lang ping ben41031
    zhang shen si ben52829
    Huan Liu273828
    Eamonn Keogh552627

    相关期刊

    Data Science and Engineering
    SIGKDD Explorations
    ACM IKDD Conference on Data Science
    Workshop on E-Business
    European Conference on Machine Learning
    European Conference on Principles of Data Mining and Knowledge Discovery
    Industrial Conference on Data Mining
    IEEE International Conference on Data Mining
    Pacific-Asia Conference on Knowledge Discovery and Data Mining
    arXiv: Learning