All categories

3 years ago

Teaching Siri or the Google Assistant how to recognize your voice by reading to it is an example of ________.

Computers and Technology

1 answer:

nata0808 [166]3 years ago

8 0

Answer:

4. Supervised learning.

Explanation:

Supervised and Unsupervised learning are both learning approaches in machine learning. In other words, they are sub-branches in machine learning.

In supervised learning, an algorithm(a function) is used to map input(s) to output(s). The aim of supervised learning is to predict output variables for given input data using a mapping function. When an input is given, predictions can be made to get the output.

Unsupervised learning on the other hand is suitable when no output variables are needed. The only data needed are the inputs. In this type of learning, the system just keeps learning more about the inputs.

Special applications of supervised learning are in image recognition, speech recognition, financial analysis, neural networking, forecasting and a whole lot more.

Application of unsupervised learning is in pre-processing of data during exploratory analysis.

Hope this helps!

You might be interested in

I need an answer fast !!! (APEX)

lana [24]

Your answer is B)The Intel 4004

3 0

3 years ago

When admitting digital evidence at trial, the issue of ________ comes up when the evidence involves computer-generated records.

kari74 [83]

Answer:

When admitting digital evidence at trial, the issue of Authenticity comes up when the evidence involves computer-generated records.

Explanation:

The digital evidence such as video, audio or some pictures have been presented before court as evidence. The first question that may arise is related to "authenticity of the material". To authenticate that evidence court may order the forensic audit of that particular evidence.

So, the issue of authenticity of evidence will arise, in case of digital evidence.

5 0

3 years ago

Use conversion tool to convert the binary numbers to decimal.

Neko [114]

It’s real my easy you can use a calculator or an online converter. Or division

(111001)₂ = (1 × 2⁵) + (1 × 2⁴) + (1 × 2³) + (0 × 2²) + (0 × 2¹) + (1 × 2⁰) = (57)₁₀

(1100000)₂ = (1 × 2⁶) + (1 × 2⁵) + (0 × 2⁴) + (0 × 2³) + (0 × 2²) + (0 × 2¹) + (0 × 2⁰) = (96)₁₀

(1010101)₂ = (1 × 2⁶) + (0 × 2⁵) + (1 × 2⁴) + (0 × 2³) + (1 × 2²) + (0 × 2¹) + (1 × 2⁰) = (85)₁₀

(1001000)₂ = (1 × 2⁶) + (0 × 2⁵) + (0 × 2⁴) + (1 × 2³) + (0 × 2²) + (0 × 2¹) + (0 × 2⁰) = (72)₁₀

7 0

2 years ago

Read 2 more answers

I do not understand what the are asking in csys 1.3.6

Amiraneli [1.4K]

Can i see the note????

6 0

2 years ago

A prime number is a number that is divisible only by itself and 1. Write a program that asks a user for an integer value and the

Rashid [163]

Answer:

The Solution Code is written in Java.

public class Main {
public static void main(String[] args) {
System.out.print("Please enter an integer: ");
Scanner input = new Scanner(System.in);
int number = input.nextInt();
System.out.print("Prime numbers less than or equal to " + number + " : ");
for(int i=2; i <= number; i++){
if(checkPrime(i)){
System.out.print(i + " ");
}
}
}
public static Boolean checkPrime(int num){
for(int i=2; i < num; i++)
{
if(num % i == 0){
return false;
}
}
return true;
}
}

Explanation:

Firstly, we create a function to check if a number is prime (Line 18 - 27).

This function will take one input value which is an integer, num.

To check if the input num is a prime, we can use modulus operator, %, to confirm if the num is divisible by any number starting from 2 to num - 1 (Line 19 - 24).

If the num is divisible by any number expect 1 and itself, it should equal to zero and return false to indicate it is not a prime number.

If all the num (except 1 and itself) is not divisible, the function will return true (Line 25).

Next, in our main program part (Line 3 - 16)

Prompt the user to input a number (Line 5 - 7)
Using a for-loop, we can keep calling the checkPrime() function by passing a current number (starting from 2 to input number) as argument (Line 12). The checkPrime() function will run and return true it the current number is prime, return false if it is not prime.
If the checkPrime() function return true, it will print the current number before proceed to the iteration of the for-loop to repeat the same check prime procedure (Line 13)
At the end all the prime numbers less than or equal to the input number will be printed out in the terminal

8 0

3 years ago