Jinmao Wei, Shuqin Wang, Wei Zheng, Jing Wang, Junping You, Jie Zhang, Dan Liu
{"title":"结构信息相似性测量","authors":"Jinmao Wei, Shuqin Wang, Wei Zheng, Jing Wang, Junping You, Jie Zhang, Dan Liu","doi":"10.1109/GRC.2006.1635770","DOIUrl":null,"url":null,"abstract":"Measuring structural similarities is attracting more and more attention from researchers. In this paper, we define structural information content (SIC) for measuring the structural information of a structure, and introduce topological match degree to measure to what extent a subtree is matched. By recursively computing SICs and thus computing topological match degrees, we evaluate the structural information similarities of data trees to pattern tree. In the paper, we present two algorithms for recursively calculating SICs with computation complexity of O(M), and use examples to instantiate the feasibility of the proposed method.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On structural information similarity measurements\",\"authors\":\"Jinmao Wei, Shuqin Wang, Wei Zheng, Jing Wang, Junping You, Jie Zhang, Dan Liu\",\"doi\":\"10.1109/GRC.2006.1635770\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Measuring structural similarities is attracting more and more attention from researchers. In this paper, we define structural information content (SIC) for measuring the structural information of a structure, and introduce topological match degree to measure to what extent a subtree is matched. By recursively computing SICs and thus computing topological match degrees, we evaluate the structural information similarities of data trees to pattern tree. In the paper, we present two algorithms for recursively calculating SICs with computation complexity of O(M), and use examples to instantiate the feasibility of the proposed method.\",\"PeriodicalId\":400997,\"journal\":{\"name\":\"2006 IEEE International Conference on Granular Computing\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRC.2006.1635770\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2006.1635770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Measuring structural similarities is attracting more and more attention from researchers. In this paper, we define structural information content (SIC) for measuring the structural information of a structure, and introduce topological match degree to measure to what extent a subtree is matched. By recursively computing SICs and thus computing topological match degrees, we evaluate the structural information similarities of data trees to pattern tree. In the paper, we present two algorithms for recursively calculating SICs with computation complexity of O(M), and use examples to instantiate the feasibility of the proposed method.