请输入您要查询的百科知识:

 

词条 Frequent pattern discovery
释义

  1. Techniques

  2. References

Frequent pattern discovery (FP discovery, FP mining, or Frequent itemset mining) as part of knowledge discovery in databases / Massive Online Analysis, and data mining describes the task of finding the most frequent and relevant patterns in large datasets.[1][2]

The concept was first introduced for mining transaction databases.[3]

Frequent patterns are defined as subsets (itemsets, subsequences, or substructures) that that appear in a data set with frequency no less than a user-specified or auto-determined threshold.[2][3]

Techniques

Techniques for FP mining include:

  • market basket analysis[4]
  • cross-marketing
  • catalog design
  • clustering
  • classification
  • recommendation systems[1]

For the most part, FP discovery can be done using association rule learning with particular algorithms Eclat, FP-growth and the Apriori algorithm. Other strategies include

  • Frequent subtree mining
  • Structure mining
  • Sequential pattern mining

and respective specific techniques.

Implementations exist for various machine learning systems or modules like MLlib for Apache Spark.[5]

References

1. ^{{cite journal|url=https://www.cs.ucsb.edu/~xyan/papers/dmkd07_frequentpattern.pdf|doi=10.1007/s10618-006-0059-1|title=Frequent pattern mining: current status and futuredirections|journal=Data Mining and Knowledge Discovery|volume=15|pages=55–86| access-date=2019-01-31|author1=Jiawei Han|author2=Hong Cheng|author3=Dong Xin|author4=Xifeng Yan|year=2007}}
2. ^{{cite web | title=Frequent Pattern Mining | website=SIGKDD | date=1980-01-01 | url=https://www.kdd.org/kdd2016/topics/view/frequent-pattern-mining | access-date=2019-01-31}}
3. ^{{cite web | title=Frequent pattern Mining, Closed frequent itemset, max frequent itemset in data mining | website=T4Tutorials | date=2018-12-09 | url=https://t4tutorials.com/frequent-pattern-mining-in-data-mining/ | ref={{sfnref | T4Tutorials | 2018}} | access-date=2019-01-31}}
4. ^{{cite journal | last=Agrawal | first=Rakesh | last2=Imieliński | first2=Tomasz | last3=Swami | first3=Arun | title=Mining association rules between sets of items in large databases | journal=ACM SIGMOD Record | volume=22 | issue=2 | date=1993-06-01 | issn=0163-5808 | doi=10.1145/170036.170072 | pages=207–216 | ref=harv| citeseerx=10.1.1.217.4132 }}
5. ^{{cite web | title=Frequent Pattern Mining | website=Spark 2.4.0 Documentation | url=https://spark.apache.org/docs/latest/ml-frequent-pattern-mining.html | ref={{sfnref | Spark 2.4.0 Documentation}} | access-date=2019-01-31}}

1 : Data mining

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/23 5:31:24