1285 search results - page 3 / 257 » On the Complexity of Ordinal Clustering |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
FLAIRS
2009
13 years 5 months ago
2009
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
EUROCOLT
1999
Springer
13 years 12 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
KES
2004
Springer
14 years 28 days ago
2004
Springer
Clustering groups records that are similar to each other into the same group, and those that are less similar into different groups. Clustering data of mixed types is difficult du...