QQ客服 官方微博 反馈留言

	A FP-tree-based method for inverse frequent set mining
	Guo, Yuhong ; Tong, Yuhai ; Tang, Shiwei ; Yang, Dongqing
	2006
英文摘要	Recently, the inverse frequent set mining problem has received more attention because of its important applications in different privacy preserving data sharing contexts. Several studies were reported to probe the NP-complete problem of inverse frequent set mining. However, it is still an open problem that whether there are reasonably efficient search strategies to find a compatible data set in practice. In this paper, we propose a FP-tree-based method for the inverse problem. Compared with previous "generation-and-test" methods, our method is a zero trace back algorithm, which saves huge computational costs. Furthermore, our algorithm provides a good heuristic search strategy to rapidly find a FP-tree, leading to rapidly finding the compatible databases. More importantly, our method can find a set of compatible databases instead of finding only one compatible database in previous methods.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000239454500013&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Artificial Intelligence; Computer Science, Theory & Methods; SCI(E); CPCI-S(ISTP); 3
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/292185]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Guo, Yuhong,Tong, Yuhai,Tang, Shiwei,et al. A FP-tree-based method for inverse frequent set mining. 2006-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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