Sciweavers

1301 search results - page 17 / 261
» Default Clustering from Sparse Data Sets
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
13 years 6 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
ECCV
2008
Springer
14 years 10 months ago
Scale Invariant Action Recognition Using Compound Features Mined from Dense Spatio-temporal Corners
Abstract. The use of sparse invariant features to recognise classes of actions or objects has become common in the literature. However, features are often "engineered" to...
Andrew Gilbert, John Illingworth, Richard Bowden
CVPR
2006
IEEE
14 years 10 months ago
Unsupervised Learning of Categories from Sets of Partially Matching Image Features
We present a method to automatically learn object categories from unlabeled images. Each image is represented by an unordered set of local features, and all sets are embedded into...
Kristen Grauman, Trevor Darrell
TKDE
2008
197views more  TKDE 2008»
13 years 8 months ago
Agglomerative Fuzzy K-Means Clustering Algorithm with Selection of Number of Clusters
In this paper, we present an agglomerative fuzzy K-Means clustering algorithm for numerical data, an extension to the standard fuzzy K-Means algorithm by introducing a penalty term...
Mark Junjie Li, Michael K. Ng, Yiu-ming Cheung, Jo...
PAKDD
2007
ACM
184views Data Mining» more  PAKDD 2007»
14 years 2 months ago
A Fast Algorithm for Finding Correlation Clusters in Noise Data
Abstract. Noise significantly affects cluster quality. Conventional clustering methods hardly detect clusters in a data set containing a large amount of noise. Projected clusterin...
Jiuyong Li, Xiaodi Huang, Clinton Selke, Jianming ...