All categories

3 years ago

List of rules for expert systems

Computers and Technology

1 answer:

Katarina [22]3 years ago

5 0

Answer:

In artificial intelligence, an expert system is a computer system emulating the decision-making ability of a human expert.[1] Expert systems are designed to solve complex problems by reasoning through bodies of knowledge, represented mainly as if–then rules rather than through conventional procedural code.[2] The first expert systems were created in the 1970s and then proliferated in the 1980s.[3] Expert systems were among the first truly successful forms of artificial intelligence (AI) software.[4][5][6][7][8] An expert system is divided into two subsystems: the inference engine and the knowledge base. The knowledge base represents facts and rules. The inference engine applies the rules to the known facts to deduce new facts. Inference engines can also include explanation and debugging abilities.

You might be interested in

In order to consolidate your theoretical knowledge into technique and skills with practical and applicational value, you will us

Arisa [49]

Answer:

Check the explanation

Explanation:

Lasso: R example

To run Lasso Regression you can re-use the glmnet() function, but with the alpha parameter set to 1.

# Perform 10-fold cross-validation to select lambda --------------------------- lambdas_to_try <- 10^seq(-3, 5, length.out = 100) # Setting alpha = 1 implements lasso regression lasso_cv <- cv.glmnet(X, y, alpha = 1, lambda = lambdas_to_try, standardize = TRUE, nfolds = 10) # Plot cross-validation results plot(lasso_cv)

Best cross-validated lambda lambda_cv <- lasso_cv$lambda.min # Fit final model, get its sum of squared residuals and multiple R-squared model_cv <- glmnet(X, y, alpha = 1, lambda = lambda_cv, standardize = TRUE) y_hat_cv <- predict(model_cv, X) ssr_cv <- t(y - y_hat_cv) %*% (y - y_hat_cv) rsq_lasso_cv <- cor(y, y_hat_cv)^2 # See how increasing lambda shrinks the coefficients -------------------------- # Each line shows coefficients for one variables, for different lambdas. # The higher the lambda, the more the coefficients are shrinked towards zero. res <- glmnet(X, y, alpha = 1, lambda = lambdas_to_try, standardize = FALSE) plot(res, xvar = "lambda") legend("bottomright", lwd = 1, col = 1:6, legend = colnames(X), cex = .7)

Kindly check the Image below.

5 0

3 years ago

Which would you use to get the number of elements in a dictionary?

Vikentia [17]

The function use to get the number of element in a dictionary is len.

<h3>What is a dictionary?</h3>

Dictionaries are used to store data values in key-value pairs. Dictionary are ordered.

Dictionary in python are express as follows:

my_dict = {"name": "Michael", "age": 28, "school": "Oxford"}

Therefore, the length of the element of the dictionary can be gotten using the len() function.

Hence,

print(len(my_dict)) will give you the length of the element.

learn more on dictionary here: brainly.com/question/14120893

#SPJ11

8 0

2 years ago

A(n) Answer display color uses the least electricity when compared to any other color.

Elan Coil [88]

Is there answer choices because I’m not understanding what you want me to answer

3 0

3 years ago

In a spreadsheet, there are many features that help you edit quickly. True False

9966 [12]

Answer:

True

Explanation:

There are many form a quick editing

i hoped this helped

;)

7 0

3 years ago

a cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits such that the giv

Leokris [45]

Using the knowledge in computational language in C++ it is possible to write a code that cryptarithm is a mathematical puzzle where the goal is to find the correspondence between letters and digits

<h3>Writting the code:</h3>

#include <bits/stdc++.h>

using namespace std;

// chracter to digit mapping, and the inverse

// (if you want better performance: use array instead of unordered_map)

unordered_map<char, int> c2i;

unordered_map<int, char> i2c;

int ans = 0;

// limit: length of result

int limit = 0;

// digit: index of digit in a word, widx: index of a word in word list, sum: summation of all word[digit]

bool helper(vector<string>& words, string& result, int digit, int widx, int sum) {

if (digit == limit) {

ans += (sum == 0);

return sum == 0;

}

// if summation at digit position complete, validate it with result[digit].

if (widx == words.size()) {

if (c2i.count(result[digit]) == 0 && i2c.count(sum%10) == 0) {

if (sum%10 == 0 && digit+1 == limit) // Avoid leading zero in result

return false;

c2i[result[digit]] = sum % 10;

i2c[sum%10] = result[digit];

bool tmp = helper(words, result, digit+1, 0, sum/10);

c2i.erase(result[digit]);

i2c.erase(sum%10);

ans += tmp;

return tmp;

} else if (c2i.count(result[digit]) && c2i[result[digit]] == sum % 10){

if (digit + 1 == limit && 0 == c2i[result[digit]]) {

return false;

}

return helper(words, result, digit+1, 0, sum/10);

} else {

return false;

}

// if word[widx] length less than digit, ignore and go to next word

if (digit >= words[widx].length()) {

return helper(words, result, digit, widx+1, sum);

}

// if word[widx][digit] already mapped to a value

if (c2i.count(words[widx][digit])) {

if (digit+1 == words[widx].length() && words[widx].length() > 1 && c2i[words[widx][digit]] == 0)

return false;

return helper(words, result, digit, widx+1, sum+c2i[words[widx][digit]]);

}

// if word[widx][digit] not mapped to a value yet

for (int i = 0; i < 10; i++) {

if (digit+1 == words[widx].length() && i == 0 && words[widx].length() > 1) continue;

if (i2c.count(i)) continue;

c2i[words[widx][digit]] = i;

i2c[i] = words[widx][digit];

bool tmp = helper(words, result, digit, widx+1, sum+i);

c2i.erase(words[widx][digit]);

i2c.erase(i);

}

return false;

}

void isSolvable(vector<string>& words, string result) {

limit = result.length();

for (auto &w: words)

if (w.length() > limit)

return;

for (auto&w:words)

reverse(w.begin(), w.end());

reverse(result.begin(), result.end());

int aa = helper(words, result, 0, 0, 0);

}

int main()

{

ans = 0;

vector<string> words={"GREEN" , "BLUE"} ;

string result = "BLACK";

isSolvable(words, result);

cout << ans << "\n";

return 0;

}

See more about C++ code at brainly.com/question/19705654

#SPJ1

3 0

2 years ago

List of rules for expert systems​

List of rules for expert systems