Distance metric learning with application to clustering with side-information

E Xing, M Jordan, SJ Russell… - Advances in neural …, 2002 - proceedings.neurips.cc
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - Citeseer
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - cs.berkeley.edu
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

Distance Metric Learning with Application to Clustering with Side-Information

E Xing, M Jordan, SJ Russell… - Advances in Neural …, 2002 - proceedings.neurips.cc
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - academia.edu
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - pages.cs.wisc.edu
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PS][PS] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - people.csail.mit.edu
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance Metric Learning, with Application to Clustering with Side-Information

EP Xing, AY Ng, MI Jordan, S Russell - researchgate.net
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PDF][PDF] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - people.eecs.berkeley.edu
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …

[PS][PS] Distance metric learning, with application to clustering with side-information

EP Xing, AY Ng, MI Jordan, S Russell - qwone.com
Many algorithms rely critically on being given a good metric over their inputs. For instance,
data can often be clustered in many “plausible” ways, and if a clustering algorithm such as K …