在SDSS SkyServer空间数据库中挖掘复杂关系

Bavani Arunasalam, S. Chawla, Pei Sun, Robert Munro
{"title":"在SDSS SkyServer空间数据库中挖掘复杂关系","authors":"Bavani Arunasalam, S. Chawla, Pei Sun, Robert Munro","doi":"10.1109/CMPSAC.2004.1342697","DOIUrl":null,"url":null,"abstract":"We describe the process of mining complex relationships in spatial databases using the maximal participation index (maxPI), which has a property of discovering low support and high confidence rules. Complex relationships are defined as those involving two or more of: multifeature co-location, self-co-location, one-to many relationships, self-exclusion and multifeature exclusion. We report our results of mining complex relationships in data extracted from the Sloan Digital Sky Survey (SDSS) database.","PeriodicalId":355273,"journal":{"name":"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Mining complex relationships in the SDSS SkyServer spatial database\",\"authors\":\"Bavani Arunasalam, S. Chawla, Pei Sun, Robert Munro\",\"doi\":\"10.1109/CMPSAC.2004.1342697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the process of mining complex relationships in spatial databases using the maximal participation index (maxPI), which has a property of discovering low support and high confidence rules. Complex relationships are defined as those involving two or more of: multifeature co-location, self-co-location, one-to many relationships, self-exclusion and multifeature exclusion. We report our results of mining complex relationships in data extracted from the Sloan Digital Sky Survey (SDSS) database.\",\"PeriodicalId\":355273,\"journal\":{\"name\":\"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPSAC.2004.1342697\",\"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 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.2004.1342697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

利用最大参与指数(maxPI)描述了空间数据库中复杂关系的挖掘过程,maxPI具有发现低支持度和高置信度规则的特性。复杂关系是指涉及两种或两种以上的关系:多特征共置关系、自共置关系、一对多关系、自排斥关系和多特征排斥关系。我们报告了从斯隆数字巡天(SDSS)数据库中提取的数据中挖掘复杂关系的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining complex relationships in the SDSS SkyServer spatial database
We describe the process of mining complex relationships in spatial databases using the maximal participation index (maxPI), which has a property of discovering low support and high confidence rules. Complex relationships are defined as those involving two or more of: multifeature co-location, self-co-location, one-to many relationships, self-exclusion and multifeature exclusion. We report our results of mining complex relationships in data extracted from the Sloan Digital Sky Survey (SDSS) database.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信