Yeon-Dae KWON


Computational Complexity of Finding Highly Co-occurrent Itemsets in Market Basket Databases
Yeon-Dae KWON Yasunori ISHIHARA Shougo SHIMIZU Minoru ITO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2000/12/25
Vol. E83-A  No. 12  pp. 2723-2735
Type of Manuscript:  PAPER
Category: General Fundamentals and Boundaries
Keyword: 
data mininglarge itemsethighly co-occurrent itemsetcomputational complexity
 Summary | Full Text:PDF(300.4KB)

Computational Complexity of Finding Meaningful Association Rules
Yeon-Dae KWON Ryuichi NAKANISHI Minoru ITO Michio NAKANISHI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1999/09/25
Vol. E82-A  No. 9  pp. 1945-1952
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
data mininglarge itemsetmeaningful association rulecomputational complexitydatabase
 Summary | Full Text:PDF(529.4KB)