1651 search results - page 148 / 331 » Measuring the Complexity of Classification Problems |
WG
2007
Springer
14 years 2 months ago
2007
Springer
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
TKDE
2008
13 years 8 months ago
2008
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to...
FOCS
2000
IEEE
14 years 13 days ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
We show that there is a set that is almost complete but not complete under polynomial-time many-one (p-m) reductions for the class E of sets computable in deterministic time 2lin ...