{"title":"带属性广义树的结构相似性","authors":"Mahsa Kiani, V. Bhavsar, H. Boley","doi":"10.1109/ICSC.2014.33","DOIUrl":null,"url":null,"abstract":"Structure-similarity method for attributed generalized trees is proposed. (Meta)data is expressed as a generalized tree, in which inner-vertex labels (as types) and edge labels (as attributes) embody semantic information, while edge weights express assessments regarding the (percentage-)relative importance of the attributes, a kind of pragmatic information added by domain experts. The generalized trees are uniformly represented and interchanged using a weighted extension of Object Oriented RuleML. The recursive similarity algorithm performs a top-down traversal of structures and computes the global similarity of two structures bottom-up considering vertex labels, edge labels, and edge-weight similarities. In order to compare generalized trees having different sizes, the effect of a missing sub-structure on the overall similarity is computed using a simplicity measure. The proposed similarity approach is applied in the retrieval of Electronic Medical Records (EMRs).","PeriodicalId":175352,"journal":{"name":"2014 IEEE International Conference on Semantic Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Structure Similarity of Attributed Generalized Trees\",\"authors\":\"Mahsa Kiani, V. Bhavsar, H. Boley\",\"doi\":\"10.1109/ICSC.2014.33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Structure-similarity method for attributed generalized trees is proposed. (Meta)data is expressed as a generalized tree, in which inner-vertex labels (as types) and edge labels (as attributes) embody semantic information, while edge weights express assessments regarding the (percentage-)relative importance of the attributes, a kind of pragmatic information added by domain experts. The generalized trees are uniformly represented and interchanged using a weighted extension of Object Oriented RuleML. The recursive similarity algorithm performs a top-down traversal of structures and computes the global similarity of two structures bottom-up considering vertex labels, edge labels, and edge-weight similarities. In order to compare generalized trees having different sizes, the effect of a missing sub-structure on the overall similarity is computed using a simplicity measure. The proposed similarity approach is applied in the retrieval of Electronic Medical Records (EMRs).\",\"PeriodicalId\":175352,\"journal\":{\"name\":\"2014 IEEE International Conference on Semantic Computing\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Semantic Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSC.2014.33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Semantic Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSC.2014.33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Structure Similarity of Attributed Generalized Trees
Structure-similarity method for attributed generalized trees is proposed. (Meta)data is expressed as a generalized tree, in which inner-vertex labels (as types) and edge labels (as attributes) embody semantic information, while edge weights express assessments regarding the (percentage-)relative importance of the attributes, a kind of pragmatic information added by domain experts. The generalized trees are uniformly represented and interchanged using a weighted extension of Object Oriented RuleML. The recursive similarity algorithm performs a top-down traversal of structures and computes the global similarity of two structures bottom-up considering vertex labels, edge labels, and edge-weight similarities. In order to compare generalized trees having different sizes, the effect of a missing sub-structure on the overall similarity is computed using a simplicity measure. The proposed similarity approach is applied in the retrieval of Electronic Medical Records (EMRs).