检索结果-内蒙古大学图书馆

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Wang, Yexin You, Zhenbang Li, Yang Cao, Gang Yang, Zhi Cui, Bin Center for Machine Learning Research Peking University China Key Lab of High Confidence Software Technologies Peking University China Institute of Advanced Algorithms Research Shanghai China Institute of Computational Social Science Peking University Qingdao China National Engineering Labratory for Big Data Analytics and Applications China TEG Tencent Inc. Department of Data Platform China Beijing Academy of Artificial Intelligence China

ISBN: (纸本)9798350317152

Graph Neural Networks (GNNs) have achieved great success in various data mining tasks but they heavily rely on a large number of annotated nodes, requiring considerable human efforts. Despite the effectiveness of existing GNN-based Active learning (AL) methods, they assume that the annotated labels are always correct, which is contradictory to the error-prone labeling process in a practical crowdsourcing environment. Besides, due to this impractical assumption, existing works only focus on optimizing the node selection in AL but neglect optimizing the labeling process. Therefore, we present NC-ALG, the first GNN-based AL framework that optimizes both the node selection and node labeling process under a noisy crowd. For node selection, NC-ALG introduces a new measurement to model influence reliability and an effective influence maximization objective to select nodes. For node labeling, NC-ALG significantly reduces the labeling cost by considering the model-predicted labels and the labels of mirror nodes. To the best of our knowledge, this is the first attempt to consider GNN-based AL under the practical noisy crowd. Empirical studies on public datasets demonstrate that NC-ALG significantly outperforms existing methods in terms labeling efficiency. Notably, it only takes NC-ALG one-third of the labeling budget that the competitive baseline GRAIN needs to achieve an accuracy of 70.7 % on PubMed. © 2024 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of a data Governance Framework and Platform: A Case Study of a National research Organization of Thailand 20

Design and Implementation of a Data Governance Framework and...

引用

20th International Joint Conference on Computer Science and Software Engineering, JCSSE 2023

作者： Chanyachatchawan, Sapa Nasingkun, Krich Tumsangthong, Patipat Chata, Porntiwa Buranarach, Marut Socharoentum, Monsak National Electronics and Computer Technology Center Leveraging Technology Solutions Section Bangkok Thailand National Electronics and Computer Technology Center Strategic Analytics Networks with Machine Learning and Ai Research Bangkok Thailand National Electronics and Computer Technology Center Data Science and Analytics Research Group Bangkok Thailand Digital Government Development Agency Bangkok Thailand

ISBN: (纸本)9798350300505

In the current era of extensive data usage across industries, data collection, preservation, utilization, and organization has become more challenging and nuanced because it is necessary to consider critical concerns such as data security, privacy, and legal issues, apart from efficiency issues. As a result, Thai government initiated the idea and effort to implement data governance throughout the government agency. This paper showcases the implementation of data governance in a governmental research organization with highly diverse structured and unstructured data. The implementation follows international standards and the guidelines of the Digital Government Development Agency (DGA). The executives set up the working body, including the data Governance Council and data Stewards, responsible for setting up and deploying policies and regulations. Creating awareness and the necessary infrastructure are the main focuses in the first-year phase. The metadata was designed to extend DGA's version and match the organization's unique requirements. A data catalog platform was developed accordingly. We organized activities to boost employee awareness and participation, including advertising and data catalog platform training. By the end of the first year of implementation, every organization unit had registered at least one data record into the data catalog. © 2023 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

U-Star: AN Asymmetric U-Shaped Network Based on Element-Wise Multiplication to Segment Nuclei in H&E Stained Histological Images

U-Star: AN Asymmetric U-Shaped Network Based on Element-Wise...

引用

IEEE International Symposium on Biomedical Imaging

作者： Guangzhengao Yang Li Zhang Jie Zhao Zifan Chen Haoshen Li Bin Dong Center for Data Science Peking University China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China National Biomedical Imaging Center Peking University China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Nuclei segmentation in Hematoxylin and Eosin (H&E) stained images plays a crucial role in cancer diagnosis and pathological evaluation, enabling pathologists to identify abnormal cells and assess their morphology and distribution. While current automated nuclei segmentation methods predominantly employ convolutional neural networks and attention mechanisms, the potential of element-wise multiplication has been largely unexplored. This paper introduces U-Star, a novel asymmetric segmentation network based on the star block that leverages element-wise multiplication. U-Star adopts the classic encoder-decoder architecture and innovatively implements star-connection as an alternative to traditional skip-connections. In experiments on an H&E stained image dataset, U-Star achieved superior performance with a Dice coefficient of 0.8783, accuracy of 0.9089, and IoU of 0.7929, significantly outperforming baseline models. Extensive ablation studies validate the effectiveness of the star-connection and demonstrate the advantages of our proposed framework. Beyond advancing the application of element-wise multiplication techniques, U-Star shows promising potential for broader applications in medical image segmentation.

关键词： Image segmentation Pathology Technological innovation Image analysis Stars Morphology Network architecture Medical diagnostic imaging Tuning Cancer

来源：评论

学校读者我要写书评

暂无评论

Multi-Stage Bidirectional Cross-Attention Model for Predicting Prognosis in Multiple Peritoneum Lesions with Clinical Information

Multi-Stage Bidirectional Cross-Attention Model for Predicti...

引用

IEEE International Symposium on Biomedical Imaging

作者： Haoshen Li Jieyuan Cai Yiyuan Wei Zifan Chen Heyun Chen Jie Zhao Yanjie Shi Bin Dong Lei Tang Xiaotian Zhang Li Zhang Center for Data Science Peking University China Peking University Cancer Hospital & Institute China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Peritoneal metastasis occurs when cancer cells spread from the primary tumor to the peritoneum, leading to morphological alterations that significantly impact patient survival. The specific changes across multiple peritoneal sites can effectively indicate a patient's risk level and prognosis. However, the considerable variation in peritoneal shape, size, and location poses significant challenges for feature extraction and prognostic analysis. Traditional multi-instance learning approaches typically fuse instance features extracted by the backbone network at the final stage, but their lack of intermediate interaction limits the ability to capture both common and distinct features. To address this limitation, we propose a Multi-Stage BiDirectional Cross-Attention framework (MSBDCA). Our approach enhances feature extraction and prognostic analysis by facilitating interaction among different peritoneal instances and incorporating clinical information. Experimental comparisons with five baseline models demonstrate our method's superiority, achieving improvements of 8.7% in Area Under Curve (AUC) and 5.9% in Concordance Index (C_index). These results suggest a promising direction for survival and prognostic analysis using peritoneal lesions. Our code is available at https://***/HaoshenLi/MSBDCA.

关键词： learning systems Shape Predictive models Feature extraction Metastasis Lesions Clinical diagnosis Prognostics and health management Abdomen Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

BIM: Improving Graph Neural Networks with Balanced Influence Maximization 40

BIM: Improving Graph Neural Networks with Balanced Influence...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Wentao Gao, Xinyi Yang, Ling Cao, Meng Huang, Ping Shan, Jiulong Yin, Hongzhi Cui, Bin Peking University Center for Machine Learning Research China Institute of Advanced Algorithms Research Shanghai China National Engineering Labratory for Big Data Analytics and Applications The University of Queensland Australia Peking University Key Lab of High Confidence Software Technologies China Apple Inc. Institute of Computational Social Science Peking University Qingdao China

ISBN: (纸本)9798350317152

The imbalanced data classification problem has aroused lots of concerns from both academia and industry since data imbalance is a widespread phenomenon in many real-world scenarios. Although this problem has been well researched from the view of imbalanced class samples, we further argue that graph neural networks (GNNs) expose a unique source of imbalance from the influenced nodes of different classes of labeled nodes, i.e., labeled nodes are imbalanced in terms of the number of nodes they influenced during the influence propagation in GNNs. To tackle this previously unexplored influence-imbalance issue, we connect social influence maximization with the imbalanced node classification problem and propose balanced influence maximization (BIM). Specifically, BIM greedily assigns the pseudo label to the node which can maximize the number of influenced nodes in GNN training while making the influence of each class more balance. Experimental results on five public datasets demonstrate the effectiveness of our method in relieving the influence-imbalance issue. For example, when training a GCN with an imbalance ratio of 0.1, BIM significantly outperforms the most competitive baseline by 0.6% -9.8% in five public datasets in terms of the F1 score. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification

arXiv

引用

arXiv 2024年

作者： Klüttermann, Simon Rutinowski, Jérôme Nguyen, Anh Grimme, Britta Roidl, Moritz Müller, Emmanuel TU Dortmund University Dortmund Germany Lamarr Institute for Machine Learning and Artificial Intelligence Germany Research Center Trustworthy Data Science and Security Germany

In this contribution, we introduce a novel ensemble method for the re-identification of industrial entities, using images of chipwood pallets and galvanized metal plates as dataset examples. Our algorithms replace commonly used, complex siamese neural networks with an ensemble of simplified, rudimentary models, providing wider applicability, especially in hardware-restricted scenarios. Each ensemble sub-model uses different types of extracted features of the given data as its input, allowing for the creation of effective ensembles in a fraction of the training duration needed for more complex state-of-the-art models. We reach state-of-the-art performance at our task, with a Rank-1 accuracy of over 77% and a Rank-10 accuracy of over 99%, and introduce five distinct feature extraction approaches, and study their combination using different ensemble methods. © 2024, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A REDUCTION-BASED FRAMEWORK FOR CONSERVATIVE BANDITS AND REINFORCEMENT learning 10

A REDUCTION-BASED FRAMEWORK FOR CONSERVATIVE BANDITS AND REI...

引用

10th International Conference on learning Representations, ICLR 2022

作者： Yang, Yunchang Wu, Tianhao Zhong, Han Garcelon, Evrard Pirotta, Matteo Lazaric, Alessandro Wang, Liwei Du, Simon S. Center for Data Science Peking University China University of California Berkeley United States Facebook AI Research Key Laboratory of Machine Perception MOE School of Artificial Intelligence Peking University China International Center for Machine Learning Research Peking University China University of Washington United States

We study bandits and reinforcement learning (RL) subject to a conservative constraint where the agent is asked to perform at least as well as a given baseline policy. This setting is particular relevant in real-world domains including digital marketing, healthcare, production, finance, etc. In this paper, we present a reduction-based framework for conservative bandits and RL, in which our core technique is to calculate the necessary and sufficient budget obtained from running the baseline policy. For lower bounds, we improve the existing lower bound for conservative multi-armed bandits and obtain new lower bounds for conservative linear bandits, tabular RL and low-rank MDP, through a black-box reduction that turns a certain lower bound in the nonconservative setting into a new lower bound in the conservative setting. For upper bounds, in multi-armed bandits, linear bandits and tabular RL, our new upper bounds tighten or match existing ones with significantly simpler analyses. We also obtain a new upper bound for conservative low-rank MDP. © 2022 ICLR 2022 - 10th International Conference on learning Representationss. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

hmBERT: Historical Multilingual Language Models for Named Entity Recognition

hmBERT: Historical Multilingual Language Models for Named En...

引用

2022 Conference and Labs of the Evaluation Forum, CLEF 2022

作者： Schweter, Stefan März, Luisa Schmid, Katharina Çano, Erion Bayerische Staatsbibliothek München Digital Library/ Munich Digitization Center Munich Germany Digital Philology Research Group Data Mining and Machine Learning University of Vienna Austria Natural Language Processing Expert Center Data:Lab Volkswagen AG Munich Germany

Compared to standard Named Entity Recognition (NER), identifying persons, locations, and organizations in historical texts constitutes a big challenge. To obtain machine-readable corpora, the historical text is usually scanned and Optical Character Recognition (OCR) needs to be performed. As a result, the historical corpora contain errors. Also, entities like location or organization can change over time, which poses another challenge. Overall, historical texts come with several peculiarities that differ greatly from modern texts and large labeled corpora for training a neural tagger are hardly available for this domain. In this work, we tackle NER for historical German, English, French, Swedish, and Finnish by training large historical language models. We circumvent the need for large amounts of labeled data by using unlabeled data for pretraining a language model. We propose hmBert, a historical multilingual BERT-based language model, and release the model in several versions of different sizes. Furthermore, we evaluate the capability of hmBert by solving downstream NER as part of this year’s HIPE-2022 shared task and provide detailed analysis and insights. For the Multilingual Classical Commentary coarse-grained NER challenge, our tagger HISTeria outperforms the other teams’ models for two out of three languages. © 2022 Copyright for this paper by its authors.

关键词： Optical character recognition

来源：评论

学校读者我要写书评

暂无评论

ProbSAINT: Probabilistic Tabular Regression for Used Car Pricing

arXiv

引用

arXiv 2024年

作者： Madhusudhanan, Kiran Behrens, Gunnar Stubbemann, Maximilian Schmidt-Thieme, Lars Information Systems and Machine Learning Lab VWFS Data Analytics Research Center University of Hildesheim Hildesheim Germany Data Analytics & AI Engineering Volkswagen Financial Services AG Braunschweig Germany

Used car pricing is a critical aspect of the automotive industry, influenced by many economic factors and market dynamics. With the recent surge in online marketplaces and increased demand for used cars, accurate pricing would benefit both buyers and sellers by ensuring fair transactions. However, the transition towards automated pricing algorithms using machine learning necessitates the comprehension of model uncertainties, specifically the ability to flag predictions that the model is unsure about. Although recent literature proposes the use of boosting algorithms or nearest neighbor-based approaches for swift and precise price predictions, encapsulating model uncertainties with such algorithms presents a complex challenge. We introduce ProbSAINT, a model that offers a principled approach for uncertainty quantification of its price predictions, along with accurate point predictions that are comparable to state-of-the-art boosting techniques. Furthermore, acknowledging that the business prefers pricing used cars based on the number of days the vehicle was listed for sale, we show how ProbSAINT can be used as a dynamic forecasting model for predicting price probabilities for different expected offer duration. Our experiments further indicate that ProbSAINT is especially accurate on instances where it is highly certain. This proves the applicability of its probabilistic predictions in real-world scenarios where trustworthiness is crucial. © 2024, CC BY.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Conformal Prediction in Hierarchical Classification

arXiv

引用

arXiv 2025年

作者： Mortier, Thomas Javanmardi, Alireza Sale, Yusuf Hüllermeier, Eyke Waegeman, Willem Department of Environment Ghent University Ghent Belgium Department of Data Analysis and Mathematical Modelling Ghent University Ghent Belgium Institute of Informatics LMU Munich Munich Germany Munich Center for Machine Learning Munich Germany

Conformal prediction has emerged as a widely used framework for constructing valid prediction sets in classification and regression tasks. In this work, we extend the split conformal prediction framework to hierarchical classification, where prediction sets are commonly restricted to internal nodes of a predefined hierarchy, and propose two computationally efficient inference algorithms. The first algorithm returns internal nodes as prediction sets, while the second relaxes this restriction, using the notion of representation complexity, yielding a more general and combinatorial inference problem, but smaller set sizes. Empirical evaluations on several benchmark datasets demonstrate the effectiveness of the proposed algorithms in achieving nominal coverage. © 2025, CC BY.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：