Paper
28 October 2011 An algorithm of spatial association rules mining used in mobile computing
Chengsheng Tu
Author Affiliations +
Proceedings Volume 8205, 2011 International Conference on Photonics, 3D-Imaging, and Visualization; 82051Q (2011) https://doi.org/10.1117/12.906286
Event: 2011 International Conference on Photonics, 3D-imaging, and Visualization, 2011, Guangzhou, China
Abstract
In order to fast mine spatial association rules and improve efficiency of mobile intelligent system, this paper proposes an algorithm of alternative search spatial association rules mining. The algorithm firstly uses the way of spatial buffer analysis to extract spatial predicate values, and then uses spatial predicate value of every target location to form a spatial transaction and turns it into integer by binary coding, finally uses iteration method of alternative search to extract spatial association rules, namely, not only does it use iteration method of gaining (L-1)-subset of L-non frequent itemsets to generate candidate frequent itemsets, it also uses iteration method of gaining (K+1)-superset of K-frequent itemsets to generate candidate frequent itemsets. The result of simulate experiment indicates that the algorithm is faster and more efficient than present mining algorithms when mining spatial association rules in mobile computing.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chengsheng Tu "An algorithm of spatial association rules mining used in mobile computing", Proc. SPIE 8205, 2011 International Conference on Photonics, 3D-Imaging, and Visualization, 82051Q (28 October 2011); https://doi.org/10.1117/12.906286
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Mining

Binary data

Intelligence systems

Detection and tracking algorithms

Databases

Computing systems

Data mining

Back to Top