machine learning exercises

': theUserphone = input ('Please enter contact Phone:') +Addressbook[name] =Userphone A Print(AddressBook) the Continue + Else: - Continue $ Else: $Userphone = input ('Please enter contact Phone:') -addressbook[name]=Userphone - Print('Contact added successfully! ') the Print(AddressBook) - ContinueWuyi ifitem = = 3:#Delete a contact the ifNameinchAddressBook: - delAddr

= [] R = Range (1, 5) for a in r:for B in R:for C in R: If a! = B and a! = C and b! = C:d.append ("%d%d%d"% (a, B, c)) print (d, end= ",") print ("%d"% Len (d)) Answer3 () def answer4 (): "" "in the list use the for and if operations to iterate the data" "" Print ("Answer four", end= ":") arr = [1, 2, 3, 4] NewList = ["%d%d%d"% (I, j, K) for I in Arr. J in arr. K in arr if I! = J and I! = k and J! = K] Print (NewList, End= ",") print ("%d"% len (newlist)) answer4 () def answer5 ():

-Air:desktop user$ pythonPython 2.7.11 (v2.7.11:6d1b6a68f775, Dec 5 2015, 12:54:16) [GCC 4.2.1 (Apple Inc. build 5666) (dot 3)] on darwinType "help", "copyright", "credits" or "license" for more information.>>> import os>>> import sys>>> import no25>>> s = "There are many books.">>> sen = no25.break_words(s)Traceback (most recent call last): File "Error 2: A typo in the calling function causes the Python hint name to be undefined.>>> no25.print_first_and_last(sentence)Traceback (most recent ca

,//stream can manipulate the file object Pro.store (FW, "after Change");} Iv. Practice Get the number of uses of an application, more than 3 times, give information about the number of times the usage has been registered, and do not run the program again Analysis: This requirement requires a counter, each time the program starts counter into memory, number of times +1, exit program, counter close, store to file. Because the confidence to be clear, there should be a name and numbe

|awk-f "[(/]" ' nr==4 'Access: (0644/-rw-r--r--) Uid: (0/root) Gid: (0/root)[[email protected] ~]# stat/etc/hosts |awk-f "[(/]" ' Nr==4{print $} '0644#方法2-sed[Email protected] ~]# stat/etc/hosts |sed-n ' 4p 'Access: (0644/-rw-r--r--) Uid: (0/root) Gid: (0/root)[Email protected] ~]# stat/etc/hosts |sed-n ' 4p ' |sed-r ' s#^.*\ (0.*/# #g 'root\)[[email protected] ~]# stat/etc/hosts |sed-n ' 4p ' |sed-r ' s#^.*\ (0 (. *)/-# #g 'rw-r--r--) Uid: (0/root) Gid: (0/root)[[email protected] ~]# stat/etc/

Reprint Please specify the Source: http://www.cnblogs.com/ymingjingr/p/4271742.htmlDirectoryMachine learning Cornerstone Note When machine learning can be used (1)Machine learning Cornerstone Note 2--When you can use machine

]$ exitexit[[email protected] ~]# groupmems-l-G VLAN Vlan1 　　　Second, the new files created in the/testdir/data automatically belong to the G1 Group, group G2 members such as: Alice can have read and write permissions to these new files, group G3 members such as: Alice can have read and write access to these new files, group G3 members such as: Tom can only have read access to the new file, Other users (not part of G1,G2,G3) cannot access this folder.[[email protected] testdir]# mkdir-p/da

1. Copy the/etc/grub.conf configuration file to the/tmp directory and use the Find replacement command to delete the white space character at the beginning of the/etc/grub.conf file 12 [[email protected] tmp] # cp-sv/etc/grub.conf."/etc/grub.conf" - "./grub.conf" 1 :%s/^[[:space:]]//g 2. Copy the/etc/rc.d/init.d/functions file to the/tmp directory and add a # to the beginning of the line beginning with a white-space ch

Practice1, every Monday to Saturday 3:20 A.M., run the CP command to save the/etc/directory, storage locationFor/BACKUPS/ETC-YYYY-MM-DD;3 * * 1-6/bin/cp-a/etc/tmp/etc-' Date +\%f '2, every Sunday 2:30 A.M., run the CP command to backup the/etc/fstab file, the storage location is/backup/fstab-Yyyy-mm-dd-hh-mm-ss2 * * 7/bin/cp-a/etc/fstab/backup/fstab-' date +\%f-\%h-\%m-\%s '3, every night 12 o'clock, get all the lines in the/proc/meminfo file starting with S or M, appendTo the/statistics/meminfo

"" "Title: the bonus paid by the enterprise is based on the profit commission. Profit (I) less than or equal to $100,000, the bonus can be raised by 10%, the profit is higher than $100,000, less than $200,000, the portion of less than 100,000 yuan by 10% commission, higher than the portion of 100,000 yuan, a commission of 7.5%, 200,000 to 400,000, higher than 200,000 yuan, can commission 5% ; Between 400,000 and 600,000 is higher than the portion of 400,000 yuan, can commission 3%, 600,000 to 1

# Coding=utf-8import turtle# Draw Pentagram def Drawstar (x): Turtle.begin_fill () for I in range (5): Turtle.forward (x ) Turtle.right (144) Turtle.end_fill () # transfer position def goTo (x, y): turtle.up () Turtle.goto (x, y) Turtle.down () Turtle.setup (864, 576) Turtle.bgcolor ("Red") Turtle.color ("Yellow") Turtle.fillcolor ("Yellow") Turtle.hideturtle () GoTo ( -380, X) Turtle.showturtle () Drawstar () for I in range (4): x = 1 If i in [0, 3]:

Java.util.hashmap;import java.util.iterator;import Java.util.map;import Java.util.scanner;import Java.util.treemap;import Javax.management.runtimeerrorexception;public class Main {public static void Main (string[] args) {/* The application of Map collection in table-checking method is more */int num; Scanner in = new Scanner (system.in); num = In.nextint (); String week = Get_week (num-1); SYSTEM.OUT.PRINTLN (week); System.out.println (Get_week_english (Week)); In.close ();} public static Strin

number and name of the student whose course number is 003 and the course score is more than 80 33. Number of students in selected courses 34. The name of the students with the highest grade and their achievements in the course of the "Lao Tzu" Teacher 35. Check each course and the corresponding number of elective 36. The student's number, course number, and student score of the students who have the same results in different courses 37. Retrieve the student number of at least two

Gradient descent algorithm minimization of cost function J gradient descent Using the whole machine learning minimization first look at the General J () function problem We have J (θ0,θ1) we want to get min J (θ0,θ1) gradient drop for more general functions J (Θ0,θ1,θ2 .....) θn) min J (θ0,θ1,θ2 .....) Θn) How this algorithm works. : Starting from the initial assumption Starting from 0, 0 (or any other valu

http://blog.csdn.net/zhangyingchengqi/article/details/50969064First, machine learning1. Includes nearly 400 datasets of different sizes and types for classification, regression, clustering, and referral system tasks. The data set list is located at:http://archive.ics.uci.edu/ml/2. Kaggle datasets, Kagle data sets for various competitionsHttps://www.kaggle.com/competitions3.Second, computer vision"Machine

) CUDA memory variablesdifferent Memory and variable types, as follows:1. Declare the host variable, request allocation space, and initialize2. Declaring device variables, requesting allocation space3. cudamemcpy assigns the assigned host variable to the device variable4. Call Cuda kernel, parallel run thread5. Device return results to host6. Release device variable memory========================================Exercise1:Input:float Array [0, 1, 2, ... 63]Output:float Array [0^2, 1^2, 2^2, ...

? Programming# while True:# money = input (' Profit: ')# if money.isdigit () = = True:# if INT (money) # Print ("Bonus:%s"% (int (money) *10/100))# elif Int (money) # Print ("Bonus:%s"% (((int (money)-100000) *7.5/100) +100000*10/100))# elif Int (money) # Print ("Bonus:%s"% (((int (money)-200000) * 5/100)))# elif Int (money) # Print ("Bonus:%s"% (((int (money)-400000) * 3/100)))# elif Int (money) # Print ("Bonus:%s"% (((int (money)-600000) * 1.5/100)))# Else:# Print ("Bonus:%s"% (((int (money)-6

. Important modules of machine learning The most important modules of machine learning are NumPy, Pandas, Matplotlib, and IPython. One book covers some of the modules: Data Pipeline Analysis Platform with Open Source pipeline Tools. Then from 1. the free book "Introduction functions to develop Python functions for econ

a good effect, basically do not know what method of time can first try random forest.SVM (Support vector machine) The core idea of SVM is to find the interface between different categories, so that the two types of samples as far as possible on both sides of the surface, and the separation of the interface as much as possible. The earliest SVM was planar and limited in size. But using the kernel function (kernel functions), we can make the plane proj

Definition of successive descent method: For a given set of equations, use the formula:where k is the number of iterations (k=0,1,2,... ）The method of finding approximate solution by stepwise generation is called iterative method If it exists (recorded as), it is said that this iterative method converges, obviously is the solution of the equations, otherwise called this iterative method divergence. Study the convergence of {}. Introducing Error Vectors:Get:Recursion gets:To inve