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

arXiv 2023年

作者： Wen, Haomin Lin, Youfang Wu, Lixia Mao, Xiaowei Cai, Tianyue Hou, Yunfeng Guo, Shengnan Liang, Yuxuan Jin, Guangyin Zhao, Yiji Zimmermann, Roger Ye, Jieping Wan, Huaiyu The Beijing Key Laboratory of Traffic Data Analysis and Mining School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China The Key Laboratory of Intelligent Passenger Service of Civil Aviation CAAC Beijing101318 China The School of Computing National University of Singapore Singapore College of Systems Engineering National University of Defense Technology Changsha China The School of Information Science and Engineering Yunnan University Kunming650091 China The Cainiao Network Hangzhou China The Alibaba Group Hangzhou China INTR Thrust and DSA Thrust The Hong Kong University of Science and Technology Guangzhou China

Instant delivery services, such as food delivery and package delivery, have achieved explosive growth in recent years by providing customers with daily-life convenience. An emerging research area within these services is service Route&Time Prediction (RTP), which aims to estimate the future service route as well as the arrival time of a given worker. As one of the most crucial tasks in those service platforms, RTP stands central to enhancing user satisfaction and trimming operational expenditures on these platforms. Despite a plethora of algorithms developed to date, there is no systematic, comprehensive survey to guide researchers in this domain. To fill this gap, our work presents the first comprehensive survey that methodically categorizes recent advances in service route and time prediction. We start by defining the RTP challenge and then delve into the metrics that are often employed. Following that, we scrutinize the existing RTP methodologies, presenting a novel taxonomy of them. We categorize these methods based on three criteria: (i) type of task, subdivided into only-route prediction, only-time prediction, and joint route&time prediction;(ii) model architecture, which encompasses sequence-based and graph-based models;and (iii) learning paradigm, including Supervised Learning (SL) and Deep Reinforcement Learning (DRL). Conclusively, we highlight the limitations of current research and suggest prospective avenues. We believe that the taxonomy, progress, and prospects introduced in this paper can significantly promote the development of this field. © 2023, CC BY.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

The joint effects of physical activity and sleep duration on risk of osteoporosis in Taiwanese adult population: The Taiwan Biobank Study

引用

Osteoporosis International 2024年第3期35卷 523-531页

作者： Chen, Kun-Hui Su, Chen-Ming Liu, Wei-Ju Tzeng, Huey-En Lee, Chia-Lin Tsai, Chun-Hao Department of Orthopedic Surgery Taichung Veterans General Hospital Taichung 407219 Taiwan Department of Post-Baccalaureate Medicine College of Medicine National Chung Hsing University Taichung 402204 Taiwan Department of Computer Science & Information Engineering College of Computing and Informatics Providence University Taichung City 43301 Taiwan Department of Sports Medicine China Medical University Taichung 406040 Taiwan Department of Medical Research Taichung Veterans General Hospital Taichung 407219 Taiwan Intelligent Data Mining Laboratory Department of Medical Research Taichung Veterans General Hospital Taichung 407219 Taiwan School of Medicine Taipei Medical University Taipei 11031 Taiwan Division of Transfusion Medicine /Hematology - Oncology Taichung Veterans General Hospital Taichung 40705 Taiwan Department of Public Health College of Public Health China Medical University Taichung 406040 Taiwan Department of Medicine School of Medicine National Yang Ming Chiao Tung University Taipei 112304 Taiwan Department of Orthopedics China Medical University Hospital Taichung 406040 Taiwan College of Biomedical Engineering China Medical University Taichung 406040 Taiwan

Summary: Most studies investigating the association between physical activity and osteoporosis prevention only focused on specific types of physical activity. This study’s evidence regarding the combined effects or interaction of sleep duration and physical activity. The findings emphasize the role of sleep duration and physical activity in association with osteoporosis. Purpose: The associations between physical activity, sleep duration, and prevalent osteoporosis in Taiwanese adults were studied in this cross-sectional study. Methods: The Taiwan Biobank enrolled a community-based cohort of ~ 120,000 volunteers (as of April 30, 2020) between 30 and 76 years of age with no history of cancer. Amongst, bone mineral density (BMD) measures by dual-energy X-ray absorptiometry (DXA) were available in 22,402 participants. After excluding individuals who had no complete data of BMI (n = 23), MET score (n = 207), T-score (n = 8,826), and sleep duration (n = 16), 13,330 subjects were included as the primary cohort. Univariate and multivariable regression analyses were performed to determine the associations between the presence of osteoporosis, physical activity level, sleep duration, and other variables. Results: The results showed that after adjustment, subjects with physical activity < 20 METs/week and ≥ 20 METs/week (aOR = 1.017 and 0.767, respectively) were associated with risk of osteoporosis than those with zero MET. The odds of osteoporosis were not significantly lower in subjects who slept for ≥ 8 h/day (aOR = 0.934,p=0.266). In addition, compared to short sleepers with no physical activity, adults with increased physical activity ≥ 20 METs/week and sleep ≥ 8 h/day had a significantly lowest likelihood of osteoporosis (aOR = 0.702). Those with medium physical activity (< 20 METs/week) plus average sleep duration (6.5–8 h/day) did not have significant higher odds of osteoporosis (aOR = 1.129,p=0.151). Conclusion: The findings emphasize the joint role of sleep duration

关键词： Bone mineral density (BMD) Exercise habit Osteoporosis Sleep duration Taiwan biobank

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection

arXiv

引用

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Mobile Crowd-Sensing System Based on Participant Selection 15th

Mobile Crowd-Sensing System Based on Participant Selection

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Tu, Chunyu Han, Lei Wang, Leye Yu, Zhiyong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China Key Lab of High Confidence Software Technologies Peking University Beijing China

ISBN: (纸本)9783030642426

Mobile Crowdsensing (MCS) is often accompanied by various adverse objectives when performing data collection, which makes it difficult to collect accurate data of the entire target area with low cost. Therefore, how to collect a small part of the data to accurately infer the other data of the entire target area is a crucial issue. People’s daily trajectories usually follow a certain pattern, for example, students go to school, company employees go to work. This pattern allows us to find participants who often pass through fixed areas within a certain time span, leading their collected partial data are near optimal for the entire data collection task. This paper models the problem and develops multiple methods to improve the participant selection and the data recovery. Particularly, we use a random method, reinforcement learning, and greedy algorithm to handle this problem and compare the differences among these methods by experiments. © 2020, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

arXiv

引用

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Electric Load Forecasting Based on Sparse Representation Model 13th

Electric Load Forecasting Based on Sparse Representation Mod...

引用

13th International Conference on Green, Pervasive, and Cloud computing, GPC 2018

作者： Huang, Fangwan Zheng, Xiangping Yu, Zhiyong Yang, Guanyi Guo, Wenzhong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou China

ISBN: (纸本)9783030150921

Accurate electric load forecasting can prevent the waste of power resources and plays a crucial role in smart grid. The time series of electric load collected by smart meters are non-linear and non-stationary, which poses a great challenge to the traditional forecasting methods. In this paper, sparse representation model (SRM) is proposed as a novel approach to tackle this challenge. The main idea of SRM is to obtain sparse representation coefficients by the training set and the part of over-complete dictionary, and the rest part of over-complete dictionary multiplied with sparse representation coefficients can be used to predict the future load value. Experimental results demonstrate that SRM is capable of forecasting the complex electric load time series effectively. It outperforms some popular machine learning methods such as Neural Network, SVM, and Random Forest. © 2019, Springer Nature Switzerland AG.

关键词： Electric load forecasting

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

Poisoning attack against estimating from pairwise comparisons

arXiv

引用

arXiv 2021年

作者： Ma, Ke Xu, Qianqian Zeng, Jinshan Cao, Xiaochun Huang, Qingming The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen518055 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer and Information Engineering Jiangxi Normal University Jiangxi Nanchang330022 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China The School of Cyber Security University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China The School of Computer Science and Technology University of Chinese Academy of Sciences Beijing100049 China The Key Laboratory of Big Data Mining and Knowledge Management The School of Economics and Management University of Chinese Academy of Sciences Beijing100049 China

As pairwise ranking becomes broadly employed for elections, sports competitions, recommendation, information retrieval and so on, attackers have strong motivation and incentives to manipulate or disrupt the ranking list. They could inject malicious comparisons into the training data to fool the target ranking algorithm. Such a technique is called "poisoning attack" in regression and classification tasks. In this paper, to the best of our knowledge, we initiate the first systematic investigation of data poisoning attack on the pairwise ranking algorithms, which can be generally formalized as the dynamic and static games between the ranker and the attacker, and can be modeled as certain kinds of integer programming problems mathematically. To break the computational hurdle of the underlying integer programming problems, we reformulate them into the distributionally robust optimization (DRO) problems, which are computational tractable. Based on such DRO formulations, we propose two efficient poisoning attack algorithms and establish the associated theoretical guarantees including the existence of Nash equilibrium and the generalization ability bounds. The effectiveness of the suggested poisoning attack strategies is demonstrated by a series of toy simulations and several real data experiments. These experimental results show that the proposed methods can significantly reduce the performance of the ranker in the sense that the correlation between the true ranking list and the aggregated results with toxic data can be decreased dramatically. © 2021, CC BY-NC-ND.

关键词： Toys

来源：评论

学校读者我要写书评

暂无评论

Object tracking by the least spatiotemporal searches

arXiv

引用

arXiv 2020年

作者： Yu, Zhiyong Han, Lei Chen, Chao Guo, Wenzhong Yu, Zhiwen College of Mathematics and Computer Sciences Fuzhou University Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China School of Computer Science Northwestern Polytechnical University Xi'an710072 China School of Computer Science Chongqing University Chongqing400044 China

Tracking a suspicious car or a person in a city efficiently is crucial in urban safety management. But how can we complete the task with the minimal number of spatiotemporal searches when massive camera records are involved? To this end, this study proposes a strategy named intermediate searching at heuristic moments (IHMs). At each step, we determine which moment is the best one for the search based on a heuristic indicator. Then, at that moment, locations are searched one by one in descending order of predicted appearing probabilities until a search hit is obtained. We iterate this step until we derive the object's current location. Five searching strategies are compared via experiments. Among these strategies, the IHMs strategy is validated as the most efficient. IHMs can save up to 1/3 of the total cost. This result provides evidence that "searching at intermediate moments can save cost. Copyright © 2020, The Authors. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：