✦ LIBER ✦

On the Complexity of Ordinal Clustering

✍ Scribed by Rahul Shah; Martin Farach-Colton

Book ID: 106042246
Publisher: Springer
Year: 2006
Tongue: English
Weight: 240 KB
Volume: 23
Category: Article
ISSN: 0176-4268
DOI: 10.1007/s00357-006-0005-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hierarchical clustering based on ordinal

Hierarchical clustering based on ordinal consistency

✍ John W.T. Lee; Daniel S. Yeung; Eric C.C. Tsang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 306 KB

On the Complexity of Additive Clustering

On the Complexity of Additive Clustering Models

✍ Michael D. Lee 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 178 KB

On ordinal VC-dimension and some notions

On ordinal VC-dimension and some notions of complexity

✍ Eric Martin; Arun Sharma; Frank Stephan 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Turing complexity of the ordinals

✍ Patrick Dehornoy 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Regarding the complexity of additive clu

Regarding the complexity of additive clustering models: Comment on Lee (2001)

✍ Daniel J Navarro 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 97 KB

The additive clustering approach to modeling pairwise similarity of entities is a powerful tool for deriving featural stimulus representations. In a recent paper, Lee (2001) proposes a statistically principled measure for choosing between clustering models that accounts for model complexity as well

On the parallel complexity of hierarchic

On the parallel complexity of hierarchical clustering and CC-complete problems

✍ Raymond Greenlaw; Sanpawat Kantabutra 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB