Visual group identification method of technical competitors using LinLog graph clustering algorithm

Hongqi Han, X. An, Donghua Zhu, Xuefeng Wang
{"title":"Visual group identification method of technical competitors using LinLog graph clustering algorithm","authors":"Hongqi Han, X. An, Donghua Zhu, Xuefeng Wang","doi":"10.1109/CSAE.2011.5952550","DOIUrl":null,"url":null,"abstract":"Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Computer Science and Automation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSAE.2011.5952550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Visualization technique is a powerful method used by science and technology intelligence analysis experts to identify technical competitor groups. Common visualization methods tend to create graphs meeting the aesthetic criteria instead of finding better clusters, and their analysis results may provide misleading information. A process model of technical group identification method was presented using LinLog graph clustering algorithm to find better competitor groups. In the model, technical similarity value of each pair of competitors is measured based on their R&D output in sub-fields, and two competitors have a link when they have high similarity value; LinLog algorithm, which is aimed at producing better clusters, was employed to layout graph with competitors as nodes, their links as edges and technology similarity values as weights of edges. Experiment results show the efficiency of presented method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
技术竞争对手的视觉群体识别方法采用LinLog图聚类算法
可视化技术是科技情报分析专家识别技术竞争对手群体的有力手段。常见的可视化方法倾向于创建符合美学标准的图形,而不是寻找更好的聚类,并且它们的分析结果可能提供误导性信息。提出了一种基于LinLog图聚类算法的技术群体识别过程模型,以寻找更好的竞争对手群体。在模型中,每对竞争对手的技术相似值是根据它们在子领域的研发产出来衡量的,当两个竞争对手的相似值高时,它们之间存在联系;采用LinLog算法,以竞争对手为节点,以竞争对手的链接为边,以技术相似度为边的权值,以生成更好的聚类。实验结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visual group identification method of technical competitors using LinLog graph clustering algorithm Overview of 3D textile dynamic simulation research Monotonically decreasing eigenvalue for edge-sharpening diffusion Visual Tracking with adaptive layered-optimizing particles in Multifeature Particle Filtering Framework The fast Viterbi algorithm caching Profile Hidden Markov Models on graphic processing units
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1