ACM SIGKDD Explorations Newsletter最新文献

筛选
英文 中文
The Case for Hybrid Multi-Objective Optimisation in High-Stakes Machine Learning Applications 高风险机器学习应用中的混合多目标优化案例
ACM SIGKDD Explorations Newsletter Pub Date : 2024-07-24 DOI: 10.1145/3682112.3682116
Alex A. Freitas
{"title":"The Case for Hybrid Multi-Objective Optimisation in High-Stakes Machine Learning Applications","authors":"Alex A. Freitas","doi":"10.1145/3682112.3682116","DOIUrl":"https://doi.org/10.1145/3682112.3682116","url":null,"abstract":"Most classification (supervised learning) algorithms optimise a single objective, typically the predictive performance of the learned classification model. However, in high-stake classification applications, involving e.g. decisions about whether or not an individual should undergo a medical surgery, be granted a loan or be hired for a job, often there is a need to optimise multiple objectives, such as the predictive performance, interpretability or fairness of the learned model. In this context, this position paper discusses the pros and cons of two different multi-objective optimisation approaches (the Pareto and the lexicographic approaches), and proposes a conceptual framework for hybrid multi-objective optimisation, combining those two approaches.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"41 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141807623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analyzing and explaining privacy risks on time series data: ongoing work and challenges 分析和解释时间序列数据的隐私风险:正在开展的工作和面临的挑战
ACM SIGKDD Explorations Newsletter Pub Date : 2024-07-24 DOI: 10.1145/3682112.3682118
Tristan Allard, Hira Asghar, Gildas Avoine, Christophe Bobineau, P. Cauchois, Elisa Fromont, Anna Monreale, Francesca Naretto, Roberto Pellungrini, Francesca Pratesi, M. Rousset, Antonin Voyez
{"title":"Analyzing and explaining privacy risks on time series data: ongoing work and challenges","authors":"Tristan Allard, Hira Asghar, Gildas Avoine, Christophe Bobineau, P. Cauchois, Elisa Fromont, Anna Monreale, Francesca Naretto, Roberto Pellungrini, Francesca Pratesi, M. Rousset, Antonin Voyez","doi":"10.1145/3682112.3682118","DOIUrl":"https://doi.org/10.1145/3682112.3682118","url":null,"abstract":"Currently, privacy risks assessment is mainly performed as audits conducted by data privacy analysts. In the TAILOR project, we promote a more systematic and automatic approach based on interpretable metrics and formal methods to evaluate privacy risks and to control the tension between data privacy and utility. In this paper, we focus on privacy risks raised by publishing time series datasets, and we survey the methods developed in TAILOR to analyze and quantify privacy risks depending on different publisher and attacker models.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"55 12","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141808840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Synthetic data for learning-based knowledge discovery 基于学习的知识发现合成数据
ACM SIGKDD Explorations Newsletter Pub Date : 2024-07-24 DOI: 10.1145/3682112.3682115
William Shiao, E. Papalexakis
{"title":"Synthetic data for learning-based knowledge discovery","authors":"William Shiao, E. Papalexakis","doi":"10.1145/3682112.3682115","DOIUrl":"https://doi.org/10.1145/3682112.3682115","url":null,"abstract":"Recent advances in deep learning have demonstrated the ability of learning-based methods to tackle very hard downstream tasks. Historically, this has been demonstrated in predictive tasks, while tasks more akin to the traditional KDD (Knowledge Discovery in Databases) pipeline have enjoyed proportionally fewer advances. Can learning-based approaches help with inherently hard problems within the KDD pipeline, such as \"how many patterns are in the data\", \"what are different structures in the data\", and \"how can we robustly extract those structures?\" In this vision paper, we argue for the need for synthetic data generators to empower cheaply-supervised learning-based solutions for knowledge discovery. We describe the general idea, early proof-of-concept results which speak to the viability of the paradigm, and we outline a number of exciting challenges that await, and a set of milestones for measuring success.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"40 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141809816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Storage Systems: Organization, Performance, Coding, Reliability, and Their Data Processing, 1st Edition, October 13, 2021, Author: Alexander Thomasian 存储系统:组织、性能、编码、可靠性及其数据处理》,2021 年 10 月 13 日第 1 版,作者:Alexander Thomasian:亚历山大-托马斯
ACM SIGKDD Explorations Newsletter Pub Date : 2024-03-26 DOI: 10.1145/3655103.3655107
A. Thomasian
{"title":"Storage Systems: Organization, Performance, Coding, Reliability, and Their Data Processing, 1st Edition, October 13, 2021, Author: Alexander Thomasian","authors":"A. Thomasian","doi":"10.1145/3655103.3655107","DOIUrl":"https://doi.org/10.1145/3655103.3655107","url":null,"abstract":"Textbooks on computer organization and architecture, operating systems, and databases do not sufficiently cover storage systems. This is especially so in view of rapid advances in storage technology in the form of flash and Storage Class Memories - SCMs and storage organizations such as datacentric and the DisAggregated Shared Everything - DASE.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"103 46","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140379659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Report on the 3rd International Workshop onLearning to Quantify (LQ 2023) 第三届学习量化(LQ 2023)国际研讨会报告
ACM SIGKDD Explorations Newsletter Pub Date : 2024-03-26 DOI: 10.1145/3655103.3655108
Mirko Bunse, Pablo Gonz´alez, Alejandro Moreo, Fabrizio Sebastiani
{"title":"Report on the 3rd International Workshop onLearning to Quantify (LQ 2023)","authors":"Mirko Bunse, Pablo Gonz´alez, Alejandro Moreo, Fabrizio Sebastiani","doi":"10.1145/3655103.3655108","DOIUrl":"https://doi.org/10.1145/3655103.3655108","url":null,"abstract":"The 3rd International Workshop on Learning to Quantify (LQ 2023)1 took place on September 18, 2023 in Torino, IT, where it was organised as a satellite event of the 34th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML PKDD 2023). Like the main program of the conference, the workshop employed a hybrid format, with all presentations given in presence and with attendees participating in presence or online. This report presents a summary of the workshop, briefly summarising the individual works presented, and touching on the main issues that emerged during the final, open discussion.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"123 41","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140381002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Anomaly Detection using Generative Adversarial Networks Reviewing methodological progress and challenges 利用生成式对抗网络进行异常检测 回顾方法学的进步与挑战
ACM SIGKDD Explorations Newsletter Pub Date : 2024-03-26 DOI: 10.1145/3655103.3655109
Fiete Lüer, Christian Bohm
{"title":"Anomaly Detection using Generative Adversarial Networks\u0000 Reviewing methodological progress and challenges","authors":"Fiete Lüer, Christian Bohm","doi":"10.1145/3655103.3655109","DOIUrl":"https://doi.org/10.1145/3655103.3655109","url":null,"abstract":"The applications of Generative Adversarial Networks (GANs) are just as diverse as their architectures, problem settings as well as challenges. A key area of research on GANs is anomaly detection where they are most often utilized when only the data of one class is readily available.\u0000 In this work, we organize, summarize and compare key concepts and challenges of anomaly detection based on GANs. Common problems which have to be investigated to progress the applicability of GANs are identified and discussed. This includes stability and time requirements during training as well as inference, the restriction of the latent space to produce solely data from the normal class distribution, contaminated training data as well as the composition of the resulting anomaly detection score. We discuss the problems using existing work as well as possible (partial) solutions, including related work from similar areas of research such as related generative models or novelty detection. Our findings are also relevant for a variety of closely related generative modeling approaches, such as autoencoders, and are of interest for areas of research tangent to anomaly detection such as image inpainting or image translation.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"120 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140378904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Need for Unsupervised Outlier Model Selection: A Review and Evaluation of Internal Evaluation Strategies 无监督离群值模型选择的必要性:内部评价策略的回顾与评价
ACM SIGKDD Explorations Newsletter Pub Date : 2023-06-22 DOI: 10.1145/3606274.3606277
Martin Q. Ma, Yue Zhao, Xiaorong Zhang, L. Akoglu
{"title":"The Need for Unsupervised Outlier Model Selection: A Review and Evaluation of Internal Evaluation Strategies","authors":"Martin Q. Ma, Yue Zhao, Xiaorong Zhang, L. Akoglu","doi":"10.1145/3606274.3606277","DOIUrl":"https://doi.org/10.1145/3606274.3606277","url":null,"abstract":"Given an unsupervised outlier detection task, how should one select i) a detection algorithm, and ii) associated hyperparameter values (jointly called a model)? E ective outlier model selection is essential as di erent algorithms may work well for varying detection tasks, and moreover their performance can be quite sensitive to the values of the hyperparameters (HPs). On the other hand, unsupervised model selection is notoriously difficult, in the absence of hold-out validation data with ground-truth labels. Therefore, the problem is vastly understudied in the outlier mining literature. There exists a body of work that propose internal model evaluation strate- gies for selecting a model. These so-called internal strategies solely rely on the input data (without labels) and the output (outlier scores) of the candidate models. In this paper, we rst survey internal model evaluation strategies including both those proposed speci cally for outlier detection, as well as those that can be adapted from the unsupervised deep representation learning literature. Then, we investigate their e ectiveness empirically in comparison to simple baselines such as random selection and the popular state-of-the-art detector Isolation Forest (iForest) with default HPs. To this end, we set up (and open-source) a large testbed with 39 detection tasks and 297 candidate models comprised of 8 different detectors and various HP con gurations. We evaluate internal strategies from 7 di erent families on their ability to discriminate between models w.r.t. detection performance, without using any labels. Our study reports a striking nding, that none of the existing and adapted strategies would be practically useful: stand-alone ones are not signi cantly di erent from random, and consensus-based ones do not outperform iForest (w/ default HPs) while being more expensive (as all candidate models need to be trained for evaluation). Our survey stresses the importance of and the standing need for e ective unsupervised outlier model selection, and acts as a call for future work on the problem.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121871072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Privacy-Preserving Graph Machine Learning from Data to Computation: A Survey 从数据到计算的隐私保护图机学习研究综述
ACM SIGKDD Explorations Newsletter Pub Date : 2023-06-22 DOI: 10.1145/3606274.3606280
Dongqi Fu, Wenxuan Bao, Ross Maciejewski, H. Tong, Jingrui He
{"title":"Privacy-Preserving Graph Machine Learning from Data to Computation: A Survey","authors":"Dongqi Fu, Wenxuan Bao, Ross Maciejewski, H. Tong, Jingrui He","doi":"10.1145/3606274.3606280","DOIUrl":"https://doi.org/10.1145/3606274.3606280","url":null,"abstract":"In graph machine learning, data collection, sharing, and analysis often involve multiple parties, each of which may require varying levels of data security and privacy. To this end, preserving privacy is of great importance in protecting sensitive information. In the era of big data, the relationships among data entities have become unprecedentedly complex, and more applications utilize advanced data structures (i.e., graphs) that can support network structures and relevant attribute information. To date, many graph-based AI models have been proposed (e.g., graph neural networks) for various domain tasks, like computer vision and natural language processing. In this paper, we focus on reviewing privacypreserving techniques of graph machine learning. We systematically review related works from the data to the computational aspects. We rst review methods for generating privacy-preserving graph data. Then we describe methods for transmitting privacy-preserved information (e.g., graph model parameters) to realize the optimization-based computation when data sharing among multiple parties is risky or impossible. In addition to discussing relevant theoretical methodology and software tools, we also discuss current challenges and highlight several possible future research opportunities for privacy-preserving graph machine learning. Finally, we envision a uni ed and comprehensive secure graph machine learning system.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127499619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Did You Train on My Dataset? Towards Public Dataset Protection with CleanLabel Backdoor Watermarking 你在我的数据集上训练了吗?利用CleanLabel后门水印实现公共数据集保护
ACM SIGKDD Explorations Newsletter Pub Date : 2023-03-20 DOI: 10.1145/3606274.3606279
Ruixiang Tang, Qizhang Feng, Ninghao Liu, Fan Yang, Xia Hu
{"title":"Did You Train on My Dataset? Towards Public Dataset Protection with CleanLabel Backdoor Watermarking","authors":"Ruixiang Tang, Qizhang Feng, Ninghao Liu, Fan Yang, Xia Hu","doi":"10.1145/3606274.3606279","DOIUrl":"https://doi.org/10.1145/3606274.3606279","url":null,"abstract":"The huge supporting training data on the Internet has been a key factor in the success of deep learning models. However, this abundance of public-available data also raises concerns about the unauthorized exploitation of datasets for commercial purposes, which is forbidden by dataset licenses. In this paper, we propose a backdoor-based watermarking approach that serves as a general framework for safeguarding publicavailable data. By inserting a small number of watermarking samples into the dataset, our approach enables the learning model to implicitly learn a secret function set by defenders. This hidden function can then be used as a watermark to track down third-party models that use the dataset illegally. Unfortunately, existing backdoor insertion methods often entail adding arbitrary and mislabeled data to the training set, leading to a significant drop in performance and easy detection by anomaly detection algorithms. To overcome this challenge, we introduce a clean-label backdoor watermarking framework that uses imperceptible perturbations to replace mislabeled samples. As a result, the watermarking samples remain consistent with the original labels, making them difficult to detect. Our experiments on text, image, and audio datasets demonstrate that the proposed framework effectively safeguards datasets with minimal impact on original task performance. We also show that adding just 1% of watermarking samples can inject a traceable watermarking function and that our watermarking samples are stealthy and look benign upon visual inspection.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126040690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Stop using the elbow criterion for k-means and how to choose the number of clusters instead 停止使用肘部标准的k-means和如何选择簇的数量
ACM SIGKDD Explorations Newsletter Pub Date : 2022-12-23 DOI: 10.1145/3606274.3606278
Erich Schubert
{"title":"Stop using the elbow criterion for k-means and how to choose the number of clusters instead","authors":"Erich Schubert","doi":"10.1145/3606274.3606278","DOIUrl":"https://doi.org/10.1145/3606274.3606278","url":null,"abstract":"A major challenge when using k-means clustering often is how to choose the parameter k, the number of clusters. In this letter, we want to point out that it is very easy to draw poor conclusions from a common heuristic, the \"elbow method\". Better alternatives have been known in literature for a long time, and we want to draw attention to some of these easy to use options, that often perform better. This letter is a call to stop using the elbow method altogether, because it severely lacks theoretic support, and we want to encourage educators to discuss the problems of the method - if introducing it in class at all - and teach alternatives instead, while researchers and reviewers should reject conclusions drawn from the elbow method.","PeriodicalId":294240,"journal":{"name":"ACM SIGKDD Explorations Newsletter","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128060109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书