Sciweavers

1971 search results - page 152 / 395
» A clustering method that uses lossy aggregation of data
Sort
View
PAMI
2002
106views more  PAMI 2002»
13 years 8 months ago
Performance Evaluation of Some Clustering Algorithms and Validity Indices
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated annealing (SA) based technique, in conjunction with four ...
Ujjwal Maulik, Sanghamitra Bandyopadhyay
CVPR
2012
IEEE
11 years 11 months ago
Active image clustering: Seeking constraints from humans to complement algorithms
We propose a method of clustering images that combines algorithmic and human input. An algorithm provides us with pairwise image similarities. We then actively obtain selected, mo...
Arijit Biswas, David W. Jacobs
ICPR
2008
IEEE
14 years 10 months ago
Kernel bandwidth estimation in methods based on probability density function modelling
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Adrian G. Bors, Nikolaos Nasios
KDD
2004
ACM
143views Data Mining» more  KDD 2004»
14 years 9 months ago
Incremental maintenance of quotient cube for median
Data cube pre-computation is an important concept for supporting OLAP(Online Analytical Processing) and has been studied extensively. It is often not feasible to compute a complet...
Cuiping Li, Gao Cong, Anthony K. H. Tung, Shan Wan...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 9 months ago
Extensible optimization in overlay dissemination trees
We introduce XPORT, a profile-driven distributed data dissemination system that supports an extensible set of data types, profile types, and optimization metrics. XPORT efficientl...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...