Skip to main content

Simple Hill Climbing Algorithm | Artificial Intelligence

kdajskdjla alsdklsa  For more articles Subscribe and follow my blog and me. If you have doubts in expanding and exploring research with this article kindly send me mail(  balakawshik2000@gmail.com  ) regarding your doubt. I am open to clarify. Attribution: Some Images were taken from  unsplash.com Under a free license scheme. Images were used with proper attribution in the ALT tag of every Image. Remaining Images  were created by me using( draw.io ) and I declare them as Open Source and Attribution is not mandatory.
Post a Comment

Confusion Matrix | Trick | Machine Learning

Comments

Post a Comment

Popular posts from this blog

Simple Hill Climbing Algorithm | Artificial Intelligence

kdajskdjla alsdklsa  For more articles Subscribe and follow my blog and me. If you have doubts in expanding and exploring research with this article kindly send me mail(  balakawshik2000@gmail.com  ) regarding your doubt. I am open to clarify. Attribution: Some Images were taken from  unsplash.com Under a free license scheme. Images were used with proper attribution in the ALT tag of every Image. Remaining Images  were created by me using( draw.io ) and I declare them as Open Source and Attribution is not mandatory.
Post a Comment
Read more

Parallel Line Search Algorithm

Introduction The Parallel Line Search Algorithm uses tow parallel lines to navigate to thee nodes that need to be explored. It is optimised variation of Breadth First Search. Many of search algorithm exist but they either work biased like searching left, right, top or bottom. Working Step 1: The algorithm first visit the Root node. Step 2: Then it visits both Left and Right side (unbiased). At first you may think that it works like Bidirectional Search Algorithm  Just wait a minute. Step 3: Increase the Depth and move to next level of the tree. Step 4: Find all Children. Step 5: Visit all Children. Visiting Left Child Visiting Right Child Step 6: The search continues in the same way(i.e., repeat from Step 3 until the solution is found or the entire tree). Step 7: Stop It drastically reduce the amount of required for exploration of nodes.  If branching factor of tree is b and distance of goal node from source is d, then the normal BFS/DFS searching complexity would be O(b^d)....
Post a Comment
Read more

Issues in NLP | Artificial Intelligence | Teaching Article

  Linguistic Analysis Speech Written Language This article focuses on Written Language rather than Speech because speech could be transfigured into written form. Components in analysing Written Language Pronology : Analysing Sound / Pronunciation Morphology : Analysing Structure of Words. Example : books, booked, booking -> book, run, ran, running -> run Syntax : Grammar Semantics : Meaning of Strings and Interaction among them. Now coming to issues, Issues in Syntax "The dog ate my homework." - Who did what 1. Identify POS( Parts of Speech ) Tagging Dog : Noun, Ate : Verb, Homework : Noun Note: So far English POS tagging is up to 95% accurate but it also can be improvised. 2. Identify collocation mother in law, hot dog are single word. 3. Shallow Parsing Parse tree for the sentence "John loves Marry." 4. Anaphora Resolution The dog entered my home. It scared me. Here It refers to The dog in the first sentence. It must be resolved. 5. Preposition adjustm...
Post a Comment
Read more