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

Neural-Net based search pedagogy

 Introduction Many search algorithm revolve around the internet and some yet to be published so far the sit as a draft in the Researcher's PC. This search methodology doesn't directly going to command the algorithm to move left, right, top, bottom. It just rank the moves based on the previous search experience and the lessons learnt from previous and current searches in order to effectively and efficiently travel and search the remaining part of the tree. Requirements Neural-Net is going to collect information about both the node and path . Yes! you heard it right it collects data about path also. Information that are collected by Neural-Net: Information belonging to the Path Rank ( which depends on the success rate* ) Redirections in path ( For real-time Usage**) Information belongs to Node Value Maximum, Minimum, and Average Branch Factor. Number of Child levels. Nearness to solution.
Post a Comment
Read more