En curso

Find a pratical example with datas based on hierarchical clustering algorithm of S. Dasgupta - 02/09/2018 02:53 EDT -- 4

The goal of the project is to get an example with metric datas which is based on the article : " Performance guarantee for hierarchical clustering " authors : Dasgupta and Long,

you can also find this article on line : [login to view URL]~dasgupta/papers/[login to view URL]

Deadline is 7th september 2018

This jobs suits to Dataminers, Data scientist , machine learning Specialist, Statisticians.....

The goal of the project is to find metric datas and applying Dasgupta hierarchical clustering algorithm : first step is to apply Farthest First Traversal algorithm on metric data : author Gonzalez : then we get a tree and then applying Dasgupta algorithm on this tree of Farthest First Traversal algorithm: we must have better or optimal clustering by getting shorter distance with Dasgupta algorithm.

For this project : any distance can be used except euclidian distance

Distance that can be used are : Lorentzian or Jaccard or Canbera , or any other distance etc..... But the most important thing is to get a shorter distance when applying Dasgupta Algorithm on the tree of Farthest First Traversal algorithm : if the results are greater distance than Farthest First Traversal or equal distance : so that these results ( greater or equal ) don't show that Dasgupta Algorithm is better than Farthest First Traversal. When applying Dasgupta Algorithm ( second step ) : it is mandatory to get a shorter distance between two points on a metric space . ( please also attached txt file : important notice goal [login to view URL] )

In attached file to this mail : you can find a bad example : [login to view URL] preliminaire or new rapport preliminaire : but in these examples : distances are greater or equal to distances obtained with Farthest First Traversal algorithm. These documents are written in French , if needed, I can translated in English.

Could you manage to get a practical example where distance are shorter when applying Dasgupta Algorithm on the results of Farthest First Traversal algorithm ?

I'm looking forward hearing from you.

Have a nice day


Habilidades: Algoritmos, Extracción de datos, Ciencia de datos, Aprendizaje automático, Lenguaje de Programación R

Ver más: r heatmap clustering method, hierarchical clustering correlation matrix r, hierarchical clustering r package, hierarchical clustering in r code, hierarchical clustering r heatmap, r hierarchical clustering cut tree, hierarchical clustering heatmap, r dendrogram labels, find job notice boards, send link title link url link description sending form belowforget url links page find verify linkreserve refuse link exchange s, aucsmith`s algorithm, develop frortran aprogram to find the 2 second region with the largest power with respect to other 2 second regions in the signa, s www elance com q find workh, https www blogger com profile find g t l&loc0 br&loc1 s c3 a3o cristinaal, m datingbuzz co za s find populous r php, dijkstra's algorithm graph, dijkstra's algorithm shortest path, find a children's book illustrator, find a children's book illustrator uk, find a children's book illustrator ukl

Información del empleador:
( 0 comentarios ) Belgium

Nº del proyecto: #17696424

Adjudicado a:


Hello, i have read the details provided..please contact me to discuss more on the project deadline and some other few things

€220 EUR en 4 días
(5 comentarios)