Where communities thrive


  • Join over 1.5M+ people
  • Join over 100K+ communities
  • Free without limits
  • Create your own community
People
Activity
  • Jul 23 15:37

    riiswa on notebookstest

    (compare)

  • Jul 23 15:37

    riiswa on beakernotebooks

    (compare)

  • Jul 23 15:37
    beckgael closed #12
  • Jul 23 15:36

    beckgael on master

    moove notebooks into specific r… (compare)

  • Jul 23 15:32

    beckgael on master

    update readme (compare)

  • Jul 23 15:00
    FlorentF9 commented #11
  • Jul 23 14:54
    riiswa commented #11
  • Jul 23 14:45
    lebbah opened #12
  • Jul 23 14:45

    lebbah on lebbah-patch-3

    Update README.md (compare)

  • Jul 23 14:31
    FlorentF9 commented #11
  • Jul 23 14:26

    beckgael on master

    Beakernotebooks (#11) Add beak… (compare)

  • Jul 23 14:26
    beckgael closed #11
  • Jul 23 14:25
    riiswa opened #11
  • Jul 23 14:25

    riiswa on beakernotebooks

    add notebooks Add beaker notebooks (compare)

  • Jul 23 14:20

    beckgael on master

    update readme Add comments Update README.md and 1 more (compare)

  • Jul 23 13:10

    riiswa on notebookstest

    Add Binder files (compare)

  • Jul 23 13:01

    riiswa on notebookstest

    test (compare)

  • Jul 23 12:22

    beckgael on 0.9.6

    (compare)

  • Jul 06 08:57

    beckgael on master

    Update README.md (#10) (compare)

  • Jul 06 08:57
    beckgael closed #10
Beck Gaël
@beckgael
Hello first visitor. I hope you will enjoy your trip in our lands :)
vikas gautam
@vikasgautam18
Do you have some examples for k-prototype clustering?
Beck Gaël
@beckgael
Hello @vikasgautam18, unfortunately no but principle is the same than with KMeans KModes which have available notebooks
vikas gautam
@vikasgautam18
Thanks @beckgael
vikas gautam
@vikasgautam18
Hello Beck.. thanks for the response. I have another related question. How do you evaluate the clustering model?
In the Apache spark API, they have something like below -
// Evaluate clustering by computing Within Set Sum of Squared Errors
val WSSSE = clusters.computeCost(parsedData)
println(s"Within Set Sum of Squared Errors = $WSSSE")
do you have something similar to computeCost above? If not, any pointers as to how we could do this would be really helpful.
Beck Gaël
@beckgael
Hi @vikasgautam18
We chose to use another stopping criteria which is the distance epsilon under which every prototypes should move less than this threshold in order to consider convergence achieved. Others prefer WSSSE which also require a % threshold. We could imagine to propose user to choose how it decide to stop the algorithm between epsilon or WSSSE, this last is easy to implemant once you have prototypes and assignations clusters, you can implement easily...
Look at the link : https://discuss.analyticsvidhya.com/t/what-is-within-cluster-sum-of-squares-by-cluster-in-k-means/2706/2
vikas gautam
@vikasgautam18
thanks Beck!!
gitgitwhat
@gitgitwhat
Your BinNNMS paper says that the algorithm can be found in your GitHub page (Clustering4Ever). However, I don't see any mention of BinNNMS. Could you point me to the right place?
Beck Gaël
@beckgael
Hi @gitgitwhat
It is a combination of Binary Gradient Ascent and Binary-Epsilon-proximity
Hope it help
gitgitwhat
@gitgitwhat
Thanks @beckgael. Now I just need to figure out how to convert to Python and I'll be good.
Nicola
@120534
Hello, Beck. Is there an Apache Spark based Jenks natural breaks algorithm? I have no idea to rewrite the code with Apache Spark API
Beck Gaël
@beckgael
Hi @120534 , sorry but I have no idea about some distributed implementation.
Nicola
@120534
@beckgael Thx for your reply, I'll go deep into the algorithm and Spark implementation.
lukasstreit
@lukasstreit
Hi Beck,
whoops sent that a bit early. I saw your answer in
lukasstreit
@lukasstreit
a stackexchange about image segmentation using Mean shift clustering. I'm trying to segment art images (e.g. Oil paintings) and would like to try your approach out. Do you have some pointers with alrogithm of this repository to pick for that task? And do you think this could reasonably work for art as well? Sorry about the three messages, I'm posting this from the gitter website on mobile and don't see how to delete or edit my messages. Best regards, Lukas
Beck Gaël
@beckgael
Hi @lukasstreit ,
Combine the scalable version (spark ones) of gradient ascent and epsilon-proximity with euclidean distance, prefer LUV space to RGB. I applied this algorithm on image independently, not to compare many pictures between them, then i m curious about its application, let me know if you encounter issues ;)
lukasstreit
@lukasstreit
Thanks for the advice! Just to clarify - I'm not trying to group images, just trying to get segments on each distinct image. I'm currently working for my exams so I don't have much time to work on this but I'll let you know how it goes :)