פיתוח תוכנה ואלגוריתמים

Ph.D Computer Science. Algorithms and Software developer

ר"ג, Israel

Freelancer

Contact

ABOUT

https://scholar.google.com/citations?user=pGRkafIAAAAJ&hl=en
https://www.linkedin.com/in/erez-hartuv-2b847944/
https://en.wikipedia.org/wiki/HCS_clustering_algorithm

LANGUAGES

Hebrew

Native or bilingual proficiency

English

Full professional proficiency

SKILL DETAILS

Software & Programming

AJAX

junior.

C, C++

experienced.

COBOL

junior.

Delphi

junior.

HTML5, CSS3, JavaScript

experienced.

Scripting

junior.

Developer, Programmer, General, Other

experienced.

BI, Data Science, Big Data

experienced.

Python

experienced.

Algorithm Development

experienced.

Assembly

junior.

EMPLOYMENT HISTORY

2017 - 2023

מחקר והוראה

אוניברסיטת בר אילן

דוקטורט
מתרגל רשתות תקשורת מחשב, JavaScript, go

2013 - 2016

פיתוח אלגוריתמים ותוכנה

בנק פועלים

Python ,SQL, Data scientist .Fraud detection (זיהוי הונאות מעילות הלבנת הון).

EDUCATION

2017 - 2023

PhD computer science

Bar ilan university

תואר דוקטור

1996 - 1998

M.Sc. computer science

Tel Aviv university

תואר שני

1987 - 1991

B.Sc. mathematics and computer science

Tel Aviv university

תואר ראשון

PATENTS & INVENTIONS

HCS clustering

NOT REGISTERED

The HCS (Highly Connected Subgraphs) clustering algorithm is an algorithm based on graph connectivity for cluster analysis. It works by representing the similarity data in a similarity graph, and then finding all the highly connected subgraphs. It does not make any prior assumptions on the number of the clusters. This algorithm was published by Erez Hartuv and Ron Shamir in 2000.