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

Scientific Value Weights more than Being Open or Toll Access:An analysis of the OA advantage in Nature and Science

学校读者我要写书评

暂无评论

Journal of data and Information Science 2021年第4期6卷 62-75页

作者： Howell Y.Wang Shelia X.Wei Cong Cao Xianwen Wang Fred Y.Ye International Joint Informatics Laboratory&Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information ManagementNanjing UniversityNanjing 210023China Nottingham University Business School China University of Nottingham Ningbo ChinaNingbo315100China WISE Lab. Dalian University of TechnologyDalian 116024China

Purpose:We attempt to find out whether OA or TA really affects the dissemination of scientific ***/methodology/approach:We design the indicators,hot-degree,and R-index to indicate a topic OA or TA ***,according to the OA classification of the Web of Science(WoS),we collect data from the WoS by downloading OA and TA articles,letters,and reviews published in Nature and Science during 2010–*** papers are divided into three broad disciplines,namely biomedicine,physics,and ***,taking a discipline in a journal and using the classical Latent Dirichlet Allocation(LDA)to cluster 100 topics of OA and TA papers respectively,we apply the Pearson correlation coefficient to match the topics of OA and TA,and calculate the hot-degree and R-index of every OA-TA topic ***,characteristics of the discipline can be *** qualitative comparison,we choose some high-quality papers which belong to Nature remarkable papers or Science breakthroughs,and analyze the relations between OA/TA and citation ***:The result shows that OA hot-degree in biomedicine is significantly greater than that of TA,but significantly less than that of TA in *** on the R-index,it is found that OA advantages exist in biomedicine and TA advantages do in ***,the dissemination of average scientific discoveries in all fields is not necessarily affected by OA or ***,OA promotes the spread of important scientific discoveries in high-quality *** limitations:We lost some citations by ignoring other open sources such as arXiv and *** limitation came from that Nature employs some strong measures for access-promoting subscription-based articles,on which the boundary between OA and TA became *** implications:It is useful to select hot topics in a set of publications by the hotdegree *** finding comprehensively reflects the differences of OA and TA in different disciplines,which is a u

关键词： Open access Toll access Scientific discovery Academic dissemination data analysis

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension 2

学校读者我要写书评

暂无评论

Extremely Short Chinese Text Classification Method Based on ...

2019 2nd International Symposium on Big data and Applied Statistics, ISBDAS 2019

作者： Yue, Yongzeng Zhang, Yuhong Hu, Xuegang Li, Peipei Key Laboratory of Knowledge Engineering with Big Data [Hefei University of Technology] Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei23061 China

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness;secondly, the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method. © Published under licence by IOP Publishing Ltd.

关键词： Classification (of information)

Semi-autoregressive transformer for image captioning

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhou, Yuanen Zhang, Yong Hu, Zhenzhen Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Tencent AI Lab Key Laboratory of Knowledge Engineering with Big Data Ministry of Education

Current state-of-the-art image captioning models adopt autoregressive decoders, i.e. they generate each word by conditioning on previously generated words, which leads to heavy latency during inference. To tackle this issue, non-autoregressive image captioning models have recently been proposed to significantly accelerate the speed of inference by generating all words in parallel. However, these non-autoregressive models inevitably suffer from large generation quality degradation since they remove words dependence excessively. To make a better trade-off between speed and quality, we introduce a semi-autoregressive model for image captioning (dubbed as SATIC), which keeps the autoregressive property in global but generates words parallelly in local. Based on Transformer, there are only a few modifications needed to implement SATIC. Experimental results on the MSCOCO image captioning benchmark show that SATIC can achieve a good trade-off without bells and whistles. Code is available at https://***/YuanEZhou/satic. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

Causal-Inspired Multitask Learning for Video-Based Human Pose Estimation 39

学校读者我要写书评

暂无评论

Causal-Inspired Multitask Learning for Video-Based Human Pos...

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Chen, Haipeng Wu, Sifan Wang, Zhigang Yin, Yifang Jiao, Yingying Lyu, Yingda Liu, Zhenguang College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Zhejiang Gongshang University China Institute for Infocomm Research (I2R) A*STAR Singapore Public Computer Education and Research Center Jilin University China The State Key Laboratory of Blockchain and Data Security Zhejiang University China Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security China

ISBN: (纸本)157735897X

Video-based human pose estimation has long been a fundamental yet challenging problem in computer vision. Previous studies focus on spatio-temporal modeling through the enhancement of architecture design and optimization strategies. However, they overlook the causal relationships in the joints, leading to models that may be overly tailored and thus estimate poorly to challenging scenes. Therefore, adequate causal reasoning capability, coupled with good interpretability of model, are both indispensable and prerequisite for achieving reliable results. In this paper, we pioneer a causal perspective on pose estimation and introduce a causal-inspired multitask learning framework, consisting of two stages. In the first stage, we try to endow the model with causal spatio-temporal modeling ability by introducing two self-supervision auxiliary tasks. Specifically, these auxiliary tasks enable the network to infer challenging keypoints based on observed keypoint information, thereby imbuing causal reasoning capabilities into the model and making it robust to challenging scenes. In the second stage, we argue that not all feature tokens contribute equally to pose estimation. Prioritizing causal (keypoint-relevant) tokens is crucial to achieve reliable results, which could improve the interpretability of the model. To this end, we propose a Token Causal Importance Selection module to identify the causal tokens and non-causal tokens (e.g., background and objects). Additionally, non-causal tokens could provide potentially beneficial cues but may be redundant. We further introduce a non-causal tokens clustering module to merge the similar non-causal tokens. Extensive experiments show that our method outperforms state-of-the-art methods on three large-scale benchmark datasets. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Multi-task learning

Graph-based exercise- And knowledge-aware learning network for student performance prediction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Mengfan Shao, Pengyang Zhang, Kun Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

Predicting student performance is a fundamental task in Intelligent Tutoring Systems (ITSs), by which we can learn about students' knowledge level and provide personalized teaching strategies for them. Researchers have made plenty of efforts on this task. They either leverage educational psychology methods to predict students' scores according to the learned knowledge proficiency, or make full use of Collaborative Filtering (CF) models to represent latent factors of students and exercises. However, most of these methods either neglect the exercise-specific characteristics (e.g., exercise materials), or cannot fully explore the high-order interactions between students, exercises, as well as knowledge concepts. To this end, we propose a Graph-based Exercise- and knowledge-Aware Learning Network for accurate student score prediction. Specifically, we learn students' mastery of exercises and knowledge concepts respectively to model the two-fold effects of exercises and knowledge concepts. Then, to model the high-order interactions, we apply graph convolution techniques in the prediction process. Extensive experiments on two real-world datasets prove the effectiveness of our proposed Graph-EKLN. Copyright © 2021, The Authors. All rights reserved.

关键词： Students

CLDG: Contrastive Learning on Dynamic Graphs

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

International Conference on data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Stru...

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

Hybrid Local Causal Discovery

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ling, Zhaolong Peng, Honghui Zhang, Yiwen Zhou, Peng Wu, Xingyu Yu, Kui Wu, Xindong School of Computer Science and Technology Anhui University Anhui Hefei230601 China School of Hong Kong Polytechnic University Department of Computing 999077 Hong Kong Key Laboratory of Knowledge Engineering with Big Data the Ministry of Education of China China School of Computer Science and Information Technology Hefei University of Technology Hefei230009 China

Local causal discovery aims to learn and distinguish the direct causes and effects of a target variable from observed data. Existing constraint-based local causal discovery methods use AND or OR rules in constructing the local causal skeleton, but using either rule alone is prone to produce cascading errors in the learned local causal skeleton, and thus impacting the inference of local causal relationships. On the other hand, directly applying score-based global causal discovery methods to local causal discovery may randomly return incorrect results due to the existence of local equivalence classes. To address the above issues, we propose a Hybrid Local Causal Discovery algorithm, called HLCD. Specifically, HLCD initially utilizes a constraint-based approach combined with the OR rule to obtain a candidate skeleton and then employs a score-based method to eliminate redundant portions in the candidate skeleton. Furthermore, during the local causal orientation phase, HLCD distinguishes between V-structures and equivalence classes by comparing the local structure scores between the two, thereby avoiding orientation interference caused by local equivalence classes. We conducted extensive experiments with seven state-of-the-art competitors on 14 benchmark Bayesian network datasets, and the experimental results demonstrate that HLCD significantly outperforms existing local causal discovery algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词：

Generative AI for Deep Reinforcement Learning: Framework, Analysis, and Use Cases

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Xie, Wenwen Niyato, Dusit Mei, Fang Kang, Jiawen Du, Hongyang Mao, Shiwen College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore School of Automation Guangdong University of Technology Guangzhou510006 China Department of Electrical and Electronic Engineering The University of Hong Kong 999077 Hong Kong Department of Electrical and Computer Engineering Auburn University Auburn36830 United States

As a form of artificial intelligence (AI) technology based on interactive learning, deep reinforcement learning (DRL) has been widely applied across various fields and has achieved remarkable accomplishments. However, DRL faces certain limitations, including low sample efficiency and poor generalization. Therefore, we present how to leverage generative AI (GAI) to address these issues above and enhance the performance of DRL algorithms in this paper. We first introduce several classic GAI and DRL algorithms and demonstrate the applications of GAI-enhanced DRL algorithms. Then, we discuss how to use GAI to improve DRL algorithms from the data and policy perspectives. Subsequently, we introduce a framework that demonstrates an actual and novel integration of GAI with DRL, i.e., GAI-enhanced DRL. Additionally, we provide a case study of the framework on UAV-assisted integrated near-field/far-field communication to validate the performance of the proposed framework. Moreover, we present several future directions. Finally, the related code is available at: https://***/GAI-enhanced-DRL. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep reinforcement learning