Sciweavers

1385 search results - page 43 / 277
» Clustering by Random Projections
Sort
View
TOG
2008
103views more  TOG 2008»
15 years 4 months ago
Sketch-based tree modeling using Markov random field
In this paper, we describe a new system for converting a user's freehand sketch of a tree into a full 3D model that is both complex and realistic-looking. Our system does thi...
Xuejin Chen, Boris Neubert, Ying-Qing Xu, Oliver D...
ICPR
2008
IEEE
16 years 5 months ago
K-means clustering of proportional data using L1 distance
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
131
Voted
VDA
2010
169views Visualization» more  VDA 2010»
15 years 7 months ago
Techniques for precision-based visual analysis of projected data
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...
Tobias Schreck, Tatiana von Landesberger, Sebastia...
ICML
2010
IEEE
15 years 5 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
CLUSTER
2002
IEEE
15 years 9 months ago
Clusters as Large-Scale
In this paper, we describe the use of a cluster as a generalized facility for development. A development facility is a system used primarily for testing and development activities...
Rémy Evard, Narayan Desai, John-Paul Navarr...