Sciweavers

331 search results - page 27 / 67
» Possibilistic Clustering in Feature Space
Sort
View
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
14 years 8 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
SIGMOD
2003
ACM
237views Database» more  SIGMOD 2003»
14 years 8 months ago
Qcluster: Relevance Feedback Using Adaptive Clustering for Content-Based Image Retrieval
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
Deok-Hwan Kim, Chin-Wan Chung
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 8 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
CVPR
2007
IEEE
14 years 9 months ago
Robust Estimation of Texture Flow via Dense Feature Sampling
Texture flow estimation is a valuable step in a variety of vision related tasks, including texture analysis, image segmentation, shape-from-texture and texture remapping. This pap...
Yu-Wing Tai, Michael S. Brown, Chi-Keung Tang
ICASSP
2010
IEEE
13 years 8 months ago
Graph-spectrum-based neural spike features for stereotrodes and tetrodes
Extracellular recording of neural signals records the action potentials (known as spikes) of neurons adjacent to the electrode as well as the noise generated by the overall neural...
Yasser Ghanbari, Panos Papamichalis, Larry Spence