Approximate data mining in very large relational data
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
A System for Learning Statistical Motion Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
Scalable visual assessment of cluster tendency for large data sets
Pattern Recognition
A Scalable Framework For Segmenting Magnetic Resonance Images
Journal of Signal Processing Systems
On the efficiency of evolutionary fuzzy clustering
Journal of Heuristics
A scalable framework for cluster ensembles
Pattern Recognition
Extending fuzzy and probabilistic clustering to very large data sets
Computational Statistics & Data Analysis
Density-weighted fuzzy c-means clustering
IEEE Transactions on Fuzzy Systems
International Journal of Approximate Reasoning
Clustering large data sets based on data compression technique and weighted quality measures
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Effective fuzzy c-means based kernel function in segmenting medical images
Computers in Biology and Medicine
Possibility theoretic clustering
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I
Effective fuzzy c-means clustering algorithms for data clustering problems
Expert Systems with Applications: An International Journal
Strong fuzzy c-means in medical image data analysis
Journal of Systems and Software
AICI'12 Proceedings of the 4th international conference on Artificial Intelligence and Computational Intelligence
Weighted Fuzzy-Possibilistic C-Means Over Large Data Sets
International Journal of Data Warehousing and Mining
Two novel fuzzy clustering methods for solving data clustering problems
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.00 |
We present a method for sampling feature vectors in large (e.g., 2000 × 5000 × 16 bit) images that finds subsets of pixel locations which represent c "regions" in the image. Samples are accepted by the chi-square (χ2) or divergence hypothesis test. A framework that captures the idea of efficient extension of image processing algorithms from the samples to the rest of the population is given. Computationally expensive (in time and/or space) image operators (e.g., neural networks (NNs) or clustering models) are trained on the sample, and then extended noniteratively to the rest of the population. We illustrate the general method using fuzzy c-means (FCM) clustering to segment Indian satellite images. On average, the new method can achieve about 99% accuracy (relative to running the literal algorithm) using roughly 24% of the image for training. This amounts to an average savings of 76% in CPU time. We also compare our method to its closest relative in the group of schemes used to accelerate FCM: our method averages a speedup of about 4.2, whereas the multistage random sampling approach achieves an average acceleration of 1.63.