Sciweavers

371 search results - page 32 / 75
» Learning to match and cluster large high-dimensional data se...
Sort
View
CIDM
2009
IEEE
14 years 12 days ago
An architecture and algorithms for multi-run clustering
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Vadee...
PR
2008
228views more  PR 2008»
13 years 7 months ago
Accurate integration of multi-view range images using k-means clustering
3D modelling finds a wide range of applications in industry. However, due to the presence of surface scanning noise, accumulative registration errors, and improper data fusion, re...
Hong Zhou, Yonghuai Liu
BMCBI
2005
144views more  BMCBI 2005»
13 years 7 months ago
Redefinition of Affymetrix probe sets by sequence overlap with cDNA microarray probes reduces cross-platform inconsistencies in
Background: Comparison of data produced on different microarray platforms often shows surprising discordance. It is not clear whether this discrepancy is caused by noisy data or b...
Scott L. Carter, Aron C. Eklund, Brigham H. Mecham...
PRESENCE
2007
167views more  PRESENCE 2007»
13 years 7 months ago
TimbreFields: 3D Interactive Sound Models for Real-Time Audio
We describe a methodology for Virtual Reality designers to capture and resynthesize the variations in sound made by objects when we interact with them through contact such as touc...
Richard Corbett, Kees van den Doel, John E. Lloyd,...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan