{"title":"社交网络中分布式数据间关系搜索的新方法","authors":"Serhiy Mashkovskyi","doi":"10.1109/PICST47496.2019.9061525","DOIUrl":null,"url":null,"abstract":"This paper describes the author's algorithm for semantic search of related data in large text arrays, as well as the development of a program for its approbation. The algorithm has been tested in several commonly known social networks. The research technique is described, the analysis of the results is carried out, and the disadvantages found are indicated. Further directions of the algorithm development are suggested, as well as possible spheres of its application are described.","PeriodicalId":6764,"journal":{"name":"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","volume":"184 1","pages":"129-132"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New Approaches to Search the Relations Between Distributed Data in Social Networks\",\"authors\":\"Serhiy Mashkovskyi\",\"doi\":\"10.1109/PICST47496.2019.9061525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the author's algorithm for semantic search of related data in large text arrays, as well as the development of a program for its approbation. The algorithm has been tested in several commonly known social networks. The research technique is described, the analysis of the results is carried out, and the disadvantages found are indicated. Further directions of the algorithm development are suggested, as well as possible spheres of its application are described.\",\"PeriodicalId\":6764,\"journal\":{\"name\":\"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)\",\"volume\":\"184 1\",\"pages\":\"129-132\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICST47496.2019.9061525\",\"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 IEEE International Scientific-Practical Conference Problems of Infocommunications, Science and Technology (PIC S&T)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICST47496.2019.9061525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Approaches to Search the Relations Between Distributed Data in Social Networks
This paper describes the author's algorithm for semantic search of related data in large text arrays, as well as the development of a program for its approbation. The algorithm has been tested in several commonly known social networks. The research technique is described, the analysis of the results is carried out, and the disadvantages found are indicated. Further directions of the algorithm development are suggested, as well as possible spheres of its application are described.