Fetching the paper…
Reading the bibliography…
State-of-the-art clustering algorithms use heuristics to partition the feature space and provide little insight into the rationale for cluster membership, limiting their interpretability.
“The Use and Interpretation of Principal Component Analysis in Applied Research”
C. Rao · 1964
Earlier work this paper cites.
“Well-Separated Clusters and Optimal Fuzzy Partitions”
J Dunn · 1974
Earlier work this paper cites.
“Classification and regression trees”
Leo Breiman, Jerome Friedman, Charles Stone and Richard Olshen · 1984
Earlier work this paper cites.
“Silhouettes: a graphical aid to the interpretation and validation of cluster analysis”
Peter Rousseeuw · 1987
Earlier work this paper cites.
“Centroid-based summarization of multiple documents”
Dragomir. Radev, Hongyan Jing, Małgorzata Styś and Daniel Tam · 2003
Earlier work this paper cites.
“Supervised Hierarchical Clustering Using CART”
T Hancock, D Coomans and Y Everingham · 2003
Cited alongside, same era.
“Fundamental clustering problems suite (fcps)”, 2005
A Ultsch · 2005
Cited alongside, same era.
“A New Clustering Approach for Symbolic Data and Its Validation: Application to the Healthcare Data”
Haytham Elghazel et al · 2006
Cited alongside, same era.
“Understanding of internal clustering validation measures”
Yanchi Liu et al · 2010
Cited alongside, same era.
“Principal component analysis”
Ian Jolliffe · 2011
Later among the works it cites.
“An Enhanced k-Means Clustering Algorithm for Pattern Discovery in Healthcare Data”
Ramzi. Haraty, Mohamad Dimishkieh and Mehedi Masud · 2015
Later among the works it cites.
“Optimal classification trees”
Dimitris Bertsimas and Jack Dunn · 2017
Later among the works it cites.
“Optimal Trees”
D. Bertsimas and J. Dunn · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…