{"title":"论基于图的社会网络分析的正确性","authors":"Mārtiņš Opmanis","doi":"10.22364/BJMC.2019.7.2.06","DOIUrl":null,"url":null,"abstract":"As a branch of network science, social network analysis widely uses graph techniques. Only in rare cases are results obtained from the graph models validated against “ground truth” and are directly applicable to objects in the investigated domain. Like extraneous solutions in mathematics, ungrounded mechanistic analogies, incorrect interpretation of indirect ties for intransitive relations and use of the “path” concept for social networks may lead to noninvertible results with no evidence outside the used graph model. The author investigates unimodal networks with dyadic ties, provides several examples of correct and incorrect applications and recovers the roots of incorrectness.","PeriodicalId":431209,"journal":{"name":"Balt. J. Mod. Comput.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"About Correctness of Graph-Based Social Network Analysis\",\"authors\":\"Mārtiņš Opmanis\",\"doi\":\"10.22364/BJMC.2019.7.2.06\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As a branch of network science, social network analysis widely uses graph techniques. Only in rare cases are results obtained from the graph models validated against “ground truth” and are directly applicable to objects in the investigated domain. Like extraneous solutions in mathematics, ungrounded mechanistic analogies, incorrect interpretation of indirect ties for intransitive relations and use of the “path” concept for social networks may lead to noninvertible results with no evidence outside the used graph model. The author investigates unimodal networks with dyadic ties, provides several examples of correct and incorrect applications and recovers the roots of incorrectness.\",\"PeriodicalId\":431209,\"journal\":{\"name\":\"Balt. J. Mod. Comput.\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Balt. J. Mod. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22364/BJMC.2019.7.2.06\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Balt. J. Mod. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22364/BJMC.2019.7.2.06","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
About Correctness of Graph-Based Social Network Analysis
As a branch of network science, social network analysis widely uses graph techniques. Only in rare cases are results obtained from the graph models validated against “ground truth” and are directly applicable to objects in the investigated domain. Like extraneous solutions in mathematics, ungrounded mechanistic analogies, incorrect interpretation of indirect ties for intransitive relations and use of the “path” concept for social networks may lead to noninvertible results with no evidence outside the used graph model. The author investigates unimodal networks with dyadic ties, provides several examples of correct and incorrect applications and recovers the roots of incorrectness.