liveBook · Manning

Membership grade

As explained in Data Without Labels

A membership degree is a value expressing how strongly an observation belongs to a particular fuzzy cluster.

A membership grade expresses how strongly a data point belongs to a fuzzy cluster. Unlike hard clustering, fuzzy clustering allows one point to belong to multiple clusters, with stronger membership near a cluster center and weaker membership near its boundary. section 5.5

Interpret membership grades through these practical properties:

  • FCM assigns a grade to every data point for each cluster; the grades are normalized between 0 and 1. section 5.5.1
  • A grade is not necessarily a probability: summing a point’s degrees across clusters may not produce 1. section 5.5.1
  • The partition matrix stores each value wᵢⱼ, representing the degree to which item i belongs to cluster j. section 5.5.1
  • FCM calculates membership grades alongside cluster centroids and controls fuzziness with the hyperparameter m. section 5.5.1 section 5.9

Center versus boundary

Suppose customer transactions form two fuzzy clusters. A point close to the first cluster’s centroid receives a higher membership grade for that cluster than a point near its edge, while either point may also belong to another cluster. section 5.5.1

Figure 5.15 The figure on the left represents all the data points. The red points (those with an x in the print version) can belong to more than one cluster. In fact, we can allocate more than one cluster to each point. A probability score can be given for a point to belong to a particular cluster.
figure

Use the diagram to compare overlapping cluster assignments and see how a point can receive a score for belonging to more than one cluster. section 5.5

How Data Without Labels covers it

How deep it goes
Defines grades, relates them to centroid distance, and represents them in FCM’s partition matrix while deferring the equation’s proof.
Examples
Uses overlapping data points, centroid distance, customer transactions, and a two-cluster illustration with center and boundary points.
What it assumes
Assumes basic clustering familiarity while contrasting hard and soft assignments and explaining membership from first principles.
What you can do after
Evaluate fuzzy cluster assignments by reading each point’s degree of belonging rather than treating grades as probabilities.
How it connects
Connects membership grades to fuzzy clustering, FCM, centroids, partition matrices, hard clustering, and Gaussian mixture models.

This explainer was generated by Manning's knowledge graph from the text of Data Without Labels. The section links point to the parts of the book it draws on.