Sciweavers

5659 search results - page 34 / 1132
» Comparing Clusterings in Space
Sort
View
WSCG
2003
174views more  WSCG 2003»
13 years 10 months ago
An Efficient Algorithm for Codebook Design in Transform Vector Quantization
In this paper, a new wavelet-domain codebook design algorithm is proposed for image coding. The method utilizes mean-squared error and variance based selection schemes for good cl...
Momotaz Begum, Nurun Nahar, Kaneez Fatimah, M. K. ...
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 9 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
KAIS
2000
87views more  KAIS 2000»
13 years 8 months ago
An Index Structure for Data Mining and Clustering
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
Xiong Wang, Jason Tsong-Li Wang, King-Ip Lin, Denn...
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
DATE
2005
IEEE
113views Hardware» more  DATE 2005»
14 years 2 months ago
Evaluation of Bus Based Interconnect Mechanisms in Clustered VLIW Architectures
With new sophisticated compiler technology, it is possible to schedule distant instructions efficiently. As a consequence, the amount of exploitable instruction level parallelism...
Anup Gangwar, M. Balakrishnan, Preeti Ranjan Panda...