Repeated K-Fold Cross-Validation using Python sklearn

by | Apr 11, 2023 | AI, Machine Learning and Deep Learning, Featured, Machine Learning Using Python, Python Scikit-learn

What is repeated k-fold cross-validation?

In our previous article, we discussed what k-fold cross-validation is, how it works, and how to perform k-fold cross-validation using the sklearn Python library. In the repeated k-fold cross-validation algorithm, the k-fold cross-validation is repeated a certain number of times. Each repetition uses different randomization. The algorithm estimates the performance of the model in each repetition. And finally, we take the average of all the estimates.

The single run of the k-fold cross-validation algorithm may provide a noisy estimate. As the repeated k-fold cross-validation technique uses different randomization and provides different results in each repetition, repeated k-fold cross-validation helps in improving the estimated performance of a model.

Repeated K-Fold Cross-Validation using Python sklearn

We can use the following Python code to implement repeated k-fold cross-validation.

import seaborn
from sklearn.neighbors import KNeighborsClassifier
from sklearn.model_selection import RepeatedKFold
from sklearn.model_selection import cross_val_score

dataset = seaborn.load_dataset("iris")
D = dataset.values
X = D[:, :-1]
y = D[:, -1]

model = KNeighborsClassifier()
cv = RepeatedKFold(n_splits=10, n_repeats=5, random_state=1)
results = cross_val_score(model, X, y, scoring="accuracy", cv=cv)

print("Accuracy: ", results.mean())

Here, we read the iris dataset using the seaborn library. The dataset contains the sepal length, sepal width, petal length, and petal width of flowers. A machine learning model can predict the species of flower based on these features. The last column of the dataset contains the target variable.

dataset = seaborn.load_dataset("iris")
D = dataset.values
X = D[:, :-1]
y = D[:, -1]

Now, we split the columns of the dataset into features and the target variable. The last column of the dataset contains the target variable. So, X here contains features. And y contains the target variable.

model = KNeighborsClassifier()
cv = RepeatedKFold(n_splits=10, n_repeats=5, random_state=1)
results = cross_val_score(model, X, y, scoring="accuracy", cv=cv)

We are using the K Nearest Neighbor classifier for this problem. We are initializing the model with the KneighborsClassifier class.

Then, we are initializing repeated k-fold cross-validation. The argument n_splits refers to the number of splits in each repetition of the k-fold cross-validation. And n_repeats specifies we repeat the k-fold cross-validation 5 times. The random_state argument is used to initialize the pseudo-random number generator that is used for randomization.

Finally, we use the cross_val_score( ) function to estimate the performance of the model. Here, we are using the accuracy score (What is the accuracy score in machine learning?) And we are printing the average accuracy score.

The output of the given program will be like the following:

Accuracy:  0.9640000000000001
Facebooktwitterredditpinterestlinkedinmail

Calculate the pseudoinverse of a matrix using Python

What is the pseudoinverse of a matrix? We know that if A is a square matrix with full rank, then A-1 is said to be the inverse of A if the following condition holds: $latex AA^{-1}=A^{-1}A=I $ The pseudoinverse or the Moore-Penrose inverse of a matrix is a...

Cholesky decomposition using Python

What is Cholesky decomposition? A square matrix A is said to have Cholesky decomposition if it can be written as a product of a lower triangular matrix and its conjugate transpose. $latex A=LL^{*} $ If all the entries of A are real numbers, then the conjugate...

Tensor Hadamard Product using Python

In one of our previous articles, we already discussed what the Hadamard product in linear algebra is. We discussed that if A and B are two matrices of size mxn, then the Hadamard product of A and B is another mxn matrix C such that: $latex H_{i,j}=A_{i,j} \times...

Perform tensor addition and subtraction using Python

We can use numpy nd-array to create a tensor in Python. We can use the following Python code to perform tensor addition and subtraction. import numpy A = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) B = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) C =...

How to create a tensor using Python?

What is a tensor? A tensor is a generalization of vectors and matrices. It is easily understood as a multidimensional array. For example, in machine learning, we can organize data in an m-way array and refer it as a data tensor. Data related to images, sounds, movies,...

How to combine NumPy arrays using horizontal stack?

We can use the hstack() function from the numpy module to combine two or more NumPy arrays horizontally. For example, we can use the following Python code to combine three NumPy arrays horizontally. import numpy A = numpy.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) B =...

How to combine NumPy arrays using vertical stack?

Let’s say we have two or more NumPy arrays. We can combine these NumPy arrays vertically using the vstack() function from the numpy module. For example, we can use the following Python code to combine three NumPy arrays vertically. import numpy A = numpy.array([[1, 2,...

Singular Value Decomposition (SVD) using Python

What is Singular Value Decomposition (SVD)? Let A be an mxn rectangular matrix. Using Singular Value Decomposition (SVD), we can decompose the matrix A in the following way: $latex A_{m \times n}=U_{m \times m}S_{m \times n}V_{n \times n}^T $ Here, U is an mxm matrix....

Eigen decomposition of a square matrix using Python

Let A be a square matrix. Let’s say A has k eigenvalues λ1, λ2, ... λk. And the corresponding eigenvectors are X1, X2, ... Xk. $latex X_1=\begin{bmatrix} x_{11} \\ x_{21} \\ x_{31} \\ ... \\ x_{k1} \end{bmatrix} \\ X_2=\begin{bmatrix} x_{12} \\ x_{22} \\ x_{32} \\ ......

How to calculate eigenvalues and eigenvectors using Python?

In our previous article, we discussed what eigen values and eigenvectors of a square matrix are and how we can calculate the eigenvalues and eigenvectors of a square matrix mathematically. We discussed that if A is a square matrix, then $latex (A- \lambda I) \vec{u}=0...

Amrita Mitra

Author

Ms. Amrita Mitra is an author, who has authored the books “Cryptography And Public Key Infrastructure“, “Web Application Vulnerabilities And Prevention“, “A Guide To Cyber Security” and “Phishing: Detection, Analysis And Prevention“. She is also the founder of Asigosec Technologies, the company that owns The Security Buddy.

0 Comments

Submit a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Not a premium member yet?

Please follow the link below to buy The Security Buddy Premium Membership.

Featured Posts

Translate »