- 94
- 268 320
Dr. Kavita Oza
เข้าร่วมเมื่อ 7 ก.พ. 2014
Constraint satisfaction problem(CSP)
Constraint satisfaction problems are explained in a very simple way with examples
มุมมอง: 392
วีดีโอ
Decision Tree in Machine Learning
มุมมอง 4733 ปีที่แล้ว
Talks about Decision tree, Entropy calculation, Information gain computing and Gini index computation with examples.
Plotting with matplotlib and data Normalization
มุมมอง 8063 ปีที่แล้ว
Here plotting with matplotlib library of python is demonstrated with examples. Even need for data Normalization is explained with examples covering normalization of a row, column(features) and whole whole dataset.
K-Nearest Neighbors classifier with multiple labels
มุมมอง 5573 ปีที่แล้ว
KNN is trained to classify the data with multiple class labels. Twenty Newsgroups dataset is used for training. Pipeline is used as compound classifier. Implementation is on Jupyter notebook.
Text Classification using K-Nearest Neighbors
มุมมอง 2.1K3 ปีที่แล้ว
Gives complete implementation from creating dataset to evaluating classifier model. Implementation is in python using Jupyter notebook. Its a student feedback. Classifier into positive and negative.
K- Nearest Neighbors Implementation as Binary Classifier
มุมมอง 4513 ปีที่แล้ว
A dataset is created , KNN classifier is trained and tested on it by implementing it in Jupyter notebook using Python
K- Nearest Neighbors algorithm
มุมมอง 2593 ปีที่แล้ว
It talks about working of K-nearest neighbor algorithm along with simple example , applications, advantages and drawbacks.
Supervised Machine Learning
มุมมอง 2983 ปีที่แล้ว
Introduces Regression and Classification as Predictive models.
Introduction to Machine Learning
มุมมอง 6033 ปีที่แล้ว
Talks about basic steps and components of Machine Learning along with its applications.
Deletion in B-trees
มุมมอง 2293 ปีที่แล้ว
It explains all the cases of deletion in B-tree of order 5 with example.
Insertion in B-trees
มุมมอง 553 ปีที่แล้ว
Insertion is carried out from given set of keys. Here insertion is carried out in B-tree of order five.
B-Trees
มุมมอง 1543 ปีที่แล้ว
Talks about need for B-Trees, properties of B-trees and an example showing construction of B-Tree of order 3.
Insertion in Red-Black Trees
มุมมอง 1283 ปีที่แล้ว
Red-Black tree constructed from scratch using list of keys. Two examples are taken to show both the cases of insertions (Uncle is Red / Black) along with subcases.
Red Black Trees
มุมมอง 1083 ปีที่แล้ว
Introduction to Red-Black trees covering its features, applications and cases of imbalance due to various insertions causing Red-Red violations.
Constructing Binary tree from its traversals
มุมมอง 703 ปีที่แล้ว
Step by step construction of binary tree from 1. Inorder and Preorder traversals 2. Inorder and Postorder traversals and 3. Postorder and Preorder traversals.
Transform and Change: Representation Change
มุมมอง 4413 ปีที่แล้ว
Transform and Change: Representation Change
Transform and Conquer: Instance Simplification
มุมมอง 6K3 ปีที่แล้ว
Transform and Conquer: Instance Simplification
Decrease and Conquer algorithm design technique
มุมมอง 4.7K3 ปีที่แล้ว
Decrease and Conquer algorithm design technique
Breadth First Search Traversal of a Graph
มุมมอง 2093 ปีที่แล้ว
Breadth First Search Traversal of a Graph
Graph Traversal Depth First Search Traversal
มุมมอง 1283 ปีที่แล้ว
Graph Traversal Depth First Search Traversal
But how to implement value 7,13,14 etc
Very good explanation mam thankyou
❤ it
14:44 a slight correction in the implication table F --> F should be True
Thank you very Mom
Excellent mam
Really nice
Mam can you share PPT
Thank you, you're the best❤
Truth table??
Thank you mam ❤, you have covered all possible examples.
Thank you man 😊
Excellent ❤❤
Thank you from Nepal
simply the best
thankyou mam best video on ao* i found on youtube . well explained
how can we download this ppt?
Very good example mam and well explained, thanks
Thanks Madam, 3 years into the future after you posted this video. It helped me prepare for exam. Bow to you 🙏
very Good material mam too good
mam can u share the ppt.. in a drive..
0:30 Resolution Definition 2:03 Steps 2:53 Example #1 7:15 Example #2 12:40 Example #3
how u know that u have to use what additional predicte ? raata mar ke aayeho??
Very simple indeed ma’am
Very Useful Explanation Mam
Thank you so much. Well explained ❤
Nice Explained maam thank you
Good
great lesson thank you
Thank you.... ❤
Thank you so much ma'am your videos helped me alot🙏
Can anyone please help. When do we add extra predicates?
Thanks for your examples. I'm confused about the computability of this; certainly you're not suggesting manual processing on paper? What software is there in which these can be attempted? I've learned a little of Prolog that does predicate logic. It allows uppercase starting letters only for variables. So the example Man(Mihir) @3:38 is entered man(mihir). I'm not sure Prolog accepts other operators like or, not, gt etc.. And how can the quantifier symbols (upside down A and backwards E) be enterd on a keyboard? If this is to processed in a computer, do I have to make my own symbols?
What is the time complexity of AO* algorithm mam?
Well explained Mam 👏🏻
Thank you very much! Good and clear explanation.
Hi mam Could you please share the ppt
thank you
excellent explanation madam. thank you
Mam exam main theory ke sath example bhi likhana chahiy ...... ya nhi
Yes you have to write
@@dr.kavitaoza4007 Thanks mam🙏🙏
Mam thank you so much for your videos on this topic ... You made my concepts crystal clear ... I have a question tho ... In previous video u showed us 8 steps to convert in to prenix normal form ... But why r u only applying 5 steps in each example... Why haven't u applied scolemization , removing of universal quantifies and conjunction of disjunction?
Thank you so much....from Palestine
You made it very simple mam...Thank You so much..
1) Convert Sentences into FOL ( First Order Logic) 2) FOL into CNF ( Conjuctive Normal Form ) - here we eliminate impication 3) Resolution Graph
Thanks mam.... excellent
thank you mam
Nice explanation Madam
Thank you very much for your lesson!!
Mam pls explain the optimal binary search tree
D to h not taken