QQ客服 官方微博 反馈留言

	On efficiently summarizing categorical databases
	Wang, JY ; Karypis, G
	2010-05-06 ; 2010-05-06
关键词	data mining frequent itemset categorical database clustering ALGORITHM Computer Science, Artificial Intelligence Computer Science, Information Systems
中文摘要	Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its application to transaction or document clustering. However, most of the frequent itemset based clustering algorithms need to first mine a large intermediate set of frequent itemsets in order to identify a subset of the most promising ones that can be used for clustering. In this paper, we study how to directly find a subset of high quality frequent itemsets that can be used as a concise summary of the transaction database and to cluster the categorical data. By exploring key properties of the subset of itemsets that we are interested in, we proposed several search space pruning methods and designed an efficient algorithm called SUMMARY. Our empirical results show that SUMMARY runs very fast even when the minimum support is extremely low and scales very well with respect to the database size, and surprisingly, as a: pure frequent itemset mining algorithm it is very effective in clustering the categorical data and summarizing the dense transaction databases.
语种	英语 ; 英语
出版者	SPRINGER LONDON LTD ; GODALMING ; SWEETAPPLE HOUSE CATTESHALL ROAD, GODALMING GU7 3DJ, SURREY, ENGLAND
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/10241]
专题	清华大学
推荐引用方式 GB/T 7714	Wang, JY,Karypis, G. On efficiently summarizing categorical databases[J],2010, 2010.
APA	Wang, JY,&Karypis, G.(2010).On efficiently summarizing categorical databases..
MLA	Wang, JY,et al."On efficiently summarizing categorical databases".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。