DP 1: Supervised and Unsupervised Clustering

Abstract

This paper presents Dp 1, an incremental clustering algorithm that accepts a description of the expected performance task — the goal of learning — and uses that description to alter its learning bias. With different goals Dp 1 addresses a wide range of empirical learning tasks from supervised to unsupervised learning. At one extreme, Dp 1 performs the same task as does ID3, and at the other, it performs the same task as does Cobweb .

Cite

Text

Martin. "DP 1: Supervised and Unsupervised Clustering." European Conference on Machine Learning, 1994. doi:10.1007/3-540-57868-4_82

Markdown

[Martin. "DP 1: Supervised and Unsupervised Clustering." European Conference on Machine Learning, 1994.](https://mlanthology.org/ecmlpkdd/1994/martin1994ecml-dp/) doi:10.1007/3-540-57868-4_82

BibTeX

@inproceedings{martin1994ecml-dp,
  title     = {{DP 1: Supervised and Unsupervised Clustering}},
  author    = {Martin, Joel D.},
  booktitle = {European Conference on Machine Learning},
  year      = {1994},
  pages     = {395-398},
  doi       = {10.1007/3-540-57868-4_82},
  url       = {https://mlanthology.org/ecmlpkdd/1994/martin1994ecml-dp/}
}