ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

온라인 연관 규칙×연관 규칙×
분야머신러닝머신러닝
계열Machine learningMachine learning
기원 연도19961993
창시자Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y.Agrawal, R., Imielinski, T., & Swami, A.
유형Incremental / streaming pattern miningUnsupervised pattern discovery
원전Cheung, D. W., Han, J., Ng, V. T., & Wong, C. Y. (1996). Maintenance of discovered association rules in large databases: an incremental updating technique. In Proceedings of the 12th International Conference on Data Engineering (ICDE 1996), pp. 106–114. IEEE. link ↗Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, 207–216. DOI ↗
별칭Incremental association rule mining, Streaming association rules, Online ARM, Incremental ARMmarket basket analysis, association rule mining, frequent itemset mining, affinity analysis
관련54
요약Online association rule mining discovers if-then patterns (e.g., buying bread implies buying butter) from transactional data that arrives incrementally or as a stream, updating existing rules and item counts without re-scanning the entire historical database each time new records arrive.Association rule learning is an unsupervised technique that discovers co-occurrence patterns — 'if X then Y' implications — within large transactional datasets. Originally formalized by Agrawal, Imielinski, and Swami (1993) for supermarket basket analysis, it is now widely applied in e-commerce recommendation, health informatics, bioinformatics, and behavioral research.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Online Association Rules · Association Rules. 2026-06-18에 다음에서 검색함: https://scholargate.app/ko/compare