<?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: Dana</title>
    <description>The latest articles on DEV Community by Dana (@danaelshrbiny).</description>
    <link>https://dev.to/danaelshrbiny</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%2F828700%2F7134011f-2686-47c6-a8d8-b84e5443da96.jpeg</url>
      <title>DEV Community: Dana</title>
      <link>https://dev.to/danaelshrbiny</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/danaelshrbiny"/>
    <language>en</language>
    <item>
      <title>Maximize Your Python Code: Efficient Serialization and Parallelism with Joblib</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Mon, 24 Jun 2024 12:54:14 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/maximize-your-python-code-efficient-serialization-and-parallelism-with-joblib-520d</link>
      <guid>https://dev.to/danaelshrbiny/maximize-your-python-code-efficient-serialization-and-parallelism-with-joblib-520d</guid>
      <description>&lt;p&gt;Joblib is a Python library designed to facilitate efficient computation and useful for tasks involving large data and intensive computation. &lt;/p&gt;

&lt;h3&gt;
  
  
  Joblib tools :
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Serialization&lt;/strong&gt;: Efficiently saving and loading Python objects to and from disk. This includes support for &lt;code&gt;numpy arrays&lt;/code&gt;, &lt;code&gt;scipy sparse matrices&lt;/code&gt;, and &lt;code&gt;custom objects&lt;/code&gt;.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Parallel Computing&lt;/strong&gt;: Parallelizing tasks to utilize multiple CPU cores, which can significantly speed up computations.&lt;/p&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  Using Python for Parallel Computing
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Threading&lt;/strong&gt;: The threading module allows for the creation of threads. However, due to the GIL, threading is not ideal for CPU-bound tasks but can be useful for I/O-bound tasks.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Multiprocessing&lt;/strong&gt;: The multiprocessing module bypasses the GIL by using separate memory space for each process. It is suitable for CPU-bound tasks.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;strong&gt;Asynchronous Programming&lt;/strong&gt;: The asyncio module and async libraries enable concurrent code execution using an event loop, which is ideal for I/O-bound tasks.&lt;/p&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;blockquote&gt;
&lt;p&gt;managing parallelism manually can be complex and error-prone. This is where joblib excels by simplifying parallel execution.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;h3&gt;
  
  
  Using Joblib to Speed Up Your Python Pipelines
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Efficient Serialization&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;from joblib import dump, load

# Saving an object to a file
dump(obj, 'filename.joblib')

# Loading an object from a file
obj = load('filename.joblib')

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Parallel Computing&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;from joblib import Parallel, delayed


def square_number(x):
"""Function to square a number."""
    return x ** 2

numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

# Parallel processing with Joblib
results = Parallel(n_jobs=-1)(delayed(square_number)(num) for num in numbers)

print("Input numbers:", numbers)
print("Squared results:", results)


&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;&lt;em&gt;output&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;code&gt;Input numbers: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]&lt;br&gt;
Squared results: [1, 4, 9, 16, 25, 36, 49, 64, 81, 100]&lt;br&gt;
&lt;/code&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Pipeline Integration&lt;/strong&gt;
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;from sklearn.pipeline import Pipeline
from sklearn.preprocessing import StandardScaler
from sklearn.svm import SVC
from sklearn.datasets import load_iris
from sklearn.model_selection import train_test_split
from sklearn.metrics import accuracy_score
import joblib

# Load example dataset (Iris dataset)
iris = load_iris()
X = iris.data
y = iris.target

# Split data into training and test sets
X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=42)

# Create a pipeline
pipeline = Pipeline([
    ('scaler', StandardScaler()),
    ('svc', SVC())
])

# Train the pipeline
pipeline.fit(X_train, y_train)

# Save the pipeline
joblib.dump(pipeline, 'pipeline.joblib')

# Load the pipeline
pipeline = joblib.load('pipeline.joblib')

# Use the loaded pipeline to make predictions
y_pred = pipeline.predict(X_test)

# Evaluate the model
accuracy = accuracy_score(y_test, y_pred)
print(f"Accuracy: {accuracy}")

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;&lt;em&gt;output&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;code&gt;Accuracy: 1.0&lt;br&gt;
&lt;/code&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>joblib</category>
      <category>piplines</category>
      <category>tips</category>
    </item>
    <item>
      <title>Stack in python</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Sat, 12 Aug 2023 17:00:09 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/stack-in-python-45ng</link>
      <guid>https://dev.to/danaelshrbiny/stack-in-python-45ng</guid>
      <description>&lt;p&gt;A stack is a linear data structure that follows the principle of &lt;strong&gt;Last In First Out (LIFO)&lt;/strong&gt; This means the &lt;strong&gt;last element&lt;/strong&gt; inserted inside the stack is &lt;strong&gt;removed first&lt;/strong&gt;.&lt;/p&gt;

&lt;h2&gt;
  
  
  LIFO Principle of Stack:
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;putting an item on top of the stack is called &lt;strong&gt;push&lt;/strong&gt;.&lt;/li&gt;
&lt;li&gt;removing an item is called &lt;strong&gt;pop&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fq2w12ukfjtt7uxjex60q.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fq2w12ukfjtt7uxjex60q.png" alt="Stack Push and Pop Operations" width="800" height="479"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Basic Operations of Stack:
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;Push: Add an element to the top of a stack.&lt;/li&gt;
&lt;li&gt;Pop: Remove an element from the top of a stack.&lt;/li&gt;
&lt;li&gt;IsEmpty: Check if the stack is empty.&lt;/li&gt;
&lt;li&gt;IsFull: Check if the stack is full.&lt;/li&gt;
&lt;li&gt;Peek: Get the value of the top element without removing it.&lt;/li&gt;
&lt;/ul&gt;

&lt;h2&gt;
  
  
  Working of Stack Data Structure:
&lt;/h2&gt;

&lt;ul&gt;
&lt;li&gt;A pointer called TOP is used to keep track of the top element in the stack.&lt;/li&gt;
&lt;li&gt;When initializing the stack, we set its value to -1 so that we can check if the stack is empty by comparing TOP == -1.&lt;/li&gt;
&lt;li&gt;On pushing an element, we increase the value of TOP and place the new element in the position pointed to by TOP.&lt;/li&gt;
&lt;li&gt;On popping an element, we return the element pointed to by TOP and reduce its value.&lt;/li&gt;
&lt;li&gt;Before pushing, we check if the stack is already full.&lt;/li&gt;
&lt;li&gt;Before popping, we check if the stack is already empty.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;So,&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;empyty stack =&amp;gt; (empty bottle) =&amp;gt; top = -1&lt;/li&gt;
&lt;li&gt;stack[1] =&amp;gt; (push = 1) =&amp;gt; top = 0&lt;/li&gt;
&lt;li&gt;stack[2] =&amp;gt; (push = 2) =&amp;gt; top = 1&lt;/li&gt;
&lt;li&gt;stack[3] =&amp;gt; (push = 3) =&amp;gt; top = 2&lt;/li&gt;
&lt;li&gt;return stack[2] =&amp;gt; (pop = 3) =&amp;gt; top = 1&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fudk0pjlycqb0tge7kata.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fudk0pjlycqb0tge7kata.png" alt="Working of Stack Data Structure" width="800" height="394"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;h2&gt;
  
  
  Stack Implementations in Python
&lt;/h2&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight shell"&gt;&lt;code&gt;&lt;span class="s2"&gt;"""Stack code."""&lt;/span&gt;


def create_stack&lt;span class="o"&gt;()&lt;/span&gt;:
    &lt;span class="s2"&gt;"""Creating a stack."""&lt;/span&gt;
    stack &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="o"&gt;[]&lt;/span&gt;
    &lt;span class="k"&gt;return &lt;/span&gt;stack


def check_empty&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;)&lt;/span&gt;:
    &lt;span class="s2"&gt;"""Creating an empty stack."""&lt;/span&gt;
    &lt;span class="k"&gt;return &lt;/span&gt;len&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;)&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; 0


def push&lt;span class="o"&gt;(&lt;/span&gt;stack, item&lt;span class="o"&gt;)&lt;/span&gt;:
    &lt;span class="s2"&gt;"""Adding items into the stack."""&lt;/span&gt;
    stack.append&lt;span class="o"&gt;(&lt;/span&gt;item&lt;span class="o"&gt;)&lt;/span&gt;
    print&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"Pushing item "&lt;/span&gt; + item&lt;span class="o"&gt;)&lt;/span&gt;


def pop&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;)&lt;/span&gt;:
    &lt;span class="s2"&gt;"""Removing an element from the stack."""&lt;/span&gt;
    &lt;span class="k"&gt;if &lt;/span&gt;check_empty&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;)&lt;/span&gt;:
        &lt;span class="s2"&gt;"""Check for empty stack."""&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="s2"&gt;"stack is empty"&lt;/span&gt;

    &lt;span class="k"&gt;return &lt;/span&gt;stack.pop&lt;span class="o"&gt;()&lt;/span&gt;


stack &lt;span class="o"&gt;=&lt;/span&gt; create_stack&lt;span class="o"&gt;()&lt;/span&gt;
push&lt;span class="o"&gt;(&lt;/span&gt;stack, str&lt;span class="o"&gt;(&lt;/span&gt;1&lt;span class="o"&gt;))&lt;/span&gt;
push&lt;span class="o"&gt;(&lt;/span&gt;stack, str&lt;span class="o"&gt;(&lt;/span&gt;2&lt;span class="o"&gt;))&lt;/span&gt;
push&lt;span class="o"&gt;(&lt;/span&gt;stack, str&lt;span class="o"&gt;(&lt;/span&gt;3&lt;span class="o"&gt;))&lt;/span&gt;
push&lt;span class="o"&gt;(&lt;/span&gt;stack, str&lt;span class="o"&gt;(&lt;/span&gt;4&lt;span class="o"&gt;))&lt;/span&gt;
push&lt;span class="o"&gt;(&lt;/span&gt;stack, str&lt;span class="o"&gt;(&lt;/span&gt;5&lt;span class="o"&gt;))&lt;/span&gt;

print&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"popped item: "&lt;/span&gt; + pop&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;))&lt;/span&gt;
print&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="s2"&gt;"stack after popping an elements "&lt;/span&gt; + str&lt;span class="o"&gt;(&lt;/span&gt;stack&lt;span class="o"&gt;))&lt;/span&gt;


&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;the output&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight shell"&gt;&lt;code&gt;Pushing item 1
Pushing item 2
Pushing item 3
Pushing item 4
Pushing item 5
popped item: 5
stack after popping an elements &lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="s1"&gt;'1'&lt;/span&gt;, &lt;span class="s1"&gt;'2'&lt;/span&gt;, &lt;span class="s1"&gt;'3'&lt;/span&gt;, &lt;span class="s1"&gt;'4'&lt;/span&gt;&lt;span class="o"&gt;]&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



</description>
      <category>datastructures</category>
      <category>python</category>
      <category>stack</category>
    </item>
    <item>
      <title>modular AI</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Wed, 17 May 2023 02:30:03 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/modular-ai-me3</link>
      <guid>https://dev.to/danaelshrbiny/modular-ai-me3</guid>
      <description>&lt;p&gt;في كتير من الاوقات فكرنا في اننا نعمل تطبيقات أسرع وأكثر كفاءة من لغات البرمجه الي احنا عرفنها وشايفين ان لغاتنا غير قادرة على تلبية متطلبتنا وهنا بقي يجي دور لغه برمجه جديده وهي&lt;br&gt;
Mojoprogramminglanguage&lt;/p&gt;

&lt;p&gt;موجو هي لغة برمجة جديدة تم تطويرها بواسطة وحدات شركة متخصصة في البنية التحتية للذكاء الاصطناعي. ومصممه خصيصًا لتمكين المطورين من إنشاء تطبيقات أسرع وأكثر قوة للعديد من حالات الاستخدام في تطوير الذكاء الاصطناعي.&lt;/p&gt;

&lt;p&gt;لغه موجو هي لغه برمجة تجمع بين استخدام بايثون و سرعه وكفاءه لغه سي وهي لغة تسمح للمطورين بإنشاء تطبيقات عالية الأداء دون الحاجة إلى تعلم لغات وصف الأجهزة القياسية&lt;/p&gt;

&lt;p&gt;وعلشان كدا تم إنشاء موجو ، وهي من المفترض أن تكون متوافقًا تمامًا مع نظام بايثون وتوفير سرعة على مستوى لغع سي &lt;/p&gt;

&lt;p&gt;&lt;a href="https://www.modular.com/mojo" rel="noopener noreferrer"&gt;https://www.modular.com/mojo&lt;/a&gt;&lt;/p&gt;

</description>
      <category>mojo</category>
      <category>python</category>
      <category>c</category>
    </item>
    <item>
      <title>Self Organizing Maps (SOMs)</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Wed, 08 Mar 2023 15:19:44 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/self-organizing-maps-soms-4k5p</link>
      <guid>https://dev.to/danaelshrbiny/self-organizing-maps-soms-4k5p</guid>
      <description>&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Self Organizing Map&lt;/strong&gt; or &lt;strong&gt;Kohonen Map&lt;/strong&gt; or &lt;strong&gt;SOM&lt;/strong&gt; is a type of Artificial Neural Network which is also inspired by biological models of neural systems.&lt;/li&gt;
&lt;li&gt;It follows an unsupervised learning approach and trained its network through a competitive learning algorithm. &lt;/li&gt;
&lt;li&gt;SOM is used for clustering and mapping (dimensionality reduction) techniques to map multidimensional data onto lower-dimensional which allows people to reduce complex problems for easy interpretation. &lt;/li&gt;
&lt;li&gt;SOM has two layers one is the &lt;strong&gt;Input layer&lt;/strong&gt; and the other one is the &lt;strong&gt;Output layer&lt;/strong&gt;.&lt;/li&gt;
&lt;/ul&gt;

&lt;h3&gt;
  
  
  How do SOM works?
&lt;/h3&gt;

&lt;p&gt;&lt;code&gt;wij = wij(old) + alpha(t) *  (xik - wij(old))&lt;/code&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;alpha is a learning rate at time t&lt;/li&gt;
&lt;li&gt;j denotes the winning vector&lt;/li&gt;
&lt;li&gt;i denotes the ith feature of training example &lt;/li&gt;
&lt;li&gt;k denotes the kth training example from the input data&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;After training the SOM network, trained weights are used for clustering new examples. A new example falls in the cluster of winning vectors. &lt;/p&gt;

&lt;h3&gt;
  
  
  Train the algorithm
&lt;/h3&gt;

&lt;ol&gt;
&lt;li&gt;Initialize the weights wij random value may be assumed. Initialize the learning rate α.&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Calculate squared Euclidean distance.&lt;/p&gt;

&lt;p&gt;&lt;code&gt;D(j) = Σ (wij – xi)^2&lt;/code&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;i=1 to n
&lt;/li&gt;
&lt;li&gt;j=1 to m&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;li&gt;&lt;p&gt;Find index J, when D(j) is minimum that will be considered as winning index.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;For each j within a specific neighborhood of j and for all i, calculate the new weight.&lt;/p&gt;

&lt;p&gt;&lt;code&gt;wij(new)=wij(old) + α[xi – wij(old)]&lt;/code&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Update the learning rule &lt;/p&gt;

&lt;p&gt;&lt;code&gt;α(t+1) = 0.5 * t&lt;/code&gt;&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;&lt;p&gt;Test the Stopping Condition.&lt;/p&gt;&lt;/li&gt;
&lt;/ol&gt;

</description>
      <category>deeplearning</category>
      <category>unsupervised</category>
      <category>maps</category>
      <category>algorithms</category>
    </item>
    <item>
      <title>Deep Learning</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Mon, 06 Mar 2023 21:52:53 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/deep-learning-27e1</link>
      <guid>https://dev.to/danaelshrbiny/deep-learning-27e1</guid>
      <description>&lt;p&gt;Deep learning is a subset of machine learning, which is essentially a neural network with three or more layers. &lt;/p&gt;

&lt;p&gt;models are capable enough to focus on the accurate features themselves by requiring a little guidance from the programmer and are very helpful in solving out the problem of dimensionality. Deep learning algorithms are used, especially when we have a huge no of inputs and outputs.&lt;/p&gt;

&lt;p&gt;Deep learning is implemented with the help of &lt;strong&gt;Neural Networks&lt;/strong&gt;, and the idea behind the motivation of Neural Network is the biological &lt;strong&gt;neurons&lt;/strong&gt;, which is nothing but a brain cell.&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;&lt;code&gt;Deep learning is a collection of statistical techniques of machine learning for learning feature hierarchies that are actually based on artificial neural networks.&lt;/code&gt;&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;&lt;em&gt;So basically, deep learning is implemented by the help of &lt;strong&gt;deep networks&lt;/strong&gt;, which are nothing but &lt;strong&gt;neural networks&lt;/strong&gt; with multiple hidden layers.&lt;/em&gt;&lt;/p&gt;

&lt;h3&gt;
  
  
  Architectures:
&lt;/h3&gt;

&lt;ul&gt;
&lt;li&gt;Deep Neural Networks (DNN)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;It is a neural network that incorporates the complexity of certain level, which means several numbers of hidden layers are encompassed in between the input and output layers.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Deep Belief Networks (DBN)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;A deep belief network is a class of Deep Neural Network that comprises of multi-layer belief networks.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Recurrent Neural Networks (RNN)&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;It permits parallel as well as sequential computation and it is exactly similar to that of the human brain.&lt;/p&gt;

</description>
      <category>deeplearning</category>
      <category>neuralnetwork</category>
    </item>
    <item>
      <title>Accuracy Of Classification</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Tue, 13 Dec 2022 20:21:32 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/how-to-improve-the-accuracy-of-a-classification-model-3m40</link>
      <guid>https://dev.to/danaelshrbiny/how-to-improve-the-accuracy-of-a-classification-model-3m40</guid>
      <description>&lt;p&gt;Accuracy is one metric for evaluating classification models and the fraction of predictions our model got right.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjpjiyolq3qxv9qd8rfk3.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjpjiyolq3qxv9qd8rfk3.png" alt="Image description" width="540" height="93"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;For binary classification, accuracy can also be calculated in terms of positives and negatives as follows:&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5eeonua0mlonmmrw2g4f.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5eeonua0mlonmmrw2g4f.png" alt="Image description" width="506" height="91"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Where &lt;em&gt;TP = True Positives&lt;/em&gt;, &lt;em&gt;TN = True Negatives&lt;/em&gt;, &lt;em&gt;FP = False Positives&lt;/em&gt;, and &lt;em&gt;FN = False Negatives&lt;/em&gt;.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fopz4naek4xw7p6s2psqk.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fopz4naek4xw7p6s2psqk.png" alt="Image description" width="381" height="132"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>machinelearning</category>
      <category>python</category>
    </item>
    <item>
      <title>gyroscope</title>
      <dc:creator>Dana</dc:creator>
      <pubDate>Tue, 06 Sep 2022 14:35:26 +0000</pubDate>
      <link>https://dev.to/danaelshrbiny/we-talk-about-gyroscope-58g5</link>
      <guid>https://dev.to/danaelshrbiny/we-talk-about-gyroscope-58g5</guid>
      <description>&lt;p&gt;&lt;strong&gt;what is gyroscope?&lt;/strong&gt;&lt;br&gt;
A gyroscope is a device used for measuring or maintaining orientation and angular velocity.&lt;/p&gt;

&lt;p&gt;It is a spinning wheel or disc in which the axis of rotation (spin axis) is free to assume any orientation by itself. &lt;/p&gt;

&lt;p&gt;When rotating, the orientation of this axis is unaffected by tilting or rotation of the mounting, according to the conservation of angular momentum.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhb02bdyiaerh5olf2dzn.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fhb02bdyiaerh5olf2dzn.png" width="250" height="187"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmsjx5972d69rkl0jz9je.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fmsjx5972d69rkl0jz9je.gif" width="220" height="220"&gt;&lt;/a&gt;&lt;br&gt;
&lt;em&gt;We now showing A gyroscope in operation, showing the freedom of rotation in all three axes. The rotor will maintain its spin axis direction regardless of the orientation of the outer frame.&lt;/em&gt;&lt;/p&gt;

</description>
      <category>gyroscope</category>
      <category>sensor</category>
    </item>
  </channel>
</rss>
