# Data Mining Assignment

Please address the questions and then submit. You will need to ensure to use proper APA citations with any content that is not your own work.Question 1Suppose that you are employed as a data mining consultant for an Internet search engine company. Describe how data mining can help the company by giving specific examples of how techniques, such as clustering, classification, association rule mining, and anomaly detection can be applied.Question 2Identify at least two advantages and two disadvantages of using color to visually represent information.Question 3Consider the XOR problem where there are four training points: (1, 1, −),(1, 0, +),(0, 1, +),(0, 0, −). Transform the data into the following feature space:Φ = (1, √ 2×1, √ 2×2, √ 2x1x2, x2 1, x2 2).Find the maximum margin linear decision boundary in the transformed space.Question 4Consider the following set of candidate 3-itemsets: {1, 2, 3}, {1, 2, 6}, {1, 3, 4}, {2, 3, 4}, {2, 4, 5}, {3, 4, 6}, {4, 5, 6}Construct a hash tree for the above candidate 3-itemsets. Assume the tree uses a hash function where all odd-numbered items are hashed to the left child of a node, while the even-numbered items are hashed to the right child. A candidate k-itemset is inserted into the tree by hashing on each successive item in the candidate and then following the appropriate branch of the tree according to the hash value. Once a leaf node is reached, the candidate is inserted based on one of the following conditions:Condition 1: If the depth of the leaf node is equal to k (the root is assumed to be at depth 0), then the candidate is inserted regardless of the number of itemsets already stored at the node.Condition 2: If the depth of the leaf node is less than k, then the candidate can be inserted as long as the number of itemsets stored at the node is less than maxsize. Assume maxsize = 2 for this question.Condition 3: If the depth of the leaf node is less than k and the number of itemsets stored at the node is equal to maxsize, then the leaf node is converted into an internal node. New leaf nodes are created as children of the old leaf node. Candidate itemsets previously stored in the old leaf node are distributed to the children based on their hash values. The new candidate is also hashed to its appropriate leaf node.How many leaf nodes are there in the candidate hash tree? How many internal nodes are there?Consider a transaction that contains the following items: {1, 2, 3, 5, 6}. Using the hash tree constructed in part (a), which leaf nodes will be checked against the transaction? What are the candidate 3-itemsets contained in the transaction?Question 5Consider a group of documents that has been selected from a much larger set of diverse documents so that the selected documents are as dissimilar from one another as possible. If we consider documents that are not highly related (connected, similar) to one another as being anomalous, then all of the documents that we have selected might be classified as anomalies. Is it possible for a data set to consist only of anomalous objects or is this an abuse of the terminology?

Don't use plagiarized sources. Get Your Custom Essay on
Data Mining Assignment
From \$10/Page
Calculate the price
Pages (550 words)
\$0.00
*Price with a welcome 20% discount applied.
Pro tip: If you want to save more money and pay the lowest price, you need to set a more extended deadline.
We know how difficult it is to be a student these days. That's why our prices are one of the most affordable on the market, and there are no hidden fees.

Instead, we offer bonuses, discounts, and free services to make your experience outstanding.
How it works
Receive a 100% original paper that will pass Turnitin from a top essay writing service
step 1
Fill out the order form and provide paper details. You can even attach screenshots or add additional instructions later. If something is not clear or missing, the writer will contact you for clarification.
Pro service tips
How to get the most out of your experience with My Course Writer
One writer throughout the entire course
If you like the writer, you can hire them again. Just copy & paste their ID on the order form ("Preferred Writer's ID" field). This way, your vocabulary will be uniform, and the writer will be aware of your needs.
The same paper from different writers
You can order essay or any other work from two different writers to choose the best one or give another version to a friend. This can be done through the add-on "Same paper from another writer."
Copy of sources used by the writer
Our college essay writers work with ScienceDirect and other databases. They can send you articles or materials used in PDF or through screenshots. Just tick the "Copy of sources" field on the order form.
Testimonials
See why 10k+ students have chosen us as their sole writing assistance provider
Check out the latest reviews and opinions submitted by real customers worldwide and make an informed decision.
Nursing
Good job! Thank you
Customer 452487, October 17th, 2021
Nursing
Good job!! Thank you!!!
Customer 452487, September 9th, 2021
Psychology
On point! Appreciate all the hard work!!
Customer 452483, August 16th, 2021
English 101
This writer was very quick with the draft and even faster with the revision! Thank you!
Customer 452603, May 30th, 2022
Nursing
Excellent! Thank you.
Customer 452487, October 16th, 2021
Communications
Customer 452483, July 18th, 2021
English 101
Thank you guys for always being there and helping me always get a 100% on my assignments!
Customer 452483, August 16th, 2021
Sociology
Thank you so much! Appreciate it!
Customer 452483, November 8th, 2021
Healthcare Writing & Communications
Thank you so much for all of your hard work! Appreciate it all!
Customer 452483, November 14th, 2021
English 101
Amazing thank you!
Customer 452615, August 1st, 2022
English 101
Perfect! Very informative! Appreciate all of your hard work! Thank you very much.
Customer 452483, September 22nd, 2021
Psychology
Very clear, and complete information presented. I, thank you for all of your hard work, appreciate it!
Customer 452483, August 9th, 2021
1159
Customer reviews in total
96%
Current satisfaction rate
2 pages
Average paper length
47%
Customers referred by a friend