Hard Ensemble Clustering
This approach by Strehl and Ghosh introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. They discuss three approaches towards solving this problem to obtain high quality consensus functions. Their techniques have low computational costs and this makes it feasible to evaluate each of the techniques discussed below and arrive at the best solution by comparing the results against the objective function.
Read more about this topic: Consensus Clustering
Famous quotes containing the word hard:
“For a parent, it’s hard to recognize the significance of your work when you’re immersed in the mundane details. Few of us, as we run the bath water or spread the peanut butter on the bread, proclaim proudly, “I’m making my contribution to the future of the planet.” But with the exception of global hunger, few jobs in the world of paychecks and promotions compare in significance to the job of parent.”
—Joyce Maynard (20th century)