ISCAS OpenIR
iam: an algorithm of indirect association mining
Li L; Xu FJ; Wang HB; She CD; Fan ZH
2004
Conference NameInternational Conference on Intelligent Mechatronics and Automation
Pages831-835
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 AbstractThere have been several algorithms for mining association rules, such as Apriori and some improved Aprioris, only to be interested in those itemsets, which have support above a user-defined threshold. However, there exists a kind of important
KeywordData Mining Association Rule Indirect Association The Bridge Itemset Iam
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/13028
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li L,Xu FJ,Wang HB,et al. iam: an algorithm of indirect association mining[C]. 345 E 47TH ST, NEW YORK, NY 10017 USA:PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON INTELLIGENT MECHATRONICS AND AUTOMATION,2004:831-835.
Files in This Item:
File Name/Size DocType Version Access License
01384313.pdf(373KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li L]'s Articles
[Xu FJ]'s Articles
[Wang HB]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li L]'s Articles
[Xu FJ]'s Articles
[Wang HB]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li L]'s Articles
[Xu FJ]'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.