71 views

Uploaded by misscoma

- 3.Unsupervised Learning
- Oxford Computer Science.docx
- Prediction of Super Critical Oil Extraction Yield Using Single and Combined Intelligent Systems
- dekin4.docx
- Nonnegative Matrix Factorization for Clustering
- Paper 2-A New Machine Learning Approach to Deblurring License Plate Using K-Means Clustering Method
- baron_clustering_algorithms.pdf
- Briscoe G., Caelli T. a Compendium of Machine Learning. Symbolic Machine Learning
- 318828343 Week 1 Quiz Coursera Answ
- Hg 3212991305
- Vector Quantized Codebook Optimization using K-Means
- An introduction to Apache Mahout
- Courses Syllabus
- Pranjal Casestudy Solution
- Paper-3_A Survey Performance Improving of K-Mean by Genetic Algorithm
- Neural Networks for Amibroker (AFL)
- ch10.pdf
- DM 2008 Handouts
- 10.1016@j.engappai.2017.01.006
- 1602.04938v1

You are on page 1of 9

1

K-Means Clustering

k 2

arg min ∑ ∑ Χ j − mi

S i =1 Χ j ∈S i

2

K-Means Clustering

Basic idea

• proposed by Hugo Steinhaus in 1956

Standard Algorithm

• proposed by Stuart Lloyd in 1957

• for a pulse-code modulation technique

The term “K-means”

• proposed by James MacQueen in 1967

3

Standard Algorithm

Assignment:

mk(1)

(selected by a random or heuristic method)

Update:

-> centroid of the objects in the cluster

-> no objects move group

4

Standard Algorithm

the objects no longer move to other groups.

Examples

positions

6

Examples-

Examples-Matlab

100 100

90 90

n=20, k=3

80 80

70 70

Operation flow

60 60 1. Select initial centroid

50 50

(random)

40 40 2. Calculate Euclidian

30 30 distance

20 20 3. Assign group (find

10 10 minimum distance)

0

0 10 20 30 40 50 60 70 80 90

0

0 10 20 30 40 50 60 70 80 90 4. Calculate position of

new centroid

Initial positions & 1st step

grouping 5. Calculate stop

100 100

condition

90 90

80 80

70 70

60 60

50 50

40 40

30 30

20 20

0

0 10 20 30 40 50 60 70 80 90

0

0 10 20 30 40 50 60 70 80 90 : IDX = KMEANS(X, K)

2nd step final step

7

Summary

K-Means clustering

• is a fast and simple algorithm

• to solve clustering problem

But the algorithm

• does not necessarily find optimal configuration

• due to initialization problem

• by random or heuristic selection

And so k-means algorithm

• can be run multiple times

• to reduce above effect.

8

References

Joaquin Perez Ortega, Ma. Del Rocio Boone Rojas, and Maria J.

Somodevilla Garica, “Research issues on K-means Algorithm:

An Experimental Trial Using Matlab”, Proceedings of the 2nd

Workshop on Semantic Web and New Technologies (SemWeb09),

Puebla, Mexico, March 23-24, 2009.

- 3.Unsupervised LearningUploaded byAlexandra Veres
- Oxford Computer Science.docxUploaded byStella Bondoyan
- Prediction of Super Critical Oil Extraction Yield Using Single and Combined Intelligent SystemsUploaded bySEP-Publisher
- dekin4.docxUploaded byVam SI
- Nonnegative Matrix Factorization for ClusteringUploaded byDa Kuang
- Paper 2-A New Machine Learning Approach to Deblurring License Plate Using K-Means Clustering MethodUploaded byIjarai ManagingEditor
- baron_clustering_algorithms.pdfUploaded byAnonymous MGG7vMI
- Briscoe G., Caelli T. a Compendium of Machine Learning. Symbolic Machine LearningUploaded byVíctor Iván González Guevara
- 318828343 Week 1 Quiz Coursera AnswUploaded byPraveen Kumar Reddy
- Hg 3212991305Uploaded byAnonymous 7VPPkWS8O
- Vector Quantized Codebook Optimization using K-MeansUploaded byInternational Journal on Computer Science and Engineering
- An introduction to Apache MahoutUploaded bySemtech Solutions Ltd
- Courses SyllabusUploaded bykumar kumar
- Pranjal Casestudy SolutionUploaded byPranjal Jaiswal
- Paper-3_A Survey Performance Improving of K-Mean by Genetic AlgorithmUploaded byRachel Wheeler
- Neural Networks for Amibroker (AFL)Uploaded bydarwin_hua
- ch10.pdfUploaded byAditya Sapate
- DM 2008 HandoutsUploaded bykavitarodiya
- 10.1016@j.engappai.2017.01.006Uploaded bysuresh
- 1602.04938v1Uploaded byBulat Suleymanov
- Voice ConvUploaded byalpha123k
- IJETR032531Uploaded byerpublication
- Images as a research toolUploaded byhina kaynat
- Han Liu, Alexander Gegov, Mihaela Cocea - Rule Based Systems for Big DataUploaded byvladislav
- Introduction_to_Machine_Learning.pdfUploaded byIolanda Alecsandrescu
- Nrg 3920Uploaded byAnonymous aGAiHbHq5
- Ml16 s01 IntroductionUploaded byjoseangel55
- Lecture 1Uploaded byGirish Raguvir
- Cover LetterUploaded byakjain90
- TappingUploaded byRudiStevenPardosi

- Lecture 4Uploaded bykostas_ntougias5453
- Approaches for Mining Frequent Itemsets and Minimal Association RulesUploaded byGRD Journals
- DSA_Useful_References.pdfUploaded bySandeep Gupta
- IntroductionUploaded byRajat Ilwadia
- Seminar ReportUploaded bySanth Blr
- Sappal Sir(Traversing a Graph)3-5Uploaded byDhirendra Rajput
- Assign 4Uploaded byvenuadepu
- Methods in c06!7!8Uploaded byKanika Bansal
- Mining Massive Datasets PrefaceUploaded bysulgrave
- Optimization Handout AAOC222 Sem1 2012 13Uploaded byKartikeya Bhardwaj
- cs1501Uploaded byDuc Duy
- Max Flow on Directed and Undirected GraphsUploaded byAmir Azarmehr
- algorithms computer science practice examUploaded byMatthew R. Pon
- schultes_diss.pdfUploaded byDaNi Alexis
- Bisection MethodUploaded bySulaiman Ahlaken
- IRJET- Association Rule Mining Algorithms: SurveyUploaded byIRJET Journal
- [IJCST-V4I5P32]:Stephen Opoku Oppong, Evans BaidooUploaded byEighthSenseGroup
- 38731308 C Programming and Data StructuresUploaded bySwathi Priya
- Lock-free data structuresUploaded byCharvi Jagani
- data stucture and algorithm questionsUploaded byAnmol Rajat
- PenaltyUploaded bytamann2004
- Fundamental Data StructuresUploaded byAditya Bhuyan
- Wikipedia k Nearest Neighbor AlgorithmUploaded byRadu Cimpeanu
- MIT15_053S13_lec3.pdfUploaded byShashank Singla
- Lab 6Uploaded byMouzam Ali
- Cpu Scheduling NewUploaded bySirisha Annamraju
- Latest Data StructuresUploaded byRahul Reddy
- Red–black tree - Wikipedia, the free encyclopedia.pdfUploaded byIoio92
- All c and Ds Programs for placementsUploaded byKhader Ali Syed
- Algo HomeworkUploaded bypatelnabil_11