作者: R VYAS , LOKESH KUMAR SHARMA , U TIWARY , None
DOI: 10.3844/JCSSP.2007.882.886
关键词:
摘要: Geographical Decision Support System (Geo-DSS) is a demanding field, since enormous amount of spatial data have been collected in various applications, ranging form Remote Sensing to GIS, Computer Cartography, Environmental Assessment and Planning. Although some efforts were made combine mining with Spatial but mostly researchers for database are using popular approach-Apriori based association rule mining. There two major limitations existing approaches; the biggest being, that typical Apriori same records required be scanned again find out frequent sets. This becomes cumbersome, as already known large size. As far sparse concerned, an may even considered when there dense other approaches giving better performance. Researchers discuss only positive rules; they not negative rules. Negative rules very useful problems capable extracting previously unknown hidden information. this approach makes computation faster, it thus candidate integration into Geo-DSS architectural framework. We tried design particular support system efficient P- Tree T-Tree.