Sciweavers

1285 search results - page 45 / 257
» On the Complexity of Ordinal Clustering
Sort
View
APAL
2010
115views more  APAL 2010»
13 years 9 months ago
Kripke semantics for provability logic GLP
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
Lev D. Beklemishev
CVPR
2010
IEEE
13 years 9 months ago
Total Bregman divergence and its applications to shape retrieval
Shape database search is ubiquitous in the world of biometric systems, CAD systems etc. Shape data in these domains is experiencing an explosive growth and usually requires search...
Meizhu Liu, Baba C. Vemuri, Shun-ichi Amari, Frank...
BMCBI
2006
90views more  BMCBI 2006»
13 years 9 months ago
Dissecting trait heterogeneity: a comparison of three clustering methods applied to genotypic data
Background: Trait heterogeneity, which exists when a trait has been defined with insufficient specificity such that it is actually two or more distinct traits, has been implicated...
Tricia A. Thornton-Wells, Jason H. Moore, Jonathan...
ICDE
2010
IEEE
173views Database» more  ICDE 2010»
14 years 3 months ago
Progressive clustering of networks using Structure-Connected Order of Traversal
— Network clustering enables us to view a complex network at the macro level, by grouping its nodes into units whose characteristics and interrelationships are easier to analyze ...
Dustin Bortner, Jiawei Han
CIKM
2009
Springer
14 years 3 months ago
Fragment-based clustering ensembles
Clustering ensembles combine different clustering solutions into a single robust and stable one. Most of existing methods become highly time-consuming when the data size turns to ...
Ou Wu, Mingliang Zhu, Weiming Hu