Computational Complexity of Finding Highly Co-occurrent Itemsets in Market Basket Databases

• Material Type: 文書・図像類
• Title: Computational Complexity of Finding Highly Co-occurrent Itemsets in Market Basket Databases
• Author/Editor: Kwon, Yeon-Dae; Ishihara, Yasunori; Shimizu, Shougo; Ito, Minoru
• Author Heading: Kwon, Yeon-Dae; Ishihara, Yasunori; Shimizu, Shougo; Ito, Minoru
• Publication, Distribution, etc.: Nara Institute of Science and Technology
• Publication Date: 2000-02
• Publication Date (W3CDTF): 2000-02
• Periodical title: Information Science Technical Report
• No. or year of volume/issue: TR2000002
• Issue: TR2000002
• ISSN (Periodical Title): ISSN : 0919-9527
• Text Language Code: eng
• Target Audience: 一般
• Format (IMT): application/pdf
• Source: fulltext （fulltext）; https://naist.repo.nii.ac.jp/record/8815/files/R001062.pdf
• Access Restrictions: インターネット公開
• Periodical Title: URI; http://isw3.naist.jp/IS/TechReport/
• Data Provider (Database): 国立情報学研究所 : 学術機関リポジトリデータベース（IRDB）（機関リポジトリ）; https://irdb.nii.ac.jp
• Original Data Provider (Database): 奈良先端科学技術大学院大学 : 奈良先端科学技術大学院大学学術リポジトリnaistar

• Summary, etc.: Data mining is to analyze all the data in a huge database and to obtain useful information for database users. One of the well-studied problems in dat...