Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Image Mining: Trends and Developments
Journal of Intelligent Information Systems
Data Mining: An Overview from a Database Perspective
IEEE Transactions on Knowledge and Data Engineering
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
IEEE Transactions on Knowledge and Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovering Association Rules Based on Image Content
ADL '99 Proceedings of the IEEE Forum on Research and Technology Advances in Digital Libraries
Mining Recurrent Items in Multimedia with Progressive Resolution Refinement
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Fast signature-based color-spatial image retrieval
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
DisIClass: discriminative frequent pattern-based image classification
Proceedings of the Tenth International Workshop on Multimedia Data Mining
Hi-index | 0.00 |
Mining useful patterns in image databases can not only reveal useful information to users but also help the task of data management. In this paper, we propose an image mining framework, Frequent Spatial Pattern mining in images (FSP), to mine frequent patterns located in a pair of spatial locations of images. A pattern in the FSP is associated with a pair of spatial locations and refers to the occurrence of the same image content in a set of images. This framework is designed to be general so as to accept different levels of representations of image content and different layout forms of spatial representations.