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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Culture versus Policy: More Global Collaboration to Effectively Combat COVID-19

引用

The Innovation 2020年第2期1卷 15-16页

作者： Jianping Li Kun Guo Enrique Herrera Viedma Heesoek Lee Jiming Liu Ning Zhong Luiz Flavio Autran Monteiro Gomes Florin Gheorghe Filip Shu-Cherng Fang Mujgan SagirÖzdemir Xiaohui Liu Guoqing Lu Yong Shi School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijing 100190China Research Center on Fictitious Economy&Data Science Chinese Academy of SciencesBeijing 100190China Department of Computer Science and Artificial Intelligence E.T.S.de Ingenieria Informatica y de TelecomunicacionesUniversity of Granada18071 GranadaSpain Department of Information Management Korea Advanced Institute of Science and TechnologySeoul 207-43 Korea Department of Computer Science and HKBU-CSD&NIPD Joint Research Laboratory for Intelligent Disease Surveillance and Control Hong Kong Baptist UniversityHong KongChina Department of Life Science and Informatics Maebashi Institute of TechnologyMaebashi 371-0816Japan Ibmec University Center Av.Presidente Wilson118Office#111020030-020 Rio de JaneiroBrazil The Romanian Academy Bucharest010071Romania Industrial and Systems Engineering Department North Carolina State UniversityRaleighNC 27695USA Department of Industrial Engineering Eskisehir Osmangazi University26480 EskisehirTurkey Department of Computer Science Brunel University LondonLondonUB83PHUK Department of Biology and School of Interdisciplinary Informatics University of Nebraska at OmahaOmahaNE 68182USA College of Information Science and Technology University of Nebraska at OmahaOmahaNE 68182USA

The outbreak of COVID-19 seriously challenges every government with regard to capacity and management of public health systems facing the catastrophic *** and anti-epidemic policy do not necessarily conflict with each *** countries and governments should be more tolerant to each other in seeking cultural and political consensus to overcome this historically tragic pandemic together.

关键词： seeking overcome policy

来源：评论

学校读者我要写书评

暂无评论

s-LWSR: Super lightweight super-resolution network

arXiv

引用

arXiv 2019年

作者： Li, Biao Liu, Jiabin Wang, Bo Qi, Zhiquan Shi, Yong School of Economics and Management University of Chinese Academy of Sciences Beijing101408 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Information Technology and Management University of International Business and Economics Beijing100029 China Department of Computer Science and Engineering Texas A&M University College StationTX77843 United States College of Information Science and Technology University of Nebraska OmahaNE68182 United States

Deep learning (DL) architectures for super-resolution (SR) normally contain tremendous parameters, which has been regarded as the crucial advantage for obtaining satisfying performance. However, with the widespread use of mobile phones for taking and retouching photos, this character greatly hampers the deployment of DL-SR models on the mobile devices. To address this problem, in this paper, we propose a super lightweight SR network: s-LWSR. There are mainly three contributions in our work. Firstly, in order to efficiently abstract features from the low resolution image, we build an information pool to mix multi-level information from the first half part of the pipeline. Accordingly, the information pool feeds the second half part with the combination of hierarchical features from the previous layers. Secondly, we employ a compression module to further decrease the size of parameters. Intensive analysis confirms its capacity of trade-off between model complexity and accuracy. Thirdly, by revealing the specific role of activation in deep models, we remove several activation layers in our SR model to retain more information for performance improvement. Extensive experiments show that our s-LWSR, with limited parameters and operations, can achieve similar performance to other cumbersome DL-SR methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

Disentangled Cascaded Graph Convolution Networks for Multi-Behavior Recommendation

arXiv

引用

arXiv 2024年

作者： Cheng, Zhiyong Dong, Jianhua Liu, Fan Zhu, Lei Yang, Xun Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology No. 485 Danxia Road Anhui Hefei230009 China Shandong Artificial Intelligence Institute Qilu University of Technology Shandong Academy of Sciences No. 19 Keyuan Road Shandong Jinan250014 China School of Computing National University of Singapore 21 Lower Kent Ridge Road Singapore119077 Singapore School of Electronic and Information Engineering University of Tongji No. 4800 Caoan Road Shanghai201804 China School of Information Science and Technology University of Science and Technology of China No. 443 Huangshan Road Anhui Hefei230027 China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Institute of Artificial Intelligence Hefei Comprehensive National Science Centery No. 485 Danxia Road Anhui Hefei230009 China

Multi-behavioral recommender systems have emerged as a solution to address data sparsity and cold-start issues by incorporating auxiliary behaviors alongside target behaviors. However, existing models struggle to accurately capture varying user preferences across different behaviors and fail to account for diverse item preferences within behaviors. Various user preference factors (such as price or quality) entangled in the behavior may lead to sub-optimization problems. Furthermore, these models overlook the personalized nature of user behavioral preferences by employing uniform transformation networks for all users and items. To tackle these challenges, we propose the Disentangled Cascaded Graph Convolutional Network (Disen-CGCN), a novel multi-behavior recommendation model. Disen-CGCN employs disentangled representation techniques to effectively separate factors within user and item representations, ensuring their independence. In addition, it incorporates a multi-behavioral meta-network, enabling personalized feature transformation across user and item behaviors. Furthermore, an attention mechanism captures user preferences for different item factors within each behavior. By leveraging attention weights, we aggregate user and item embeddings separately for each behavior, computing preference scores that predict overall user preferences for items. Our evaluation on benchmark datasets demonstrates the superiority of Disen-CGCN over state-of-the-art models, showcasing an average performance improvement of 7.07% and 9.00% on respective datasets. These results highlight Disen-CGCN’s ability to effectively leverage multi-behavioral data, leading to more accurate recommendations. Copyright © 2024, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Graph Pattern Matching via Tumor knowledge Graph

引用

ACM Transactions on Probabilistic Machine Learning 1000年

作者： Lei Li Houdie Tu Zhenchao Tao Chenyang Bu Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230601 China and School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China School of Data Science University of Science and Technology of China Hefei 230052 China and West District of the First Affiliated Hospital of University of Science and Technology of China Hefei 230031 China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230601 China

Graph Pattern Matching (GPM) entails the identification of subgraphs within a larger graph structure that either precisely mirror or closely parallel a predefined pattern graph. Despite the fact that research on GPM in large-scale graph data has been largely centered on social network analysis or enhancing the precision and efficiency of matching algorithms for expeditious subgraph retrieval, there is a noticeable absence of studies committed to probing GPM in medical domains. To rectify this shortcoming and probe the potential of GPM in clinical contexts, particularly in aiding patients with the selection of optimal tumor treatment plans, this paper introduces the concept of probabilistic graph pattern matching specifically modified for the Tumor knowledge Graph (TKG). We propose a multi-constraint graph pattern matching algorithm, hereinafter designated as TKG-McGPM, customized for the Tumor knowledge Graph. Through experimental verification, we establish that TKG-McGPM can facilitate more efficient and informed decision-making in tumor treatment planning.

关键词： Graph Pattern Matching Probabilistic Graph Pattern Matching Tumor knowledge Graph Monte Carlo Method

来源：评论

学校读者我要写书评

暂无评论

Multilingual Focused Crawler System based on Web Content Extraction and Path Configuration

引用

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

作者： Jie Wang Sanhong Deng Lijuan Wang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service (Nanjing University) Nanjing 210023 China Geological Survey of Jiangsu Province Nanjing 210018 China

The multilingual focused crawler system combines web content extraction with path configuration to make use of their advantages and achieve automatic collection of network information in multiple languages. Firstly, system selects foreign language keywords according to crawling webpage language and Chinese keywords, and uses initial link to obtain webpage information. Then, it uses path configuration information or web content extraction algorithm based on the distribution line block to get webpage content, and adopts rules or configuration information to acquire new links, published time and title. Next, keywords are used to filter irrelevant information. Finally, results are presented as a list. When users use focused crawler system, the webpage path information can be configured or not according to requirements, and the collected network resources can also be searched or filtered.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A broadcasting multiple blind signature scheme based on quantum GHZ entanglement

引用

International Journal of Modern Physics: Conference Series 2014年第33期ijmpcs卷

作者： Yuan Tian Hong Chen Yan Gao Honglin Zhuang Haigang Lian Zhengping Han Peng Yu Xiangze Kong Xiaojun Wen Key Laboratory of Data Engineering and Knowledge Engineering China (Remin University of China) of Ministry of Education Beijing 100872 China School of Information Renmin University of China Beijing 100872 China China Computer User Association Information Protection Branch Beijing 100089 China School of Computer Science and Engineering Beihang University Beijing 100083 China School of Electronics & Information Engineering Shenzhen Polytechnic Shenzhen 518055 China

Using the correlation of the GHZ triplet states, a broadcasting multiple blind signature scheme is proposed. Different from classical multiple signature and current quantum signature schemes, which could only deliver either multiple signature or unconditional security, our scheme guarantees both by adopting quantum key preparation, quantum encryption algorithm and quantum entanglement. Our proposed scheme has the properties of multiple signature, blindness, non-disavowal, non-forgery and traceability. To the best of our knowledge, we are the first to propose the broadcasting multiple blind signature of quantum cryptography.

关键词： Broadcasting multiple blind signature quantum encryption algorithm quantum entanglement quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Do we measure novelty when we analyze unusual combinations of cited references? A validation study of bibliometric novelty indicators based on F1000Prime data” [Journal of Informetrics 13/4 (2019) 100979]

引用

Journal of Informetrics 2024年第3期18卷

作者： Lutz Bornmann Alexander Tekles Helena H. Zhang Fred Y. Ye Science Policy and Strategy Department Administrative Headquarters of the Max Planck Society Hofgartenstr. 8 80539 Munich Germany University of Passau Innstr. 41 94032 Passau Germany Jiangsu Key Laboratory of Data Engineering and Knowledge Service School of Information Management Nanjing University Nanjing 210023 China

来源：评论

学校读者我要写书评

暂无评论

基于主题语义的非合作结构化Top-N深网数据源选择

基于主题语义的非合作结构化Top-N深网数据源选择

引用

第29届中国数据库学术会议

作者： Deng Song 邓松 Wan Changxuan 万常选 Liu Xiping 刘喜平 Jiang Tengjiao 江腾蛟 Lei Gang 雷刚 School of Information and Technology Jiangxi University of Finance and Economics Nanchang 330013 江西财经大学信息管理学院南昌 330013 Jiangxi Key Laboratory of Data and Knowledge Engineering Jiangxi University of Finance and Economic 江西财经大学数据与知识工程江西省高校重点实验室南昌 330013

高效且准确地找出存在于深网中的与用户查询意图最相关的Top-N元组，是深网数据集成中的关键问题。针对数据源内容概括未见成果的现状，本文提出了一种能够有效概括非数字、非离散属性特征的非合作结构化深网数据源摘要构建方法。利用... 详细信息

高效且准确地找出存在于深网中的与用户查询意图最相关的Top-N元组，是深网数据集成中的关键问题。针对数据源内容概括未见成果的现状，本文提出了一种能够有效概括非数字、非离散属性特征的非合作结构化深网数据源摘要构建方法。利用主题词抽样，依据主题语义选择与主题词相关的特征词，通过主题词及特征词构建数据源语义摘要。实验结果表明与传统的基于词频的方法相比较，该方法在召回率及准确度方面均有较大幅度的提升。

关键词：深网数据集成检索系统优化设计信息提取主题语义

来源：评论

学校读者我要写书评

暂无评论

Linked data Crowdsourcing Quality Assessment based on Domain Professionalism

引用

Journal of Physics: Conference Series 2019年第5期1187卷

作者： Lu Yang Li Huang Zhenzhen Liu School of Computer Science and Technology Wuhan University of Science and Technology Wuhan 430065 China Key Laboratory of Intelligent Information Processing and Real-time Industrial System in Hubei Province Wuhan 430065 China Institute of Big Data Science and Engineering Wuhan University of Science and Technology Wuhan 430065 China Key Laboratory of Rich-media Knowledge Organization and Service of Digital Publishing Content National Press and Publication Administration Beijing 100038 China

With the rapid development of Internet technology, crowdsourcing, as a flexible, effective and low-cost problem-solving method, has begun to receive more and more attention. The use of crowdsourcing to evaluate the quality of linked data has also become a research hotspot. This paper proposes the concept of Domain Specialization Test (DST), which uses domain professional testing tasks DSTs to evaluate the professionalism of workers, and combines the idea of Mini-batch Gradient Descent (MBGD) to improve the EM algorithm, and the MBEM algorithm is proposed to achieve efficient and accurate evaluation of task results. The experimental results show that the proposed method can screen out the appropriate workers for the linked data crowdsourcing task and improve the accuracy and iteration efficiency of the results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：