ISCAS OpenIR
an improved parallel algorithm for finding frequent item-sets
She CD; Li L; Wang HB; Gao B; Deng HQ
2004
Conference NameInternational Conference on Intelligent Mechatronics and Automation
Pages383-386
Conference DateAUG 26-31,
Conference PlaceChengdu, PEOPLES R CHINA
Indexed Typeistp
Publish Place345 E 47TH ST, NEW YORK, NY 10017 USA
PublisherPROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION
ISBN0-7803-8748-1
DepartmentChinese Acad Sci, Inst Software, Beijing 100080, Peoples R China.
English AbstractDiscovery of associations from large-sets becomes increasingly useful in data-mining field. Several sequential and parallel algorithms for discovery of association rules are analyzed in this paper. And based on the efficient FP-growth algorith
KeywordData Mining Parallel Processing Association Rules Load Balance Shared Memory
SponsorshipHong Kong Univ Sci & Technol, Kagawa Univ, Univ Electro Commun, Natl Nat Sci Fdn China, Shanghai Univ, Harbin Engn Univ, Japan Soc Precis Engn, IEEE Robot & Automat Soc, IEEE Syst, Man & Cybernet Soc, IEEE Shikoku Sect, Chinese Inst Elect, Chi
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/13024
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
She CD,Li L,Wang HB,et al. an improved parallel algorithm for finding frequent item-sets[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION,2004:383-386.
Files in This Item:
File Name/Size DocType Version Access License
01384224.pdf(365KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[She CD]'s Articles
[Li L]'s Articles
[Wang HB]'s Articles
Baidu academic
Similar articles in Baidu academic
[She CD]'s Articles
[Li L]'s Articles
[Wang HB]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[She CD]'s Articles
[Li L]'s Articles
[Wang HB]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.