<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: 24P-0539 Ahmad Moosa Sadiq</title>
    <description>The latest articles on DEV Community by 24P-0539 Ahmad Moosa Sadiq (@24p0539_ahmadmoosasadi).</description>
    <link>https://dev.to/24p0539_ahmadmoosasadi</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3824138%2F2b4a0e95-fcb3-41b7-8418-52864f96b7ca.png</url>
      <title>DEV Community: 24P-0539 Ahmad Moosa Sadiq</title>
      <link>https://dev.to/24p0539_ahmadmoosasadi</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/24p0539_ahmadmoosasadi"/>
    <language>en</language>
    <item>
      <title>Understanding Machine Learning Techniques in Artificial Intelligence</title>
      <dc:creator>24P-0539 Ahmad Moosa Sadiq</dc:creator>
      <pubDate>Sat, 14 Mar 2026 15:38:31 +0000</pubDate>
      <link>https://dev.to/24p0539_ahmadmoosasadi/understanding-machine-learning-techniques-in-artificial-intelligence-1oj4</link>
      <guid>https://dev.to/24p0539_ahmadmoosasadi/understanding-machine-learning-techniques-in-artificial-intelligence-1oj4</guid>
      <description>&lt;h2&gt;
  
  
  Link to the paper (&lt;a href="https://www.researchgate.net/publication/382264507_A_Survey_of_Machine_Learning_Techniques_for_Artificial_Intelligence" rel="noopener noreferrer"&gt;https://www.researchgate.net/publication/382264507_A_Survey_of_Machine_Learning_Techniques_for_Artificial_Intelligence&lt;/a&gt;)
&lt;/h2&gt;

&lt;h2&gt;
  
  
  Machine Learning:
&lt;/h2&gt;

&lt;p&gt;Machine learning allows systems to learn from data and improve their performance over time. Instead of programming a system with strict rules, machine learning algorithms analyze data to discover patterns and relationships.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Use cases:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
1- Robotics&lt;br&gt;&lt;br&gt;
2- NLP&lt;br&gt;&lt;br&gt;
3- Finance&lt;br&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Types:
&lt;/h2&gt;

&lt;p&gt;There are types of machine learning.&lt;br&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;i)-Supervised learning&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;
In this, the algorithms is trained with labeled data , we get output on the basis of paired input. Common models are SVM and linear regression.&lt;br&gt;
&lt;strong&gt;Examples:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Email spam filtering&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;ii)-Unsupervised learning&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;
In this, the algorithms is trained with unlabeled data , we use it when we unsure of the output. Common models are K-means.&lt;br&gt;
&lt;strong&gt;Examples:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Customer segregation&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;iii)-Reinforcement Learning&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;
In this, the algorithm learns itself from the data and the environment. Common models are PPO and DQN.&lt;br&gt;
&lt;strong&gt;Examples:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Robotics&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Comparative Analysis of Search Algorithms in AI</title>
      <dc:creator>24P-0539 Ahmad Moosa Sadiq</dc:creator>
      <pubDate>Sat, 14 Mar 2026 15:22:31 +0000</pubDate>
      <link>https://dev.to/24p0539_ahmadmoosasadi/comparative-analysis-of-search-algorithms-in-ai-3c9g</link>
      <guid>https://dev.to/24p0539_ahmadmoosasadi/comparative-analysis-of-search-algorithms-in-ai-3c9g</guid>
      <description>&lt;h2&gt;
  
  
  Link to the paper(&lt;a href="https://www.researchgate.net/publication/364921310_Comparative_Analysis_of_Search_Algorithms_in_AI" rel="noopener noreferrer"&gt;https://www.researchgate.net/publication/364921310_Comparative_Analysis_of_Search_Algorithms_in_AI&lt;/a&gt;)&lt;br&gt;
&lt;/h2&gt;

&lt;h2&gt;
  
  
  Searching
&lt;/h2&gt;

&lt;p&gt;Searching is a very important part of modern systems and there are many algorithms to achieve efficient searching.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Examples:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
1- Navigation systems&lt;br&gt;&lt;br&gt;
2- Ai bots in games&lt;br&gt;&lt;br&gt;
3- Path finding&lt;br&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Types:
&lt;/h2&gt;

&lt;p&gt;Search algorithms are divided into 2 categories.&lt;br&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;i)-Uninformed Search&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;
1- BFS&lt;br&gt;&lt;br&gt;
2- DFS&lt;br&gt;&lt;br&gt;
3- Iterative deepening search&lt;br&gt;&lt;br&gt;
4- UCS &lt;br&gt;&lt;br&gt;
5- Bidirectional search&lt;br&gt;&lt;br&gt;
6- Depth limited search&lt;br&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;ii)-Informed Search&lt;/strong&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;
1- Best First&lt;br&gt;&lt;br&gt;
2- A*&lt;br&gt;&lt;br&gt;
3- Hill Climbing&lt;br&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Shortest Path:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Breadth First Seach is the algorithm which finds the shortest path by exploring each node level by level but it takes alot of memory as it explores each node and there are no weights to judge nodes.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Infinte Path Problem:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Depth limited search is used to get rid of infinite path problems by setting a max depth limit but if a goal is deeper than our set limit, this algorithm with fail to find the path.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Reduced Complexity:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Bidirectional search can reduce time complexity by starting frim initial and end goal to reach a middle node.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;How heuristic values help in efficiency:&lt;/strong&gt;&lt;br&gt;&lt;br&gt;
Algorithms which use heurtistic values reduce the search space and find the shortest and optimal path in no time.&lt;/p&gt;

</description>
      <category>ai</category>
      <category>algorithms</category>
      <category>beginners</category>
      <category>computerscience</category>
    </item>
  </channel>
</rss>
