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

arXiv 2018年

作者： Wang, Jindong Chen, Yiqiang Hao, Shuji Feng, Wenjie Shenk, Zhiqi Beijing Key Laboratory of Mobile Computing and Pervasive Device CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Institute of High Performance Computing A*STAR School of Computer Science and Engineering Nanyang Technological University Singapore Singapore

Transfer learning has achieved promising results by leveraging knowledge from the source domain to annotate the target domain which has few or none labels. Existing methods often seek to minimize the distribution divergence between domains, such as the marginal distribution, the conditional distribution or both. However, these two distances are often treated equally in existing algorithms, which will result in poor performance in real applications. Moreover, existing methods usually assume that the dataset is balanced, which also limits their performances on imbalanced tasks that are quite common in real problems. To tackle the distribution adaptation problem, in this paper, we propose a novel transfer learning approach, named as Balanced Distribution Adaptation (BDA), which can adaptively leverage the importance of the marginal and conditional distribution discrepancies, and several existing methods can be treated as special cases of BDA. Based on BDA, we also propose a novel Weighted Balanced Distribution Adaptation (W-BDA) algorithm to tackle the class imbalance issue in transfer learning. W-BDA not only considers the distribution adaptation between domains but also adaptively changes the weight of each class. To evaluate the proposed methods, we conduct extensive experiments on several transfer learning tasks, which demonstrate the effectiveness of our proposed algorithms over several state-of-the-art methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

HAS-QA: Hierarchical answer spans model for open-domain question answering

arXiv

引用

arXiv 2019年

作者： Pang, Liang Lan, Yanyan Guo, Jiafeng Xu, Jun Su, Lixin Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Statistics University of California Berkeley

This paper is concerned with open-domain question answering (i.e., OpenQA). Recently, some works have viewed this problem as a reading comprehension (RC) task, and directly applied successful RC models to it. However, the performances of such models are not so good as that in the RC task. In our opinion, the perspective of RC ignores three characteristics in OpenQA task: 1) many paragraphs without the answer span are included in the data collection;2) multiple answer spans may exist within one given paragraph;3) the end position of an answer span is dependent with the start position. In this paper, we first propose a new probabilistic formulation of OpenQA, based on a three-level hierarchical structure, i.e., the question level, the paragraph level and the answer span level. Then a Hierarchical Answer Spans Model (HAS-QA) is designed to capture each probability. HAS-QA has the ability to tackle the above three problems, and experiments on public OpenQA datasets show that it significantly outperforms traditional RC baselines and recent OpenQA baselines. Copyright © 2019, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How medical crowdfunding helps people? A large-scale case study on waterdrop fundraising

arXiv

引用

arXiv 2020年

作者： Huang, Junjie Shen, Huawei Cao, Qi Cai, Li Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Beijing Zongqing Xiangqian Science and Technology Co Ltd Beijing China

While online medical crowdfunding achieved tremendous success, quantitative study about whether and how medical crowdfunding helps people remains little explored. In this paper, we empirically study how online medical crowdfunding helps people using more than 27, 000 fundraising cases in Waterdrop Fundraising, one of the most popular online medical crowdfunding platforms in China. We find that the amount of money obtained by fundraisers is broadly distributed, i.e., a majority of lowly donated cases coexist with a handful of very successful cases. We further investigate the factors that potentially correlate with the success of medical fundraising cases. Profile information of fundraising cases, e.g., geographic information of fundraisers, affects the donated amounts, since detailed description may increase the credibility of a fundraising case. One prominent finding lies in the effect of social network on the success of fundraising cases: the spread of fundraising information along social network is a key factor of fundraising success, and the social capital of fundraisers play an important role in fundraising. Finally, we conduct prediction of donations using machine learning models, verifying the effect of potential factors to the success of medical crowdfunding. Altogether, this work presents a data-driven view of medical fundraising on the web and opens a door to understanding medical crowdfunding. Copyright © 2020, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Design of Target Behavior Intelligent Analysis System Based on Distributed computing

Design of Target Behavior Intelligent Analysis System Based ...

引用

Signal, Information and data Processing (ICSIDP), IEEE International Conference on

作者： Xinlong Pan Xueqi Cheng Libo Yao Zhenqiu Zhu Biao Ding Tiantian Tang Minbo Li Chuanhui Liu CAS Key Laboratory of Network Data Science & Technology Inistitute of Computing Technology Beijing China Institute of Information Fusion Naval Aviation University Yantai China School of Software Fudan University Shanghai China

ISBN: (数字)9781728123455

ISBN: (纸本)9781728123462

Through the fusion processing of target data obtained by radar, electronic reconnaissance, space reconnaissance, technical reconnaissance and civil cooperative system in early warning and surveillance system, multidimensional target data including explicit state information such as target attributes, type, position, speed and course could be obtained. The latent potential information, such as regular behavior, intention and threat degree, need to be mastered by human intelligence and experience analysis. It is urgent to use big data mining technology to realize intelligent analysis of target behavior. Based on the analysis of big data related technologies, this paper designs an intelligent target behavior analysis system based on distributed computing, which provides theoretical and technical support for intelligent upgrading of intelligence processing systems and command decision systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Knowledge Graph Completion based on data Enhancement

Few-Shot Knowledge Graph Completion based on Data Enhancemen...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Li, Zepeng Geng, Peilun Cao, Shuo Hu, Bin Lanzhou University Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou730000 China Beijing Institute of Technology School of Medical Technology Beijing100081 China CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chines Academy of Sciences Shanghai200000 China

ISBN: (纸本)9781665468190

Knowledge graphs (KGs) are widely used in various natural language processing applications. In order to expand the coverage of a KG, KG completion has attracted extensive attention. The commonly used embedding methods based on a large amount of training data can play an important role in this work. However, with few of triples, the performance of these methods will be greatly reduced. The completion of this kind of few-shot task is more challenging. In this work, we propose a method of data enhancement to increase the data quantity and solve the problem of sample shortage. Specifically, we first observe that the representation vectors of the relation in a KG are approximately subordinate to Gaussian distribution. Then we construct a Gaussian distribution for the relation of each triple in few-shot task according to the distributions of its similar relations in background graph. Further, we sample from the Gaussian distribution of each triple to expand the training data. Finally, we use an adaptive attentional network model FAAN proposed by Sheng et al. as the baseline model. Experimental results on two public datasets NELL-One and Wiki-One show that the proposed method achieves better performance. © 2022 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Using Label-text Correlation and Deviation Punishment for Fine-grained Suicide Risk Detection in Social Media

Using Label-text Correlation and Deviation Punishment for Fi...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Li, Zepeng An, Zhengyi Cheng, Wenchuan Zhou, Jiawei Hu, Bin Lanzhou University Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou730000 China Beijing Institute of Technology School of Medical Technology Beijing100081 China Shanghai Institutes for Biological Sciences Chines Academy of Sciences CAS Center for Excellence in Brain Science and Intelligence Technology Shanghai200000 China

ISBN: (纸本)9781665468190

Suicide causes serious harm to individuals, families and society, and becomes a social problem of widespread concern. Therefore, it is necessary to find and intervene individuals at risk of suicide as soon as possible. In recent years, social media data has successfully been leveraged for suicide risk detection. However, for fine-grained suicide risk detection, the existing models ignore the deviation between the predicted results and the real results when making wrong predictions, and do not pay attention to the semantic information contained in the labels. This paper proposes a deep learning model based on Label-Text Correlation and Deviation Punishment (LTC-DP). While learning the semantic relation adequately between the text and the corresponding label, the model can give different punishment adaptively according to the deviation degrees between the predicted results and the real result. The experimental results show that compared with the baseline model, the proposed model has better performance in fine-grained suicide risk detection. In addition, we release a fine-grained suicide risk detection data set based on Weibo, the data set is available at https://***/cxyazy/FGCSD-main. © 2022 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Demand Response Scheme: Achieving Sustainability in Distributed data Processing 9

Demand Response Scheme: Achieving Sustainability in Distribu...

引用

9th IEEE International Conference on data science in Cyberspace, DSC 2024

作者： Zhai, Xueying Peng, Yunfeng Guo, Xiuping Zhang, Liang Zhang, Wei University of Science and Technology Beijing School of Computer and Communication Engineering Beijing China Beijing University of Posts and Telecommunications School of Economics and Management Beijing China Guizhou Institute of Technology Guizhou Key Laboratory of Electric Power Big Data Guizhou China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China

ISBN: (纸本)9798350391367

The rapid development of Internet of Things (IoT) technology has driven the intelligent transformation of various industries, including manufacturing, agriculture, and healthcare, etc., significantly enhancing their management capabilities and decision-making efficiency. data analysis is crucial, serving as both the core technology of this transformation and a major driving force for advancing industry intelligence. However, the increasing volume of data has led to high energy consumption during data analysis, posing significant challenges to environmental and economic sustainability. Integrating renewable energy sources (RESs) is an effective way to reduce greenhouse gas emissions due to their low-carbon and renewable nature. Additionally, the spatiotemporal variability and complementarity of RES generation and grid electricity prices provide favorable conditions for distributed data processing. Therefore, a two-stage demand response scheme is proposed to reduce carbon emissions and electricity costs by prioritizing data processing in data centers (DCs) where RES is abundant or electricity prices are low, based on RES generation and electricity price signals. Simulation results show that the proposed scheme reduces 36.37% carbon emissions and 20.49% electricity costs compared to the benchmark algorithm, indicating its potential for both environmental and economic optimization. © 2024 IEEE.

关键词： Low emission

来源：评论

学校读者我要写书评

暂无评论

SMGC-SBERT: A Multi-Feature Fusion Chinese Short Text Similarity Computation Model Based on Optimised SBERT

SMGC-SBERT: A Multi-Feature Fusion Chinese Short Text Simila...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Zhao, Shuo Gu, Qiliang Zhang, Jianqiang Song, Gongpeng Lu, Qin Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (纸本)9781665410205

Chinese short text similarity computation stands as a pivotal task within natural language processing, garnering significant attention. However, existing models grapple with limitations in handling intricate semantic relationships, such as the challenge of discerning subtle semantic nuances in text, inadequacies in effectively integrating diverse levels of semantic information, and the struggle to capture polysemous meanings accurately. In addressing these issues, this paper introduces an innovative Chinese short text similarity computation model, SMGC-SBERT. This model addresses shortcomings of the existing models by employing a multi-module fusion strategy, thereby enabling a more precise measurement of semantic similarity between texts. Primarily, the model incorporates SAT embedding to acquire phrase-level semantic information and leverages the MS-BERT model to encode text, improving the model's comprehension of textual polysemy and obtaining richer semantic representation. Then, the fusion of module features, including multi-branch convolutional networks and mix pooling, enables the extraction of textual features from varied levels, bolstering the model's representational capacity. Additionally, to further reduce overfitting risks while improving accuracy and other performance, a multi-layer feature adjustment network is utilized for short text similarity calculation. The final resultant experimental findings showcase the superiority of the SMGC-SBERT model over other neural network models, demonstrating significant advancements across both Chinese-SNLI and CCKS2018_Task3 Chinese short text datasets. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

FERI: Feature Enhancement and Relational Interaction for Image-text Matching 30

FERI: Feature Enhancement and Relational Interaction for Ima...

引用

30th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2024

作者： Zhang, Yu Zhang, Jianqiang Song, Gongpeng Lu, Qin Zhao, Shuo Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (纸本)9798331515966

Image-text matching is an important problem at the intersection of computer vision and natural language processing. It aims to establish the semantic link between image and text to achieve high-quality semantic alignment between the two modalities. However, the existing methods have the problem that the meaning expressed in the image or the complex narrative in the text cannot be fully understood due to insufficient feature extraction. Moreover, due to the essential modal differences between images and texts, how to effectively and accurately align the semantic contents in images and texts has become the key of research. In order to solve the above problems, this paper proposes a method based on feature enhancement and relationship interaction. When processing images, the proposed method fuses labeled features, region features and location features to represent images. When processing text, a combination of Bi-GRU and self-attention mechanism is used to represent the text. In order to further align the semantic content in images and texts accurately, this paper improves two relational interaction mechanisms by identifying connection relationships and learning association relationships. Thus, the relation enhanced embedding is obtained. Finally, it calculated the similarity of the enhanced embedding to judge the matching degree of the image and text. Extensive experiments on the public datasets Flickr30K and MSCOCO demonstrate the effectiveness of our method. © 2024 IEEE.

关键词： cross-modal retrieval feature enhancement image-text matching relationship interaction

来源：评论

学校读者我要写书评

暂无评论

Traffic Engineering in Dynamic Hybrid Segment Routing networks

引用

Computers, Materials & Continua 2021年第7期68卷 655-670页

作者： Yingya Guo Kai Huang Cheng Hu Jiangyuan Yao Siyu Zhou College of Mathematics and Computer Science Fuzhou UniversityFuzhou350000China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350000China Key Laboratory of Spatial Data Mining&Information Sharing Ministry of EducationFuzhou350003China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou510006China School of Computer Science and Cyberspace Security Hainan UniversityHaiKou570228China Tandon School of Engineering New York UniversityNew York10012USA Department of Computing Hong Kong Polytechnic UniversityHong Hom999077Hong Kong

The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet *** SR architecture,the paths that the packets choose to route on are indicated at the ingress *** with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress *** the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical *** partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable *** the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR *** algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering ***,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)***,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network *** the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in *** extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.

关键词： Traffic engineering routing optimization segment routing deep reinforcement learning ultra-scalable spectral clustering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：