期刊引文网络的归一化谱聚类

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) Pub Date : 2019-08-01 DOI:10.1109/OPCS.2019.8880205

S. Bredikhin, N. Scherbakova

{"title":"期刊引文网络的归一化谱聚类","authors":"S. Bredikhin, N. Scherbakova","doi":"10.1109/OPCS.2019.8880205","DOIUrl":null,"url":null,"abstract":"The task of clustering of a set of objects is treated as the graph partitioning problem. The normalized cut criterion is used for a weighted graph partitioning and the approach is applied in two implemented algorithms. The results of testing the method for the journal citation network clustering are presented.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Normalized Spectral Clustering of the Journal Citation Network\",\"authors\":\"S. Bredikhin, N. Scherbakova\",\"doi\":\"10.1109/OPCS.2019.8880205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The task of clustering of a set of objects is treated as the graph partitioning problem. The normalized cut criterion is used for a weighted graph partitioning and the approach is applied in two implemented algorithms. The results of testing the method for the journal citation network clustering are presented.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

一组对象的聚类任务被视为图划分问题。将归一化切准则用于加权图划分，并将该方法应用于两种实现算法中。给出了该方法在期刊引文网络聚类中的测试结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Normalized Spectral Clustering of the Journal Citation Network

The task of clustering of a set of objects is treated as the graph partitioning problem. The normalized cut criterion is used for a weighted graph partitioning and the approach is applied in two implemented algorithms. The results of testing the method for the journal citation network clustering are presented.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

自引率

0.00%

发文量