2. The Netflix Prize was a famed competition where Netflix offered $1,000,000 for a better _________________________The team that won called BellKor had a 10% improvement and used an ensemble of different methods to win.
3. What’s the trade-off between bias and variance? Read the excerpt below - T/F?
4. What is the difference between a Generative and Discriminative Algorithm?
5. How would you evaluate machine learning algorithms? Read the following excerpt and see if you can fill in the blanks.
6. What is the difference between supervised and unsupervised machine learning?
7. Which of the following is implemented on DataFrame to compute the correlation between like-labeled Series contained in different DataFrame objects ?
8. Which of the following takes a dict of dicts or a dict of array-like sequences and returns a DataFrame?
9. Which of the following library is similar to Pandas ?
10. Which of the following makes use of pandas and returns data in a Series or DataFrame ?
11. Which of the following method is used for transforming a SparseSeries indexed by a MultiIndex to a scipy.sparse.coo_matrix ?
12. Which of the following can be used to create sub–samples using a maximum dissimilarity approach ?
13. Which of the following model model include a backwards elimination feature selection routine?
14. Which of the following is a categorical outcome?
15. Which of the following function provides unsupervised prediction ?
16. How would you evaluate a logistic regression model?
17. How would you handle missing or corrupted data in a dataset?
18. True or False. An array is a series of objects with pointers that direct how to process them sequentially. A linked list is an ordered collection of objects
class Node:
def __init__(self, data, nextNode=None):
self.data = data
self.nextNode = nextNode
class LinkedList:
def __init__(self, head = None):
self.head = head
self.count = 0
if self.head is not None:
self.count = 1
def appendNode(self, node):
'''Append a node to the end of the linked list'''
if self.head is None:
self.head = node
else:
currentNode = self.head
while currentNode.nextNode is not None:
currentNode = currentNode.nextNode
currentNode.nextNode = node
self.count = self.count + 1
def appendNodeRecursive(self,newNode,currentNode):
if currentNode.nextNode is None:
currentNode.nextNode = newNode
self.count = self.count + 1
else:
self.appendNodeRecursive(newNode, currentNode.nextNode)
return
def deleteNode(self):
'''Delete the last node in the linked list'''
if self.head is None:
return
else:
currentNode = self.head
previousNode = currentNode
#set currentNode to the last node
while currentNode.nextNode is not None:
previousNode = currentNode
currentNode = currentNode.nextNode
currentNode = None
previousNode.nextNode = currentNode
self.count = self.count - 1
def getCount(self):
index = 0
currentNode = self.head
while currentNode is not None:
index = index + 1
currentNode = currentNode.nextNode
return index
def __iter__(self):
self.currentNode = self.head
return self
def __next__(self):
currentNode = self.currentNode
if currentNode is None:
raise StopIteration
else:
self.currentNode = currentNode.nextNode
return currentNode
#llist = LinkedList(Node(1))
llist = LinkedList()
for n in range(3,13,2):
llist.appendNode(Node(n))
llist.appendNodeRecursive(Node(20),llist.head)
print(llist.getCount())
print(llist.count)
for a in llist:
print("Node: {}, Data: {}, Next: {}".format(a, a.data, a.nextNode))
TRUE
FALSE
19. A hash table is a data structure that produces an associative array. A key is mapped to certain values through the use of a ______________________
20. _____________________can be used to categorize people into different tiers of intelligence based on IQ scores.