Sciweavers

1839 search results - page 16 / 368
» Feature Selection in Clustering Problems
Sort
View
SBACPAD
2005
IEEE
176views Hardware» more  SBACPAD 2005»
14 years 1 months ago
Analyzing and Improving Clustering Based Sampling for Microprocessor Simulation
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
Yue Luo, Ajay Joshi, Aashish Phansalkar, Lizy Kuri...
MM
2010
ACM
402views Multimedia» more  MM 2010»
13 years 6 months ago
Discriminative codeword selection for image representation
Bag of features (BoF) representation has attracted an increasing amount of attention in large scale image processing systems. BoF representation treats images as loose collections...
Lijun Zhang 0005, Chun Chen, Jiajun Bu, Zhengguang...
PRL
2010
158views more  PRL 2010»
13 years 6 months ago
Data clustering: 50 years beyond K-means
: Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organ...
Anil K. Jain
TKDE
2008
197views more  TKDE 2008»
13 years 7 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...
DEXAW
2009
IEEE
173views Database» more  DEXAW 2009»
14 years 2 months ago
Automatic Cluster Number Selection Using a Split and Merge K-Means Approach
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...
Markus Muhr, Michael Granitzer