BigData Clustering Illustrated by OK Gifts
summary
Processing Odnoklassniki gift-giving logs stored in a Hadoop cluster using a MapReduce computation model to filter data and compute a similarity measure between gifts. The resulting feature data are then clustered on a supercomputer using the MCL (Markov Cluster) library to find groups of similar gifts.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 3:45Gift ranking problem
- 7:25Clustering without coordinates
- 12:05Jaccard metric for gifts
- 15:42MCL clustering algorithm
- 21:27Other data applications
- 23:18Summary and results
- 23:41Q&A
related talks
25mThe Art of Clustering: The Good, The Bad and The Beautiful
35mClustering: A Guide for the Perplexed
26mLarge Scale Graph Processing & Machine Learning Algorithms
51mApache Spark and machine learning: dreams and realities
26mUnleash Big Data Clustering
01h 20mClustering Data
34mWhisky Clustering with Apache Projects: Groovy, Commons Math, Ignite, Spark, Wayang, Beam and Flink
42mFinding Order in Chaos, or MapReduce in the Age of the Internet