{"title":"Cleansing Noisy City Names in Spatial Data Mining","authors":"SeungJin Lim","doi":"10.1109/ICISA.2010.5480390","DOIUrl":null,"url":null,"abstract":"One of the biggest adversaries to data mining from a large data warehouse is poor data quality. It is because most data mining algorithms have been designed based on the assumption that the data is clean and meaningful. Hence, poor data quality may lead to completely unexpected results. In this paper, an automatic city name correction algorithm is proposed to cleanse a large spatial database without requiring human intervention or a prior knowledge of the context. The algorithm achieves a precision of 96.6% which is significantly better than the 86.6% of the traditional Levenshtein distance and the 92% of the Longest Common Subsequence algorithm.","PeriodicalId":313762,"journal":{"name":"2010 International Conference on Information Science and Applications","volume":"24 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2010.5480390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
One of the biggest adversaries to data mining from a large data warehouse is poor data quality. It is because most data mining algorithms have been designed based on the assumption that the data is clean and meaningful. Hence, poor data quality may lead to completely unexpected results. In this paper, an automatic city name correction algorithm is proposed to cleanse a large spatial database without requiring human intervention or a prior knowledge of the context. The algorithm achieves a precision of 96.6% which is significantly better than the 86.6% of the traditional Levenshtein distance and the 92% of the Longest Common Subsequence algorithm.