ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

半教師あり連想規則×Aprioriアルゴリズム×
分野機械学習機械学習
系統Machine learningMachine learning
提唱年2003–2010s1994
提唱者Liu, B.; Hsu, W.; Ma, Y. (and subsequent researchers)Agrawal, R. & Srikant, R.
種類Pattern mining with partial supervisionFrequent itemset and association rule mining algorithm
原典Liu, B., Hsu, W., & Ma, Y. (2003). Integrating Classification and Association Rule Mining. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM), pp. 339–346. link ↗Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499. link ↗
別名semi-supervised ARM, label-guided association rule mining, constrained association rule mining, semi-supervised pattern discoveryApriori, frequent itemset mining, ARL-Apriori, Apriori association mining
関連45
概要Semi-supervised association rule mining extends classical association rule learning by incorporating a small amount of labeled data alongside a larger unlabeled dataset. It uses known class information or user-provided constraints to guide the discovery of rules that are both statistically frequent and semantically meaningful, bridging unsupervised pattern mining with light supervision.The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns.
ScholarGateデータセット
  1. v1
  2. 2 出典
  3. PUBLISHED
  1. v1
  2. 2 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Semi-supervised Association Rules · Apriori Algorithm. 2026-06-15に以下より取得 https://scholargate.app/ja/compare