使用多路径分析挖掘跨学科轨迹

IF 1.6 Q2 INFORMATION SCIENCE & LIBRARY SCIENCE
H. Lathabai, T. Prabhakaran, Susan George, M. Changat
{"title":"使用多路径分析挖掘跨学科轨迹","authors":"H. Lathabai, T. Prabhakaran, Susan George, M. Changat","doi":"10.1080/09737766.2021.1920066","DOIUrl":null,"url":null,"abstract":"Network analysis is found to be effective for mining various aspects from technological and scientific literature. Path analysis, a major tool in the network analysis trio, consists of two crucial steps-weight assignment and search method. An innovative search scheme namely, key-route search method is found to be capable of retrieving multiple paths. Recently, a framework that explored the power of combined networks or NoNs (Network of networks) for interdisciplinarity assessment was proposed. In this work, a framework that utilizes the strength of NoNs and the integrated approach to path analysis is developed for mining the interdisciplinary trajectories in techno-scientific literature. Among the two major weight assignment schemes such as SPC and FV gradient schemes, FV gradient is found to better leverage key-route search scheme in mining multiple evolutionary trajectories with interdisciplinary interactions. This framework can serve as a handy tool for a multitude of beneficiaries including policy makers.","PeriodicalId":10501,"journal":{"name":"COLLNET Journal of Scientometrics and Information Management","volume":"14 1","pages":"285 - 300"},"PeriodicalIF":1.6000,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/09737766.2021.1920066","citationCount":"0","resultStr":"{\"title\":\"Mining interdisciplinary trajectories using multiple path analysis\",\"authors\":\"H. Lathabai, T. Prabhakaran, Susan George, M. Changat\",\"doi\":\"10.1080/09737766.2021.1920066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network analysis is found to be effective for mining various aspects from technological and scientific literature. Path analysis, a major tool in the network analysis trio, consists of two crucial steps-weight assignment and search method. An innovative search scheme namely, key-route search method is found to be capable of retrieving multiple paths. Recently, a framework that explored the power of combined networks or NoNs (Network of networks) for interdisciplinarity assessment was proposed. In this work, a framework that utilizes the strength of NoNs and the integrated approach to path analysis is developed for mining the interdisciplinary trajectories in techno-scientific literature. Among the two major weight assignment schemes such as SPC and FV gradient schemes, FV gradient is found to better leverage key-route search scheme in mining multiple evolutionary trajectories with interdisciplinary interactions. This framework can serve as a handy tool for a multitude of beneficiaries including policy makers.\",\"PeriodicalId\":10501,\"journal\":{\"name\":\"COLLNET Journal of Scientometrics and Information Management\",\"volume\":\"14 1\",\"pages\":\"285 - 300\"},\"PeriodicalIF\":1.6000,\"publicationDate\":\"2020-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/09737766.2021.1920066\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"COLLNET Journal of Scientometrics and Information Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/09737766.2021.1920066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"INFORMATION SCIENCE & LIBRARY SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"COLLNET Journal of Scientometrics and Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09737766.2021.1920066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"INFORMATION SCIENCE & LIBRARY SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

网络分析可以有效地从科技文献中挖掘各个方面。路径分析是网络分析中的一个重要工具,它包括两个关键步骤——权重分配和搜索方法。提出了一种创新的搜索方案,即键路由搜索方法,能够检索多个路径。最近,提出了一个框架来探索组合网络或NoNs(网络的网络)在跨学科评估中的作用。在这项工作中,利用NoNs的力量和路径分析的综合方法开发了一个框架,用于挖掘技术科学文献中的跨学科轨迹。在两种主要的权重分配方案(SPC和FV梯度方案)中,FV梯度方案能够更好地利用关键路径搜索方案来挖掘具有跨学科相互作用的多进化轨迹。这一框架可以成为包括决策者在内的众多受益者的便捷工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining interdisciplinary trajectories using multiple path analysis
Network analysis is found to be effective for mining various aspects from technological and scientific literature. Path analysis, a major tool in the network analysis trio, consists of two crucial steps-weight assignment and search method. An innovative search scheme namely, key-route search method is found to be capable of retrieving multiple paths. Recently, a framework that explored the power of combined networks or NoNs (Network of networks) for interdisciplinarity assessment was proposed. In this work, a framework that utilizes the strength of NoNs and the integrated approach to path analysis is developed for mining the interdisciplinary trajectories in techno-scientific literature. Among the two major weight assignment schemes such as SPC and FV gradient schemes, FV gradient is found to better leverage key-route search scheme in mining multiple evolutionary trajectories with interdisciplinary interactions. This framework can serve as a handy tool for a multitude of beneficiaries including policy makers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
COLLNET Journal of Scientometrics and Information Management
COLLNET Journal of Scientometrics and Information Management INFORMATION SCIENCE & LIBRARY SCIENCE-
自引率
0.00%
发文量
11
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信