文章基本信息

标题：A New Approach to Mine Frequent Pattern in Spatial Database using TFP-Tree
本地全文：下载
作者：Kedar Nath Singh ; Jitendra Agrawal ; Sanjeev Sharma 等
期刊名称：International Journal of Computer Technology and Applications
电子版ISSN：2229-6093
出版年度：2011
卷号：2
期号：4
页码：1062-1068
出版社：Technopark Publications
摘要：Today there are several skilled algorithms to mine frequent patterns. Frequent item set mining provides the associations and correlations among items in large transactional or relational database. In this paper a new approach to mine frequent pattern in spatial database using TFP-tree is proposed. The proposed approach generates a TFP-tree that specifies the generations of frequent patterns. Our analysis approach generates maximal frequent patterns and performs only minimal generalizations of frequent candidate sets
关键词：Spatial Database; Ordered List; Maximal Frequent Pattern; Closed Frequent Pattern