Sciweavers

2907 search results - page 125 / 582
» Trust analysis with clustering
Sort
View
166
Voted
ICPPW
2003
IEEE
16 years 7 days ago
Performance Analysis of Approximate String Searching Implementations for Heterogeneous Computing Platform
This paper presents an analytical performance prediction model that can be used to predict the speedup and similar performance metrics of four approximate string searching implemen...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ICPR
2002
IEEE
15 years 12 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho
227
Voted
IGARSS
2009
15 years 4 months ago
Endmember Extraction from Hyperspectral Imagery using a Parallel Ensemble Approach with Consensus Analysis
We have explored in this paper a framework to test in a quantitative manner the stability of different endmember extraction and spectral unmixing algorithms based on the concept o...
Fermin Ayuso, Javier Setoain, Manuel Prieto, Chris...
IDEAL
2007
Springer
16 years 1 months ago
Methods to Bicluster Validation and Comparison in Microarray Data
There are lots of validation indexes and techniques to study clustering results. Biclustering algorithms have been applied in Systems Biology, principally in DNA Microarray analysi...
Rodrigo Santamaría, Luis Quintales, Roberto...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 7 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