向量度:共同定位模式的一般相似度量

Pingping Wu, Lizhen Wang, Muquan Zou
{"title":"向量度:共同定位模式的一般相似度量","authors":"Pingping Wu, Lizhen Wang, Muquan Zou","doi":"10.1109/ICBK.2019.00045","DOIUrl":null,"url":null,"abstract":"Co-location pattern mining is one of the hot issues in spatial pattern mining. Similarity measures between co-location patterns can be used to solve problems such as pattern compression, pattern summarization, pattern selection and pattern ordering. Although, many researchers have focused on this issue recently and provided a more concise set of co-location patterns based on these measures. Unfortunately, these measures suffer from various weaknesses, e.g., some measures can only calculate the similarity between super-pattern and sub-pattern while some others require additional domain knowledge. In this paper, we propose a general similarity measure for any two co-location patterns. Firstly, we study the characteristics of the co-location pattern and present a novel representation model based on maximal cliques. Then, two materializations of the maximal clique and the pattern relationship, 0-1 vector and key-value vector, are proposed and discussed in the paper. Moreover, based on the materialization methods, the similarity measure, Vector-Degree, is defined by applying the cosine similarity. Finally, similarity is used to group the patterns by a hierarchical clustering algorithm. The experimental results on both synthetic and real world data sets show the efficiency and effectiveness of our proposed method.","PeriodicalId":383917,"journal":{"name":"2019 IEEE International Conference on Big Knowledge (ICBK)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Vector-Degree: A General Similarity Measure for Co-location Patterns\",\"authors\":\"Pingping Wu, Lizhen Wang, Muquan Zou\",\"doi\":\"10.1109/ICBK.2019.00045\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Co-location pattern mining is one of the hot issues in spatial pattern mining. Similarity measures between co-location patterns can be used to solve problems such as pattern compression, pattern summarization, pattern selection and pattern ordering. Although, many researchers have focused on this issue recently and provided a more concise set of co-location patterns based on these measures. Unfortunately, these measures suffer from various weaknesses, e.g., some measures can only calculate the similarity between super-pattern and sub-pattern while some others require additional domain knowledge. In this paper, we propose a general similarity measure for any two co-location patterns. Firstly, we study the characteristics of the co-location pattern and present a novel representation model based on maximal cliques. Then, two materializations of the maximal clique and the pattern relationship, 0-1 vector and key-value vector, are proposed and discussed in the paper. Moreover, based on the materialization methods, the similarity measure, Vector-Degree, is defined by applying the cosine similarity. Finally, similarity is used to group the patterns by a hierarchical clustering algorithm. The experimental results on both synthetic and real world data sets show the efficiency and effectiveness of our proposed method.\",\"PeriodicalId\":383917,\"journal\":{\"name\":\"2019 IEEE International Conference on Big Knowledge (ICBK)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE International Conference on Big Knowledge (ICBK)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBK.2019.00045\",\"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 Conference on Big Knowledge (ICBK)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBK.2019.00045","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

同址模式挖掘是空间模式挖掘中的热点问题之一。共定位模式之间的相似性度量可用于解决模式压缩、模式总结、模式选择和模式排序等问题。尽管最近许多研究人员都在关注这个问题,并在这些度量的基础上提供了一套更简洁的共址模式。不幸的是,这些度量存在各种弱点,例如,一些度量只能计算超级模式和子模式之间的相似性,而另一些度量则需要额外的领域知识。在本文中,我们提出了一个通用的相似性度量任意两个共位模式。首先,研究了同位模式的特点,提出了一种基于最大团的同位模式表示模型。然后,提出并讨论了极大团及其模式关系的两种物化形式:0-1向量和键值向量。在物化方法的基础上,利用余弦相似度定义了相似度度量向量度。最后,利用相似度对模式进行分层聚类。在合成数据集和实际数据集上的实验结果表明了我们提出的方法的效率和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Vector-Degree: A General Similarity Measure for Co-location Patterns
Co-location pattern mining is one of the hot issues in spatial pattern mining. Similarity measures between co-location patterns can be used to solve problems such as pattern compression, pattern summarization, pattern selection and pattern ordering. Although, many researchers have focused on this issue recently and provided a more concise set of co-location patterns based on these measures. Unfortunately, these measures suffer from various weaknesses, e.g., some measures can only calculate the similarity between super-pattern and sub-pattern while some others require additional domain knowledge. In this paper, we propose a general similarity measure for any two co-location patterns. Firstly, we study the characteristics of the co-location pattern and present a novel representation model based on maximal cliques. Then, two materializations of the maximal clique and the pattern relationship, 0-1 vector and key-value vector, are proposed and discussed in the paper. Moreover, based on the materialization methods, the similarity measure, Vector-Degree, is defined by applying the cosine similarity. Finally, similarity is used to group the patterns by a hierarchical clustering algorithm. The experimental results on both synthetic and real world data sets show the efficiency and effectiveness of our proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信