Data Mining

<a href="OLTP" class="internal-link">OLTP</a><html><head></head><body><span class="note-preview block col-span-2 max-w-[400px] rounded shadow-sm p-5 bg-white dark:bg-gray-800 cursor-pointer text-lg text-black dark:text-white hover:bg-gray-200 dark:hover:bg-gray-700 hover:border-transparent">OLTPtransactional database serving business and customers
mission critical systems
up all teh time
dont slow down

Status: #idea
Tags: data-mining

References</body></html>
<a href="OLAP" class="internal-link">OLAP</a><html><head></head><body><span class="note-preview block col-span-2 max-w-[400px] rounded shadow-sm p-5 bg-white dark:bg-gray-800 cursor-pointer text-lg text-black dark:text-white hover:bg-gray-200 dark:hover:bg-gray-700 hover:border-transparent">OLAPserving in house
not serving customers
used for analytics and insights

Status: #idea
Tags: data-mining

References</body></html>
Status: #idea 
Tags: <a href="../data-mining" class="internal-link">data-mining</a><html><head></head><body><span class="note-preview block col-span-2 max-w-[400px] rounded shadow-sm p-5 bg-white dark:bg-gray-800 cursor-pointer text-lg text-black dark:text-white hover:bg-gray-200 dark:hover:bg-gray-700 hover:border-transparent">Data Mining* [x] data-mining-uts-quiz

 knowdledge discovery in databases

data-warehousing

schema
400
400
400

Apriori Algorithm

400

Step 1: Count Distinct Items

400
400
400
400

Step 2: Identify Association Rules

400
400
400
400

FP Growth Algorithm

Step 1: Count Distinct Items

400

Step 2: Rearrange Items based count in descending order

400

Step 3: Make FP Growth Tree

1. Make Null Root Node
1. And make children sequentially
 400
 400
 400
 400
 400
 400
 400
 400
 400
 400</body></html>
<hr>
<h1>References</h1>