Art

J-GLOBAL ID：200902132106150732   Reference number：99A0872632

Computational Complexity of Finding Meaningful Association Rules.

意味のある連想規則を見いだすための計算の複雑さ

Author (4)： KWON Y-Y (Nara Inst. Sci. and Technol., Ikoma-shi, JPN) ,  NAKANISHI R (Nara Inst. Sci. and Technol., Ikoma-shi, JPN) ,  ITO M (Nara Inst. Sci. and Technol., Ikoma-shi, JPN) ,  NAKANISHI M (Osaka Univ., Toyonaka-shi, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E82-A  Issue： 9  Page： 1945-1952  Publication year： Sep. 25, 1999 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *database ,...
Semi thesaurus term： *computational complexity ,...

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=99A0872632&from=J-GLOBAL&jstjournalNo=F0699C") }}

JST classification (2)： Database systems  (JD03030U) ,  Theory of computation  (JB02000A)

Reference (16)：

• AGRAWAL, R. Mining association rules between sets of items in large databases. Proc. ACM SIGMOD Int'l Conf. on the Management of Data. 1993, 207-216
• AGRAWAL, R. Database mining : A performance perspective. IEEE Trans. Knowledge Data Engineering. 1993, 5, 914-925
• AGRAWAL, R. Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining. 1996, 307-328
• AGRAWAL, R. Fast algorithms for mining association rules. Proc. 20th Int'l Conf. on Very Large Data Bases. 1994, 487-499
• BRIN, S. Dynamic intemset counting and implication rules for market basket data. Proc. ACM SIGMOD Int'l Conf. on Management of Data. 1997, 255-264

Terms in the title (4)： 意味 ,  連想 ,  規則 ,  計算の複雑さ