{"title":"链接和瓶颈链接集功能和多分辨率结构集群","authors":"B. Mirkin, I. Muchnik","doi":"10.1109/ISIC.1999.796655","DOIUrl":null,"url":null,"abstract":"A method for structural clustering is proposed based on information about entity-to-set interactions that can be easily collected in digitalized images. The method is based on the multiscale structure of the problem of maximization of a so-called bottleneck link function, which can be globally solved with a greedy-wise algorithm. Extension of the construction to clusters consisting of \"hard\" cores and dispersed \"shells\" is proposed.","PeriodicalId":300130,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Link and bottleneck link set functions and multiresolution structural clusters\",\"authors\":\"B. Mirkin, I. Muchnik\",\"doi\":\"10.1109/ISIC.1999.796655\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A method for structural clustering is proposed based on information about entity-to-set interactions that can be easily collected in digitalized images. The method is based on the multiscale structure of the problem of maximization of a so-called bottleneck link function, which can be globally solved with a greedy-wise algorithm. Extension of the construction to clusters consisting of \\\"hard\\\" cores and dispersed \\\"shells\\\" is proposed.\",\"PeriodicalId\":300130,\"journal\":{\"name\":\"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.1999.796655\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Symposium on Intelligent Control Intelligent Systems and Semiotics (Cat. No.99CH37014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.1999.796655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Link and bottleneck link set functions and multiresolution structural clusters
A method for structural clustering is proposed based on information about entity-to-set interactions that can be easily collected in digitalized images. The method is based on the multiscale structure of the problem of maximization of a so-called bottleneck link function, which can be globally solved with a greedy-wise algorithm. Extension of the construction to clusters consisting of "hard" cores and dispersed "shells" is proposed.