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

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong Xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and 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 and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ReconBoost: boosting can achieve modality reconcilement 24

ReconBoost: boosting can achieve modality reconcilement

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Cong Hua Qianqian Xu Shilong Bao Zhiyong Yang Qingming Huang Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores a novel multi-modal alternating learning paradigm pursuing a reconciliation between the exploitation of uni-modal features and the exploration of cross-modal interactions. This is motivated by the fact that current paradigms of multi-modal learning tend to explore multi-modal features simultaneously. The resulting gradient prohibits further exploitation of the features in the weak modality, leading to modality competition, where the dominant modality overpowers the learning process. To address this issue, we study the modality-alternating learning paradigm to achieve reconcilement. Specifically, we propose a new method called ReconBoost to update a fixed modality each time. Herein, the learning objective is dynamically adjusted with a reconcilement regularization against competition with the historical models. By choosing a KL-based reconcilement, we show that the proposed method resembles Friedman's Gradient-Boosting (GB) algorithm, where the updated learner can correct errors made by others and help enhance the overall performance. The major difference with the classic GB is that we only preserve the newest model for each modality to avoid overfitting caused by ensembling strong learners. Furthermore, we propose a memory consolidation scheme and a global rectification scheme to make this strategy more effective. Experiments over six multi-modal benchmarks speak to the efficacy of the method. We release the code at https://***/huacong/ReconBoost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimization for Multi-UAV-assisted Mobile Edge Computing

arXiv

引用

arXiv 2024年

作者： Sun, Geng Wang, Yixian Sun, Zemin Wu, Qingqing Kang, Jiawen Niyato, Dusit Leung, Victor C.M. College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China School of Automation Guangdong University of Technology Guangzhou510006 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada

Recent developments in unmanned aerial vehicles (UAVs) and mobile edge computing (MEC) have provided users with flexible and resilient computing services. However, meeting the computing-intensive and latency-sensitive demands of users poses a significant challenge due to the limited resources of UAVs. To address this challenge, we present a multi-objective optimization approach for multi-UAV-assisted MEC systems. First, we formulate a multi-objective optimization problem aiming at minimizing the total task completion delay, reducing the total UAV energy consumption, and maximizing the total amount of offloaded tasks by jointly optimizing task offloading, computation resource allocation, and UAV trajectory control. Since the problem is a mixed-integer non-linear programming (MINLP) and NP-hard problem which is challenging, we propose a joint task offloading, computation resource allocation, and UAV trajectory control (JTORATC) approach to solve the problem. However, since the decision variables of task offloading, computation resource allocation, and UAV trajectory control are coupled with each other, the original problem is split into three sub-problems, i.e., task offloading, computation resource allocation, and UAV trajectory control, which are solved individually to obtain the corresponding decisions. Moreover, the sub-problem of task offloading is solved by using distributed splitting and threshold rounding methods, the sub-problem of computation resource allocation is solved by adopting the Karush-Kuhn-Tucker (KKT) method, and the sub-problem of UAV trajectory control is solved by employing the successive convex approximation (SCA) method. Simulation results show that the proposed JTORATC has superior performance compared to the other benchmark methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

Research on the motivation to contribution and influencing factors of university students——a semi-structured interview based on qualitative research

引用

IOP Conference Series: Materials Science and engineering 2019年第5期563卷

作者： Yueyao Li Sanhong Deng Yue Zhang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Due to the lack of theoretical knowledge and practical experience, the university students have many deficiencies in contribution. We conducted semi-structured interviews with 28 undergraduate and postgraduate students of Nanjing Agricultural University. At the same time, we used descriptive statistics and cross-analysis methods to analyse the motivations of college students' initial contribution and the influencing factor of their choice. Based on this, this paper puts forward some suggestions for the initial submission of college students, and the journals are also provided for reference in the selection of manuscripts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Influencing Factors of College Students' Intention of Online Health Information Behavior Based on Social Cognitive Theory

引用

Journal of Physics: Conference Series 2019年第2期1213卷

作者： Jia Kong Sanhong Deng Yue Zhang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Based on the Social Cognition Theory, we constructed the influencing factors model of college students' intention of online health information behavior from three levels of individual, society and information systems, which was analyzed by using the PLS-SEM. Research shows that self-efficacy, information service quality, social support, information literacy and information quality significantly influence college students' intention of online health information behavior. However, the influence of perceived risk and information system quality is not significant.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Relation-Constraint Link Prediction Model for Dynamic knowledge Graphs with Entity Drift

引用

ACM Transactions on knowledge Discovery from data 1000年

作者： Xiulin Zheng Peipei Li Zan Zhang Jia Wu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China and School of Computer Science and Information Engineering Hefei University of Technology China School of Computing Faculty of Science and Engineering Macquarie University Australia

knowledge Graphs (KGs) often suffer from incompleteness and this issue motivates the task of knowledge Graph Completion (KGC). Traditional KGC models mainly concentrate on static KGs with a fixed set of entities and relations, or dynamic KGs with temporal characteristics, faltering in their generalization to constantly evolving KGs with possible irregular entity drift. Thus, in this paper, we propose a novel link prediction model based on the embedding representation to handle the incompleteness of KGs with entity drift, termed as DCEL. Unlike traditional link prediction, DCEL could generate precise embeddings for drifted entity without imposing any regular temporal characteristic. The drifted entity is added into the KG with its links to the existing entity predicted in an incremental fashion with no requirement to retrain the whole KG for computational efficiency. In terms of DCEL model, it fully takes advantages of unstructured textual description, and is composed of four modules, namely MRC (Machine Reading Comprehension), RCAA (Relation Constraint Attentive Aggregator), RSA (Relation Specific Alignment) and RCEO (Relation Constraint Embedding Optimization). Specifically, the MRC module is first employed to extract short texts from long and redundant descriptions. Then, RCAA is used to aggregate the embeddings of textual description of drifted entity and the pre-trained word embeddings learned from corpus to a single text-based entity embedding while shielding the impact of noise and irrelevant information. After that, RSA is applied to align the text-based entity embedding to graph-based space to obtain the corresponding graph-based entity embedding, and then the learned embeddings are fed into the gate structure to be optimized based on the RCEO to improve the accuracy of representation learning. Finally, the graph-based model TransE is used to perform link prediction for drifted entity. Extensive experiments conducted on benchmark datasets in terms of evaluat

关键词： dynamic knowledge graph entity drift link prediction relation constraint

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Spillover Effects of the Binance Incident on Financial Markets: A Machine Learning Approach

SSRN

引用

SSRN 2024年

作者： Feng, Lingbing Qi, Jiajun Liu, Ye Wang, Wei School of Statistics and Data Science Jiangxi University of Finance and Economics Jiangxi Nanchang330013 China Key Laboratory of Data Science in Finance and Economics Jiangxi University of Finance and Economics Jiangxi Nanchang330013 China Research Centre for Financial Development and Risk Prevention Jiangxi University of Finance and Economics Jiangxi Nanchang330013 China School of Applied Economics Jiangxi University of Finance and Economics Jiangxi Nanchang330013 China School of Management and Engineering Nanjing University Jiangsu Nanjing210093 China School of Economics and Business Administration Chongqing University Chongqing400044 China

This paper integrates event study with machine learning to analyze the spillover effects of the "Binance Incident" in the cryptocurrency market on financial markets. Utilizing the Lasso model, this paper predicts normal returns during the event window, outperforming traditional market models. Findings reveal positive effects on precious metal markets due to their safe-haven nature, while energy markets exhibit negative effects due to reduced investor confidence and weaker safe-haven attributes. Fiat currencies show negligible reactions. Summarizing across assets, this paper finds a negative overall impact of this adverse event on the financial markets. © 2024, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Research on Automatic Proofreading Method of Sensitive Information in Content Security

引用

IOP Conference Series: Materials Science and engineering 2019年第6期490卷

作者： Yonggang Gong Yuying Li Xiaoqin Lian Junying Fu School of Computer and Information Engineering Beijing Technology and Business University Beijing Key Laboratory of Food Safety Big Data Technology Beijing China

Aiming at the problem of automatic proofreading of sensitive information in mass text content, an automatic proofreading method based on the combination of rule and SVM (Support Vector Machine) is proposed. To classify sensitive information based on important sensitive information provided in the 'Newly Prohibited Texts and Cautions in Xinhua News Reports'(newest revision) and related central and online *** to the different categories, the paper constructs the classification processing rule base, designs the corresponding rules automatic Processing algorithm, and realizes the sensitive information automatic proofreading, At the same time, using the SVM model to analyze the result of the rule processing with emotion, which greatly reduces the false alarm rate. The test result shows that the recall rate of method is 89.98%, the accuracy rate is 98.31%, and 100, 000 + text content is processed per second, which solves the key difficult problems in the practical engineering application.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Do we measure novelty when we analyze unusual combinations of cited references? A validation study of bibliometric novelty indicators based on F1000Prime data

arXiv

引用

arXiv 2019年

作者： Bornmann, Lutz Tekles, Alexander Zhang, Helena H. Ye, Fred Y. Division for Science and Innovation Studies Administrative Headquarters of the Max Planck Society Hofgartenstr. 8 Munich80539 Germany Ludwig-Maximilians-Universität Munich Department of Sociology Konradstr. 6 Munich80801 Germany Jiangsu Key Laboratory of Data Engineering Knowledge Service School of Information Management Nanjing University Nanjing210023 China Nanjing University Nanjing China University of Illinois Champaign United States

Lee, Walsh, and Wang (2015) – based on Uzzi, Mukherjee, Stringer, and Jones (2013) – and Wang, Veugelers, and Stephan (2017) proposed scores based on cited references (cited journals) data which can be used to measure the novelty of papers (named as novelty scores U and W in this study). Although previous research has used novelty scores in various empirical analyses, no study has been published up to now – to the best of our knowledge – which quantitatively tested the convergent validity of novelty scores: do these scores measure what they propose to measure? Using novelty assessments by faculty members (FMs) at F1000Prime for comparison, we tested the convergent validity of the two novelty scores (U and W). FMs’ assessments not only refer to the quality of biomedical papers, but also to their characteristics (by assigning certain tags to the papers): for example, are the presented findings or formulated hypotheses novel (tags "new findings" and "hypothesis")? We used these and other tags to investigate the convergent validity of both novelty scores. Our study reveals different results for the novelty scores: the results for novelty score U are mostly in agreement with previously formulated expectations. We found, for instance, that for a standard deviation (one unit) increase in novelty score U, the expected number of assignments of the "new finding" tag increase by 7.47%. The results for novelty score W, however, do not reflect convergent validity with the FMs’ assessments: only the results for some tags are in agreement with the expectations. Thus, we propose – based on our results – the use of novelty score U for measuring novelty quantitatively, but question the use of novelty score W. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BCS-Net: Boundary, Context and Semantic for Automatic COVID-19 Lung Infection Segmentation from CT Images

arXiv

引用

arXiv 2022年

作者： Cong, Runmin Yang, Haowei Jiang, Qiuping Gao, Wei Li, Haisheng Wang, Cong Zhao, Yao Kwong, Sam The Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Big Data Technology for Food Safety Beijing Technology and Business University Beijing100048 China The Department of Computer Science City University of Hong Kong Hong Kong The Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing100044 China The School of Information Science and Engineering Ningbo University Ningbo315211 China The School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen518055 China Peng Cheng Laboratory Shenzhen518055 China The Distributed and Parallel Software Lab Huawei Technologies Shenzhen518129 China The City University of Hong Kong Shenzhen Research Institute Shenzhen51800 China

The spread of COVID-19 has brought a huge disaster to the world, and the automatic segmentation of infection regions can help doctors to make diagnosis quickly and reduce workload. However, there are several challenges for the accurate and complete segmentation, such as the scattered infection area distribution, complex background noises, and blurred segmentation boundaries. To this end, in this paper, we propose a novel network for automatic COVID-19 lung infection segmentation from CT images, named BCS-Net, which considers the boundary, context, and semantic attributes. The BCS-Net follows an encoder-decoder architecture, and more designs focus on the decoder stage that includes three progressively Boundary-Context-Semantic Reconstruction (BCSR) blocks. In each BCSR block, the attention-guided global context (AGGC) module is designed to learn the most valuable encoder features for decoder by highlighting the important spatial and boundary locations and modeling the global context dependence. Besides, a semantic guidance (SG) unit generates the semantic guidance map to refine the decoder features by aggregating multi-scale high-level features at the intermediate resolution. Extensive experiments demonstrate that our proposed framework outperforms the existing competitors both qualitatively and quantitatively. © 2022, CC BY-NC-SA.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：