CS464
Introduction to
Machine Learning
Clustering
Bilkent University
Outline
K-means clustering
Hierarchical clustering
DBSCAN
Evaluating clusters
Clustering
John Snow, a London physician plotted the location of
cholera deaths on a map during an outbreak
CS464
Introduction to
Machine Learning
Ensemble Learning
Bilkent University
Outline
Ensemble Learning
Bagging and Boosting
2
Summary: bagging and boosting
Bagging
Resample data points
Weight of each
classifier is same
Only reduces variance
Robust
CS464
Introduction to
Machine Learning
Support Vector Machines
Bilkent University
Support Vector Machines
Outline
SVM classifiers for linearly separable classes
SVM classifiers for non-linearly separable classes
SVM classifiers for nonlinear decision b
CS464
Introduction to
Machine Learning
Model Selection & Validation
Bilkent University
Model Selection and Validation
Learning typically involves trying out different
models (algorithms, parameters, feature sets,etc)
How do we select the best model amon
CS464
Introduction to
Machine Learning
Decision Trees
Bilkent University
Outline
Decision trees
Decision tree representation
Decision tree learning
Entropy, Information gain
Catching Tax Cheaters
Classification Task: Given a tax return form can we pre
MATH 225
Spring 2010 2011
MATLAB HOMEWORK #1
23 February 2011
Due Date & Time: March 02, 2011, 15:00
The homework should be should be e-mailed to one of the e-mails depending on the
section, as an attachment either in pdf or Microsoft Word Document format
Name:lker Kksal
ID:20800584
Section:02
MATH 225
Spring 2010 2011
MATLAB HOMEWORK #1
1-)
a-) ans = dsolve('Dy + 2*y/x = sin(x)/x^2','x')
ans =
-(C2 + cos(x)/x^2
While I am using dsolve I found the general solution of the first order
differential equation.
MATH 225
LINEAR ALGEBRA AND DIFFERENTIAL EQUATIONS
HOMEWORK 1
Due February 21-26 before the lecture starts.
For sections 1, 3 &4; February 23, Wednesday;
for section 2; February 24, Thursday.
1) Solve the differential equation cos y
dy 1
+ sin y = 1 by us
CS 201: Fundamental Structures of Computer Science I
Fall 2010
Instructors:
Selim Aksoy (Sections 1 & 2)
EA 423 (Engineering Building), x3405
[email protected]
Office hours: TBD
Aynur Dayank (Sections 3 & 4)
EA 405A (Engineering Building), x3441
ad
CS 201, Fall 2010
Homework Assignment 2
Due: 18:00, November 22, 2010
In this homework, you will implement a library system. The library system will maintain a collection
of books for the library. The students will be able to check out books from the libr
CS 201, Fall 2010
Homework Assignment 1
Due: 18:00, November 1, 2010
In this homework, you will implement a simple search engine system. The search engine system will
consist of a document set, a dictionary le (dictionaryFileName) including all possible w
EEE 391
Basics of Signals and Systems
Computer Assignment I
Due: 26 October 2011, Wednesday by 17:00 in the homework box
Write your own MATLAB code to plot sinusoidal signals as a function of time. The program
should be able to plot both sine and cosine s
CS 351 DATA ORGANIZATION AND MANAGEMENT
Homework 1
Date Given : October 19, 2011
Date Due : October 31, 2011
Important Notes: 1. Please submit the Homework to Room EA 511 on the due date by 5:00 pm on the
same day you can also give it to me in the classro
BILKENT UNIVERSITY
Mathematics Department
Math225
Linear Algebra and Differential equations
Spring Semester 2010-2011
FIFTH HOMEWORK ASSIGNMENT
Due Date: May 4, 2011 (for Sections 1,3 and 4)
May 5, 2011 (for Section 2).
IMPORTANT
Homework must be turned
Tables
Appropriate for problems that must manage data by value.
Some important opera9ons of tables:
An ordinary table of ci2es
Inser9ng a data item containing the value x.
Delete a data item containing the value
CS 202 Fundamental Structures of Computer Sciences II
Assignment 5 Hashing and Graphs
Due Date: 23:59 May 22nd, 2011 (Sunday)
Question 1 (20 Points) Hash Tables
Consider inserting the keys 36, 18, 71, 3, 146
CS 202 Fundamental Structures of Computer Sciences II
Assignment 3 Heap and AVL Trees
Due Date: April 21, 2011 (Thursday)
Question 1 (15 Points) Heaps
a) (5 points) Given an array implementation of a heap,
23 Trees
Deni'on:
A 23 tree is a tree in which each internal
node has either two or three children, and all
leaves are at the same level.
2node: a node with two children
3node: a node with three childr
Balanced Search Trees
The height of a binary search tree is sensi2ve to the order of
inser2ons and dele2ons.
The height of a binary search tree is between log2(N+1) and N.
So, the worst case behavior o
What is a (General) Tree?
A (general) tree is a set of nodes with the following proper4es:
The set can be empty.
Otherwise, the set is par44oned into k+1 disjoint subsets:
a tree consists of a dis4nguishe
Sorting
Sorting is a process that organizes a collection of data into either ascending or
descending order.
An internal sort requires that the collection of data fit entirely in the computers main
memory.
We can use an external sort when the collection
Analysis of Algorithms
Merge Sort and Analysis of Recurrences
c 2011 Aybar C. Acar & Cidem Gndz Demir
g
uu
Compiled on: February 21, 2011
Analysis of Algorithms
Divide and Conquer
Nothing is particularly hard if you divide it into small
jobs.
Henry Ford
HW-I
1-) My name is Ilker Koksal and I am using sorting the first 6 letters of the
concatenation of my name.
a-) Insertion Sort
Initial Array:
After 1st swap:
After 2nd swap:
After 3rd swap:
After 4th swap:
After 5th swap:
After 6th swap:
After 7th swap:
CS 202 Fundamental Structures of Computer Sciences II
Assignment 2 Binary Search Trees
Due Date: March 28, 2011 (Monday)
Question 1 (10 Points) Building a binary search tree
Build a binary tree for the first
CS 202 Fundamental Structures of Computer Sciences II
Assignment 1 Algorithm Analysis, Sorting and Searching
Due Date: March 4, 2011 (Friday), 18:00
Question 1 (15 Points)
Trace each of the following sorting
Analysis of Algorithms
Introduction and the Asymptotic Notation
c 2011 Aybar C. Acar & Cidem Gndz Demir
g
uu
Compiled on: February 6, 2011
Analysis of Algorithms
Introduction
Analysis of Algorithms
The theoretical study of the time and resource usage of a
Q1. (b) Assume that there is an unsigned number stored in register A. Write an assembly
language subroutine to test if the number in A is divisible by 4 without using the DIV AB
instruction. If it is divisible, set R1 to 1, otherwise set R1 to 0.
DIVFOUR:
BILKENT UNIVERSITY
Department of Electrical and Electronics Engineering
EEE212 Microprocessors
QUIZ 4 - SOLUTIONS
14-05-2010
Section 5
OPEN BOOK, CLOSED NOTES, NO CALCULATORS
Duration: 40 minutes
Surname
:
Name
:
ID Number
:
Section
:
Signature
:
Question