Tea01

Anomaly-detection

The aim of this task is to detect frauds in finantial transactions.

Anomaly-Detection-in-a-Recommender-System

This project is about detecting anomalies in a recommender system based on ratings data from a streaming video dataset. The task is to identify instances where users may be sharing accounts or engaging in other behavior that deviates from typical usage patterns.

Breast-Cancer-Prediction

We have a binary classification problem. We need to classify tumors into malignant ones that are cancerous or benign which means non-cancerous. Our dataset contains statistical data from histopathology examinations.

Chess-Castle-Game-Project-cs

Data-Structures-Algorithms

By using Doubly Linked List user can add or delete from the desired index the name of a preson.

Data-Structures-Algorithms2

By using Linked List, Priority Queue and AVL Tree the code reads numbers row by row from a txt file. Every number is a coordinate. First I found the distance (x,y,z) of one point from origin and the result is saved into the queue. Then i found the distance between each point in a row. Then I find the total distance between point for every row. This data is added to queue. Then by using AVL tree and Post Order I place the total distance of each row there. Then the output has to be the origin distance of each point but by using the priority queue.

DBMS-Antique-Shop

Antika e-ticaret sistemidir

Fruit-Calculator-Game-cs

Reinforcement-Learning

In this task we will simulate the example of multi-armed bandit.

VAM-Method

Tea01/Data-Structures-Algorithms2

By using Linked List, Priority Queue and AVL Tree the code reads numbers row by row from a txt file. Every number is a coordinate. First I found the distance (x,y,z) of one point from origin and the result is saved into the queue. Then i found the distance between each point in a row. Then I find the total distance between point for every row. This data is added to queue. Then by using AVL tree and Post Order I place the total distance of each row there. Then the output has to be the origin distance of each point but by using the priority queue.

Tea01/VAM-Method

Tea01/Anomaly-detection

The aim of this task is to detect frauds in finantial transactions.

Tea01/Anomaly-Detection-in-a-Recommender-System

This project is about detecting anomalies in a recommender system based on ratings data from a streaming video dataset. The task is to identify instances where users may be sharing accounts or engaging in other behavior that deviates from typical usage patterns.

Tea01/Breast-Cancer-Prediction

We have a binary classification problem. We need to classify tumors into malignant ones that are cancerous or benign which means non-cancerous. Our dataset contains statistical data from histopathology examinations.

Tea01/Chess-Castle-Game-Project-cs

Tea01/Data-Structures-Algorithms

By using Doubly Linked List user can add or delete from the desired index the name of a preson.

Tea01/DBMS-Antique-Shop

Antika e-ticaret sistemidir

Tea01/Fruit-Calculator-Game-cs

Tea01/Reinforcement-Learning

In this task we will simulate the example of multi-armed bandit.

Tea01/House-Model-Project-Cpp

Tea01/Image-Processing-and-GAN-Model-for-Image-Generation

Tea01/Library-System-Project-Cpp

Tea01/Matrix-Calculator-cs

Tea01/Model-Evaluation

Tea01/n-Queens

Tea01/Nesne-Yonelimli-Analiz-ve-Tasarim

Akilli Cihaz Uygulamasi

Tea01/Recommender-Systems

Tea01/Socket-Programming-with-Python

In this program we can have multiple clients connected and communicating within a server.

Tea01/String-Functions-Project-cs

Tea01/String-Project-cs

Tea01/Tea01

Config files for my GitHub profile.

Tea01/Website-Project