Sciweavers

1285 search results - page 70 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Convenient reconstruction of natural plants by images
Convenient reconstruction of natural plants is a difficult task because of their intrinsic complex geometry. In this paper, we propose a convenient image-based approach to modeli...
Wei Ma, Hongbin Zha
CHI
1998
ACM
14 years 1 months ago
Exploring Browser Design Trade-Offs Using a Dynamical Model of Optimal Information Foraging
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
Peter Pirolli
IJON
2007
93views more  IJON 2007»
13 years 8 months ago
Development of multi-cluster cortical networks by time windows for spatial growth
Many neural networks, such as the complex cortical networks of the mammalian brain, are organized in multiple clusters, with many connections within but few links between clusters...
Marcus Kaiser, Claus C. Hilgetag
ECCV
2008
Springer
14 years 10 months ago
Quick Shift and Kernel Methods for Mode Seeking
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
Andrea Vedaldi, Stefano Soatto
KDD
2004
ACM
164views Data Mining» more  KDD 2004»
14 years 9 months ago
Cluster-based concept invention for statistical relational learning
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
Alexandrin Popescul, Lyle H. Ungar